Narrow search
Showing 1 - 10 of 90
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
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
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
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
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
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea; Cacchiani, Valentina; Malaguti, Enrico - In: INFORMS journal on computing : JOC 29 (2017) 3, pp. 457-473
Persistent link: https://www.econbiz.de/10011743447
Cover Image
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
Wang, Guanglei; Ben-Ameur, Walid; Ouorou, Adam - In: European journal of operational research : EJOR 276 (2019) 1, pp. 28-39
Persistent link: https://www.econbiz.de/10011997852
Cover Image
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu; Boland, Natashia; Dilkina, Bistra; … - In: European journal of operational research : EJOR 301 (2022) 3, pp. 828-840
Persistent link: https://www.econbiz.de/10013267791
Cover Image
A relax-and-cut algorithm for the Knapsack Node Weighted Steiner Tree Problem
Cordone, Roberto; Trubian, Marco - In: Asia Pacific journal of operational research : APJOR 25 (2008) 3, pp. 373-391
Persistent link: https://www.econbiz.de/10003765910
Cover Image
Bounds on the size of branch-and-bound proofs for integer knapsacks
Krishnamoorthy, Bala - In: Operations research letters 36 (2008) 1, pp. 19-25
Persistent link: https://www.econbiz.de/10003768458