A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem

European Journal of Operational Research

Volumn 158, Issue 3, 2004, Pages 793-795

  Kara, Imdat ^a   Laporte, Gilbert ^b   Bektas, Tolga ^a  

^a BASKENT UNIVERSITY   (Turkey)

^b HEC MONTRÉAL   (Canada)

Author keywords

Subtour elimination constraints; Vehicle routing problem

Indexed keywords

CAPACITANCE; COSTS; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; ROUTERS; SET THEORY; TRAVELING SALESMAN PROBLEM; VEHICLES;

MILLER-TUCKER-ZEMLIN SUBTOUR; RIGHT-HAND SIDE SUMMATION; SUBTOUR ELIMINATION CONSTRAINTS; VEHICLE ROUTING PROBLEM;

CONSTRAINT THEORY;

EID: 2942531043     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00377-1     Document Type: Article

References (4)

1. Toth P., Vigo D. Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics. 123:2002;487-512.
2. Kulkarni R.V., Bhave P.R. Integer programming formulations of vehicle routing problems. European Journal of Operational Research. 20:1985;58-67.
3. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulations and traveling salesman problems. Journal of the Association for Computing Machinery. 7:1960;326-329.
4. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters. 10:1991;27-36.