Pages that link to "Item:Q3971736"
From MaRDI portal
The following pages link to Facets of the Asymmetric Traveling Salesman Polytope (Q3971736):
Displayed 26 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- Induced binary probabilities and the linear ordering polytope: A status report (Q1184362) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
- (Q4509381) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)