Narrow search
Showing 41 - 50 of 34,941
Cover Image
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Urrutia, Sebastián; Milanés, Anolan; Lokketangen, Arne - In: International transactions in operational research : … 22 (2015) 1, pp. 61-75
Persistent link: https://www.econbiz.de/10010498603
Cover Image
Iterated local search for the label printing problem
Alonso-Pecina, Federico; Romero, David; Cruz-Chávez, … - In: Journal of the Operational Research Society 75 (2024) 1, pp. 39-48
Persistent link: https://www.econbiz.de/10014555569
Cover Image
Engineering management models for urban security
Muaafa, Mohammed; Ramirez-Marquez, Jose Emmanuel - In: IEEE transactions on engineering management : EM 64 (2017) 1, pp. 29-41
Persistent link: https://www.econbiz.de/10011649395
Cover Image
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
Nowak, Ivo; Vigerske, Stefan - In: Central European journal of operations research : CEJOR … 16 (2008) 2, pp. 127-138
Persistent link: https://www.econbiz.de/10003714386
Cover Image
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Pepin, Ann-Sophie; Desaulniers, Guy; Hertz, Alain; … - In: Journal of scheduling 12 (2009) 1, pp. 17-30
Persistent link: https://www.econbiz.de/10003832878
Cover Image
New lower bounds and exact method for the m-PVRP
Ngueveu, Sandra Ulrich; Prins, Christian; Calvo, … - In: Transportation science : a journal of the Institute for … 47 (2013) 1, pp. 38-52
Persistent link: https://www.econbiz.de/10009727139
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
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
Akyüz, M. Hakan; Altınel, İ. Kuban; Öncan, Temel - In: ORP 3 - OR for young researchers and practitioners, (pp. 45-71). 2014
Persistent link: https://www.econbiz.de/10010436814
Cover Image
A parallel branch-and-bound approach to the rectangular guillotine strip cutting Problem
Bak, Slawomir; Błażewicz, Jacek; Pawlak, Grzegorz; … - In: INFORMS journal on computing : JOC 23 (2011) 1, pp. 15-25
Persistent link: https://www.econbiz.de/10008935649
Cover Image
Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
Pepin, Ann-Sophie; Desaulniers, Guy; Hertz, Alain; … - 2006
Persistent link: https://www.econbiz.de/10003391311