Pages that link to "Item:Q1886799"
From MaRDI portal
The following pages link to New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799):
Displaying 29 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← 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)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Selective and periodic inventory routing problem for waste vegetable oil collection (Q1758051) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- Pickup and delivery problem with incompatibility constraints (Q2333153) (← 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 Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems (Q3635128) (← links)
- Optimization of logistics services in hospitals (Q4608286) (← links)
- On extended formulations for the precedence constrained asymmetric traveling salesman problem (Q5487814) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← 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)
- Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)
