Narrow search
Showing 1 - 10 of 39,886
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
Some new clique inequalities in four-index hub location models
Landete, Mercedes; Peiró, Juanjo - In: European journal of operational research : EJOR 318 (2024) 3, pp. 768-777
Persistent link: https://www.econbiz.de/10015048157
Cover Image
The Ordered Median Tree Location Problem
Pozo, Miguel A.; Puerto, Justo; Torrejón, Alberto - In: Computers & operations research : an international journal 169 (2024), pp. 1-18
Persistent link: https://www.econbiz.de/10015066070
Cover Image
Reliable communication network design : the hybridisation of metaheuristics with the branch and bound method
Ozkan, Omer; Ermis, Murat; Bekmezci, Ilker - In: Journal of the Operational Research Society 71 (2020) 5, pp. 784-799
Persistent link: https://www.econbiz.de/10012216779
Cover Image
A branch and bound algorithm for solving large-scale single-machine scheduling problems with non-identical release dates
Zegordi, Seyed Hessameddin; Yavari, Mohammad - In: European journal of industrial engineering : EJIE 12 (2018) 1, pp. 24-42
Persistent link: https://www.econbiz.de/10011897441
Cover Image
Learning-accelerated mixed-integer quadratic programming for unit commitment
Maisonneuve, Philippe; Lesage-Landry, Antoine - 2024
Persistent link: https://www.econbiz.de/10014483361
Cover Image
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel; Dutour Sikirić, Mathieu - In: International transactions in operational research : … 23 (2016) 5, pp. 853-860
Persistent link: https://www.econbiz.de/10011621901
Cover Image
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
Morrison, David Robert; Sewell, Edward C.; Jacobson, … - In: European journal of operational research : EJOR 236 (2014) 2, pp. 403-409
Persistent link: https://www.econbiz.de/10010366188
Cover Image
A double oracle approach to minmax regret optimization problems with interval data
Gilbert, Hugo; Spanjaard, Olivier - In: European journal of operational research : EJOR 262 (2017) 3, pp. 929-943
Persistent link: https://www.econbiz.de/10011802305
Cover Image
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland - In: European journal of operational research : EJOR 274 (2019) 1, pp. 49-64
Persistent link: https://www.econbiz.de/10011989974