Narrow search
Showing 31 - 40 of 742,724
Cover Image
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C.; Williamson, David P. - In: Mathematics of operations research 48 (2023) 1, pp. 393-418
Persistent link: https://www.econbiz.de/10014312556
Cover Image
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane; Gacem, Oussama; Hifi, Mhand - In: Journal of the Operational Research Society 73 (2022) 3, pp. 540-557
Persistent link: https://www.econbiz.de/10013170161
Cover Image
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz; Cardonha, Carlos; Bergman, David - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 2, pp. 1070-1085
Persistent link: https://www.econbiz.de/10013361429
Cover Image
Shift scheduling and rostering with same shift-type and weekend-off fairness constraints in call centres
Wang, Ruicheng; Xu, Yue; Wang, Xiuli - In: European journal of industrial engineering : EJIE 19 (2025) 3, pp. 340-373
Persistent link: https://www.econbiz.de/10015375742
Cover Image
Robust MILP formulations for the two-stage weighted vertex p-center problem
Duran-Mateluna, Cristian; Ales, Zacharie; Elloumi, Sourour - In: Computers & operations research : and their … 159 (2023), pp. 1-13
Persistent link: https://www.econbiz.de/10014455632
Cover Image
Approximation algorithms for integer covering problems via greedy column generation
Crama, Yves; Van De Klundert, Joris - 1993
Persistent link: https://www.econbiz.de/10000873864
Cover Image
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Jooken, Jorik; Leyman, Pieter; Wauters, Tony; De … - In: Computers & operations research : and their … 150 (2023), pp. 1-25
Persistent link: https://www.econbiz.de/10013485774
Cover Image
Complexity Results and Exact Algorithms for Robust Knapsack Problems
Nobibon, F. Talla - 2011
the weights, for three different objective functions. Furthermore, we develop a scenario-relaxation algorithm for solving …
Persistent link: https://www.econbiz.de/10013117877
Cover Image
Improved Approximation Algorithms for K-Submodular Maximization Under a Knapsack Constraint
Ha, Dung; Pham, Canh; Tran, Tan - 2023
significantly improve both the approximation ratio and query complexity of existing practical algorithms.Our first algorithm, $\FA …) applying algorithmic frameworks that combine the solution of the first algorithm and greedy threshold method to improve …
Persistent link: https://www.econbiz.de/10014361148
Cover Image
Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
Wu, Lebao; Jiang, Zuhua; Wang, Fuhua - In: Computers & operations research : and their … 155 (2023), pp. 1-16
Persistent link: https://www.econbiz.de/10014339037