Pages that link to "Item:Q2276891"

The following pages link to Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891):

Displaying 50 items.

• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Looking for edge-equitable spanning trees (Q336753) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
• An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem (Q342549) (← links)
• Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• 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)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← 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 \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
• An optimization-based heuristic for the robotic cell problem (Q1040983) (← 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)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
• The time constrained maximal covering salesman problem (Q1631991) (← links)
• The driver and vehicle routing problem (Q1651584) (← links)
• Multiscale production routing in multicommodity supply chains with complex production facilities (Q1652168) (← links)
• On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
• An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (Q1681433) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
• The selective traveling salesman problem with emission allocation rules (Q1703461) (← links)