Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
From MaRDI portal
Publication:2276891
DOI10.1016/0167-6377(91)90083-2zbMath0723.90081OpenAlexW1970025200MaRDI QIDQ2276891
Gilbert Laporte, Martin Desrochers
Publication date: 1991
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90083-2
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (only showing first 100 items - show all)
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times ⋮ New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ The time constrained maximal covering salesman problem ⋮ Models for a Steiner multi-ring network design problem with revenues ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ The traveling salesman problem with time-dependent service times ⋮ A branch-and-cut framework for the consistent traveling salesman problem ⋮ Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs ⋮ Looking for edge-equitable spanning trees ⋮ Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations ⋮ The driver and vehicle routing problem ⋮ Multiscale production routing in multicommodity supply chains with complex production facilities ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ An exact algorithm for a vehicle-and-driver scheduling problem ⋮ Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations ⋮ Models and hybrid methods for the onshore wells maintenance problem ⋮ An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem ⋮ Routing problems: A bibliography ⋮ A waste collection problem with service type option ⋮ Heuristic and lower bound for a stochastic location-routing problem ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem ⋮ A recourse goal programming approach for airport bus routing problem ⋮ Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints ⋮ A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ Lower and upper bounds for the spanning tree with minimum branch vertices ⋮ MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles ⋮ A reactive GRASP and path relinking for a combined production-distribution problem ⋮ Optimal fleet deployment for electric vehicle sharing systems with the consideration of demand uncertainty ⋮ The close-open mixed vehicle routing problem ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout ⋮ Multi-objective optimization for a combined location-routing-inventory system considering carbon-capped differences ⋮ A matheuristic for the asymmetric capacitated vehicle routing problem ⋮ An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization ⋮ Formulations for the orienteering problem with additional constraints ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows ⋮ Connected power domination in graphs ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ New mathematical models of the generalized vehicle routing problem and extensions ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ The selective traveling salesman problem with emission allocation rules ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ Multiperiod location-routing with decoupled time scales ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ A bilevel programming approach to the travelling salesman problem. ⋮ Degree-constrained \(k\)-minimum spanning tree problem ⋮ Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem ⋮ The stop-and-drop problem in nonprofit food distribution networks ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures ⋮ The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm ⋮ A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ Solving a school bus scheduling problem with integer programming ⋮ Goal programming model applied to waste paper logistics processes ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Identification of unidentified equality constraints for integer programming problems ⋮ Solving an urban waste collection problem using ants heuristics ⋮ Mathematical formulations and improvements for the multi-depot open vehicle routing problem ⋮ On symmetric subtour problems ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ The inventory-routing problem with transshipment ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Integer linear programming formulations of multiple salesman problems and its variations ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem ⋮ Facility location with tree topology and radial distance constraints ⋮ A personalized walking bus service requiring optimized route decisions: a real case ⋮ Strong multi-commodity flow formulations for the asymmetric traveling salesman problem ⋮ The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects ⋮ Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach ⋮ A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of travelling salesman problem formulations
- Integer Programming Formulation of Traveling Salesman Problems
- Optimal Routing under Capacity and Distance Restrictions
- Faces for a linear inequality in 0–1 variables
- Partial linear characterizations of the asymmetric travelling salesman polytope
- On the facial structure of set packing polyhedra
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
