Narrow search
Showing 1 - 10 of 621,128
Cover Image
Branch-Relax-and-Check : a tractable decomposition method for order acceptance and identical parallel machine scheduling
Naderi, Bahman; Roshanaei, Vahid - In: European journal of operational research : EJOR 286 (2020) 3, pp. 811-827
Persistent link: https://www.econbiz.de/10012291573
Cover Image
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Neto, Teresa; Constantino, Miguel Fragoso; Martins, Isabel - In: International transactions in operational research : … 20 (2013) 5, pp. 689-709
Persistent link: https://www.econbiz.de/10009790939
Cover Image
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
Kacem, Imed; Chu, Chengbin; Souissi, Ahmed - In: Computers & operations research : and their … 35 (2008) 3, pp. 827-844
Persistent link: https://www.econbiz.de/10003669690
Cover Image
Enhancing branch-and-bound for multiobjective 0-1 programming
Forget, Nicolas; Parragh, Sophie N. - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 1, pp. 285-304
Persistent link: https://www.econbiz.de/10014474921
Cover Image
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo - In: European journal of operational research : EJOR 289 (2021) 2, pp. 435-455
Persistent link: https://www.econbiz.de/10012416751
Cover Image
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas; Gadegaard, Sune Lauth; Klamroth, Kathrin; … - In: Computers & operations research : and their … 148 (2022), pp. 1-16
Persistent link: https://www.econbiz.de/10013483596
Cover Image
A branch and bound algorithm for a class of biobjective mixed integer programs
Stidsen, Thomas; Andersen, Kim Allan; Dammann, Bernd - In: Management science : journal of the Institute for … 60 (2014) 4, pp. 1009-1032
Persistent link: https://www.econbiz.de/10010347789
Cover Image
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique; Buriol, Luciana S. - In: European journal of operational research : EJOR 277 (2019) 1, pp. 84-99
Persistent link: https://www.econbiz.de/10012014811
Cover Image
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre; Nemhauser, George L. - In: Operations research letters 43 (2015) 3, pp. 273-278
Persistent link: https://www.econbiz.de/10011309550
Cover Image
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu; Boland, Natashia; Savelsbergh, Martin W. P. - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1354-1367
Persistent link: https://www.econbiz.de/10012796862