Similar Search Results

Mathematical models and routing algorithms for economical cutting tool paths

Makarovskikh, T. A.; Panyukov, A. V.; Savitskiy, E. A. - In: International journal of production research 56 (2018) 3, pp. 1171-1188

Persistent link: https://www.econbiz.de/10011870694

Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs

Nishi, Tatsushi; Shimatani, Kenichi; Inuiguchi, Masahiro - In: International journal of production research 47 (2009) 14, pp. 3957-3977

Persistent link: https://www.econbiz.de/10003890653

An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem

Gao, Zhihan - In: Operations research letters 41 (2013) 6, pp. 615-617

Persistent link: https://www.econbiz.de/10010236087

Speeding up Martins' algorithm for multiple objective shortest path problems

Demeyer, Sofie; Goedgebeur, Jan; Audenaert, Pieter; … - In: 4OR : a quarterly journal of operations research 11 (2013) 4, pp. 323-348

Persistent link: https://www.econbiz.de/10010228026

Solving shortest path problems with a weight constraint and replenishment arcs

Smith, Olivia J.; Boland, Natashia; Waterer, Hamish - In: Computers & operations research : and their … 39 (2012) 5, pp. 964-984

Persistent link: https://www.econbiz.de/10010217431

Approximation algorithms for solving the constrained arc routing problem in mixed graphs

Ding, Honglin; Li, Jianping; Lih, Ko-wei - In: European journal of operational research : EJOR 239 (2014) 1, pp. 80-88

Persistent link: https://www.econbiz.de/10010403686

Ant local search for refueling locomotives

Schindl, David; Zufferey, Nicolas - 2012

The problem studied in this paper consists in optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists in determining the number of trucks contracted for each yard and to determine the refueling plan of each locomotive, while minimizing the costs and...

Persistent link: https://www.econbiz.de/10009564419

On algorithms for the tricriteria shortest path problem with two bottleneck objective functions

Pinto, Leizer Limo; Pascoal, Marta M. B. - In: Computers & operations research : and their … 37 (2010) 10, pp. 1774-1779

Persistent link: https://www.econbiz.de/10003963137

Two-phase branch-and-cut for the mixed capacitated general routing problem

Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; … - In: European journal of operational research : EJOR 243 (2015) 1, pp. 17-29

Persistent link: https://www.econbiz.de/10010492337

An improved integrality gap for asymmetric TSP paths

Friggstad, Zachary; Gupta, Anupam; Singh, Mohit - In: Mathematics of operations research 41 (2016) 3, pp. 745-757

Persistent link: https://www.econbiz.de/10011520559