✦ LIBER ✦

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

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An n-Constraint Formulation of the (Time

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

Technical Note—An Exact Algorithm for th

✍ Baker, Edward K. 📂 Article 📅 1983 🏛 INFORMS 🌐 English ⚖ 429 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

The multiple traveling salesman problem:

✍ Tolga Bektas 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A special case of the n-vertex traveling

✍ James K. Park 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 995 KB