Pages that link to "Item:Q2276891"
From MaRDI portal
The following pages link to Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891):
Displayed 28 items.
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- Heuristic and lower bound for a stochastic location-routing problem (Q864014) (← links)
- General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
- A reactive GRASP and path relinking for a combined production-distribution problem (Q883304) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
- Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
- Efficient operation of a surface mounting machine with a multihead turret (Q4230130) (← links)
- (Q4519128) (← links)
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands (Q5953168) (← links)