مرکز منطقه ای اطلاع رساني علوم و فناوري - New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Title of article :

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Author/Authors :

Subhash C. Sarin، نويسنده , , Hanif D. Sherali، نويسنده , , Ajay Bhootra، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 2005

Pages :

From page :

To page :

Keywords :

Subtour elimination constraints , Asymmetric travelingsalesman problem , Precedence constraints

Journal title :

Operations Research Letters

Serial Year :

2005

Journal title :

Operations Research Letters

Record number :

137561

Link To Document :