A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
From MaRDI portal
Publication:596294
DOI10.1016/S0377-2217(03)00377-1zbMATH Open1061.90020OpenAlexW1973326170MaRDI QIDQ596294FDOQ596294
Authors: Imdat Kara, G. Laporte, Tolga Bektaş 
Publication date: 10 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00377-1
Recommendations
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- A new subtour elimination constraint for the vehicle routing problem
- scientific article; zbMATH DE number 7347493
- scientific article
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- On the vehicle routing problem with lower bound capacities
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Column elimination for capacitated vehicle routing problems
Cites Work
Cited In (35)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- A comparative study of alternative formulations for the periodic vehicle routing problem
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Mathematical formulations and improvements for the multi-depot open vehicle routing problem
- The min-cost parallel drone scheduling vehicle routing problem
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities
- The vehicle routing problem with profits and consistency constraints
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- The multiple shortest path problem with path deconfliction
- The cumulative school bus routing problem: Polynomial‐size formulations
- The multiple vehicle pickup and delivery problem with LIFO constraints
- The inventory-routing problem with transshipment
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- The close-open mixed vehicle routing problem
- A waste collection problem with service type option
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- The stop-and-drop problem in nonprofit food distribution networks
- Selective and periodic inventory routing problem for waste vegetable oil collection
- Solving a school bus scheduling problem with integer programming
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- An improved formulation for the multi-depot open vehicle routing problem
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
- A covering traveling salesman problem with profit in the last mile delivery
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- The time-dependent shortest path and vehicle routing problem
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs
- A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
Uses Software
This page was built for publication: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596294)
