The following pages link to (Q3714900):
Displaying 21 items.
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- Faces of diameter two on the Hamiltonian cycle polytope (Q1919167) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← 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)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
