Pages that link to "Item:Q2494810"
From MaRDI portal
The following pages link to A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810):
Displaying 18 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)
- 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)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems (Q3635128) (← links)
- Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach (Q5191146) (← links)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← 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)
