✦ LIBER ✦

Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic

✍ Scribed by de Oliveira, Lucas; de Souza, Cid C.; Yunes, Tallys

Book ID: 121912209
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 474 KB
Volume: 236
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.12.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Benders' cuts guided large neighborhood

Benders' cuts guided large neighborhood search for the traveling umpire problem

✍ Michael A. Trick; Hakan Yildiz 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

A Time-Based Formulation and Upper Bound

A Time-Based Formulation and Upper Bounding Scheme for the Selective Travelling Salesperson Problem

✍ H. H. Millar and M. Kiragu 📂 Article 📅 1997 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 294 KB

A multistart heuristic for the equality

A multistart heuristic for the equality generalized traveling salesman problem

✍ Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

The optimum assignments and a new heuris

The optimum assignments and a new heuristic approach for the traveling salesman problem

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 774 KB

A new formulation and approach for the b

A new formulation and approach for the black and white traveling salesman problem

✍ Muter, İbrahim 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A branch and bound algorithm for the tra

A branch and bound algorithm for the traveling purchaser problem

✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm