Pages that link to "Item:Q596294"

The following pages link to A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294):

Displaying 32 items.

• The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• Solving a school bus scheduling problem with integer programming (Q954937) (← links)
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
• A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows (Q1686418) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• Selective and periodic inventory routing problem for waste vegetable oil collection (Q1758051) (← links)
• The inventory-routing problem with transshipment (Q1761192) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
• Mathematical formulations and improvements for the multi-depot open vehicle routing problem (Q1996758) (← links)
• The multiple shortest path problem with path deconfliction (Q2030451) (← links)
• A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• A waste collection problem with service type option (Q2160512) (← links)
• Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities (Q2171605) (← links)
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
• New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem (Q2454370) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
• The min-cost parallel drone scheduling vehicle routing problem (Q2670526) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)
• An improved formulation for the multi-depot open vehicle routing problem (Q5964850) (← links)
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
• The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)