Narrow search
Showing 41 - 50 of 665,214
Cover Image
Solving the swath segment selection problem through Lagrangean relaxation
Cordone, Roberto; Gandellini, Federico; Righini, Giovanni - In: Computers & operations research : and their … 35 (2008) 3, pp. 854-862
Persistent link: https://www.econbiz.de/10003669707
Cover Image
Lagrangian bounds for just-in-time job-shop scheduling
Baptiste, Philippe; Flamini, Marta; Sourd, Francis - In: Computers & operations research : and their … 35 (2008) 3, pp. 906-915
Persistent link: https://www.econbiz.de/10003669773
Cover Image
A branch and bound algorithm for disassembly scheduling with assembly product structure
Kim, H.-J.; Lee, Duk Hee; Xirouchakis, P.; Kwon, O. K. - In: Journal of the Operational Research Society : OR 60 (2009) 3, pp. 419-430
Persistent link: https://www.econbiz.de/10003856903
Cover Image
A branch and bound algorithm for the cyclic job-shop problem with transportation
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven - In: Computers & operations research : and their … 39 (2012) 12, pp. 3200-3214
Persistent link: https://www.econbiz.de/10009576471
Cover Image
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
Kellegöz, Talip; Toklu, Bilal - In: Computers & operations research : and their … 39 (2012) 12, pp. 3344-3360
Persistent link: https://www.econbiz.de/10009577182
Cover Image
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric - In: Computers & operations research : and their … 66 (2016), pp. 153-159
Persistent link: https://www.econbiz.de/10011429002
Cover Image
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel - In: Journal of combinatorial optimization 24 (2012) 3, pp. 347-373
Persistent link: https://www.econbiz.de/10009657496
Cover Image
A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
Yao, Shiqing; Jiang, Zhibin; Li, Na - In: Computers & operations research : and their … 39 (2012) 5, pp. 939-951
Persistent link: https://www.econbiz.de/10010217415
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
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
Fleszar, Krzysztof; Hindi, Khalil S. - In: European journal of operational research : EJOR 271 (2018) 3, pp. 839-848
Persistent link: https://www.econbiz.de/10011903223