Search Results - subject:"Chinese Postman problem"

An enhanced analog nearest neighbor algorithm for route planning after a major disaster

Magnaye, Romulo B.; Sauser, Brian; Chaudhry, Sohail S.; … - In: International journal of operations and quantitative … 26 (2020) 4, pp. 241-253

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

The Chinese deliveryman problem

Ee, Martijn van; Sitters, René - In: 4OR : quarterly journal of the Belgian, French and … 18 (2020) 3, pp. 341-356

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

A distance matrix based algorithm for solving the traveling salesman problem

Wang, Shengbin; Rao, Weizhen; Hong, Yuan - In: Operational research : an international journal 20 (2020) 3, pp. 1505-1542

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

A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

Yuan, Yuan; Cattaruzza, Diego; Ogier, Maxime; Semet, … - In: European journal of operational research : EJOR 286 (2020) 3, pp. 849-866

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

The stochastic multipath traveling salesman problem with dependent random travel costs

Fadda, Edoardo; Tiotsop, Lohic Fotio; Manerba, Daniele; … - In: Transportation science : a journal of the Institute for … 54 (2020) 5, pp. 1372-1387

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

A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP

Waissi, Gary R.; Kaushal, Pragya - In: Opsearch : journal of the Operational Research Society … 57 (2020) 1, pp. 73-87

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

The approximation ratio of the 2-Opt heuristic for the metric Traveling Salesman Problem

Hougardy, Stefan; Zaiser, Fabian; Zhong, Xianghui - In: Operations research letters 48 (2020) 4, pp. 401-404

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

A New Lagrangean Approach for the Travelling Salesman Problem

Jornsten, Kurt - 2015

In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman problem more suitable for Lagrangean relaxation and analyse the new approach on examples from TSP Lib. Furthermore the Lagrangean relaxed subproblems are travelling salesman alike which means that...

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

A new Lagrangean approach for the travelling salesman problem

Jörnsten, Kurt O.; Kalcsics, Jörg - 2015

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

Coincidence of cooperative game theoretic solutions in the appointment problem

Chun, Youngsub; Parky, Nari; Yengin, Duygu - 2015

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

A service of the

zbw