Narrow search
Showing 1 - 10 of 748
Cover Image
JD.com : operations research algorithms drive intelligent warehouse robots to work
Qin, Hengle; Xiao, Jun; Ge, Dongdong; Xin, Linwei; Gao, … - In: INFORMS journal on applied analytics 52 (2022) 1, pp. 42-55
Persistent link: https://www.econbiz.de/10012817983
Cover Image
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof - In: European journal of operational research : EJOR 298 (2022) 1, pp. 89-98
Persistent link: https://www.econbiz.de/10013206812
Cover Image
A branch-and-bound method for the bi-objective simple line assembly balancing problem
Cerqueus, Audrey; Delorme, Xavier - In: International journal of production research 57 (2019) 18, pp. 5640-5659
Persistent link: https://www.econbiz.de/10012193644
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
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
Cover Image
A branch-and-bound algorithm for hard multiple knapsack problems
Fukunaga, Alex S. - 2011
Persistent link: https://www.econbiz.de/10008986889
Cover Image
A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
Li, Xiangyong; Aneja, Yash P. - In: INFORMS journal on computing : JOC 24 (2012) 3, pp. 443-456
Persistent link: https://www.econbiz.de/10009583061
Cover Image
A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem
Li, Xiangyong; Aneja, Y. P.; Huo, Jiazhen - In: Omega : the international journal of management science 40 (2012) 2, pp. 210-217
Persistent link: https://www.econbiz.de/10009315617
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