On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

Author： Pesant G. Gendreau M. Potvin J.-Y. Rousseau J.-M.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.117, Iss.2, 1999-09, pp. : 253-263

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

By Malandraki C. Dial R.B.

European Journal of Operational Research, Vol. 90, Iss. 1, 1996-04 ,pp. : 45-55

Elsevier

Access to resources Recommend Favorite

Submodularity and the traveling salesman problem

By Herer Y.T.

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 489-508

Elsevier

Access to resources Recommend Favorite

A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex

By Tang L. Liu J. Rong A. Yang Z.

European Journal of Operational Research, Vol. 124, Iss. 2, 2000-07 ,pp. : 267-282

Elsevier

Access to resources Recommend Favorite

The asymmetric traveling salesman problem with replenishment arcs

By Boland N.L. Clarke L.W. Nemhauser G.L.

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 408-427

Elsevier

Access to resources Recommend Favorite

Relaxed tours and path ejections for the traveling salesman problem

By Rego C.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 522-538

Elsevier

Access to resources Recommend Favorite