✦ LIBER ✦

An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

✍ Scribed by Kenneth R. Fox, Bezalel Gavish and Stephen C. Graves

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Technical Note—An n -Constraint Formulat

✍ Fox, Kenneth R.; Gavish, Bezalel; Graves, Stephen C. 📂 Article 📅 1980 🏛 INFORMS 🌐 English ⚖ 217 KB

A classification of formulations for the

✍ Luis Gouveia; Stefan Voß 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Natural and extended formulations for th

✍ Godinho, Maria Teresa; Gouveia, Luis; Pesneau, Pierre 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Time-dependent traveling salesman proble

✍ Abilio Lucena 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

The time dependent traveling salesman pr

✍ Hernán Abeledo, Ricardo Fukasawa, Artur Pessoa… 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 550 KB

An Exact Algorithm for the Time-Constrai

✍ Edward K. Baker 📂 Article 📅 1983 🏛 INFORMS 🌐 English ⚖ 209 KB