Pages that link to "Item:Q5487814"
From MaRDI portal
The following pages link to On extended formulations for the precedence constrained asymmetric traveling salesman problem (Q5487814):
Displaying 24 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← 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)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
