Narrow search
Showing 1 - 10 of 68
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 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
A time bucket formulation for the traveling salesman problem with time windows
Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea; … - In: INFORMS journal on computing : JOC 24 (2012) 1, pp. 132-147
Persistent link: https://www.econbiz.de/10009523285
Cover Image
Estimation-based local search for stochastic combinatorial optimization using delta evaluations : s case study on the probabilistic traveling salesman problem
Birattari, Mauro; Balaprakash, Prasanna; Stützle, Thomas; … - In: INFORMS journal on computing : JOC 20 (2008) 4, pp. 644-658
Persistent link: https://www.econbiz.de/10003772398
Cover Image
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou; Rodrigues, Brian - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 636-645
Persistent link: https://www.econbiz.de/10011422648
Cover Image
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira; Nascimento, Roberto Quirino do; … - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 752-765
Persistent link: https://www.econbiz.de/10011617601
Cover Image
New state-space relaxations for solving the traveling salesman problem with time windows
Baldacci, Roberto; Mingozzi, Aristide; Roberti, Roberto - In: INFORMS journal on computing : JOC 24 (2012) 3, pp. 356-371
Persistent link: https://www.econbiz.de/10009583079