Narrow search
Showing 1 - 10 of 60
Cover Image
Approximate dynamic programming for ambulance redeployment
Maxwell, Matthew S.; Restrepo, Mateo; Henderson, Shane G.; … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 266-281
Persistent link: https://www.econbiz.de/10003979984
Cover Image
Path-reduced costs for eliminating arcs in routing and scheduling
Irnich, Stefan; Desaulniers, Guy; Desrosiers, Jacques; … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 297-313
Persistent link: https://www.econbiz.de/10003979988
Cover Image
A parallel algorithm for the vehicle routing problem
Groër, Chris; Golden, Bruce; Wasil, Edward - In: INFORMS journal on computing : JOC 23 (2011) 2, pp. 315-330
Persistent link: https://www.econbiz.de/10009156487
Cover Image
The generalized covering salesman problem
Golden, Bruce; Naji-Azimi, Zahra; Raghavan, S.; Salari, … - In: INFORMS journal on computing : JOC 24 (2012) 4, pp. 534-553
Persistent link: https://www.econbiz.de/10010219621
Cover Image
A generic branch-and-cut algorithm for multiobjective optimization problems : application to the multilabel traveling salesman problem
Jozefowiez, Nicolas; Laporte, Gilbert; Semet, Frédéric - In: INFORMS journal on computing : JOC 24 (2012) 4, pp. 554-564
Persistent link: https://www.econbiz.de/10010219622
Cover Image
A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Martínez, Manuel A. Alba; Cordeau, Jean-François; … - In: INFORMS journal on computing : JOC 25 (2013) 1, pp. 41-55
Persistent link: https://www.econbiz.de/10009728362
Cover Image
A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem
Nagata, Yuichi; Kobayashi, Shigenobu - In: INFORMS journal on computing : JOC 25 (2013) 2, pp. 346-363
Persistent link: https://www.econbiz.de/10009753749
Cover Image
An exact algorithm for the multitrip vehicle routing problem
Mingozzi, Aristide; Roberti, Roberto; Toth, Paolo - In: INFORMS journal on computing : JOC 25 (2013) 2, pp. 193-207
Persistent link: https://www.econbiz.de/10009753762
Cover Image
An integer-programming-based approach to the close-enough traveling salesman problem
Behdani, Behnam; Smith, J. Cole - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 415-432
Persistent link: https://www.econbiz.de/10010399822
Cover Image
Penalty-based algorithms for the stochastic obstacle scene problem
Aksakalli, Vural; Ari, Ibrahim - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 370-384
Persistent link: https://www.econbiz.de/10010362436