Pages that link to "Item:Q1806889"

The following pages link to The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889):

Displaying 38 items.

• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← 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)
• Competitiveness based on logistic management: a real case study (Q889527) (← links)
• A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
• Compact vs. exponential-size LP relaxations (Q1612003) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem (Q1728250) (← links)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← 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)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
• Hop-indexed circuit-based formulations for the traveling salesman problem (Q2861531) (← links)
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems (Q3635128) (← links)
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem (Q3980516) (← links)
• On extended formulations for the precedence constrained asymmetric traveling salesman problem (Q5487814) (← links)
• Models for a Steiner ring network design problem with revenues (Q5943555) (← links)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)