Pages that link to "Item:Q5946820"
From MaRDI portal
The following pages link to The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820):
Displaying 17 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Selective and periodic inventory routing problem for waste vegetable oil collection (Q1758051) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← 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)
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
- Models for a Steiner ring network design problem with revenues (Q5943555) (← 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)
