Pages that link to "Item:Q3675933"
From MaRDI portal
The following pages link to The traveling salesman problem on a graph and some related integer polyhedra (Q3675933):
Displayed 46 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- Design and control of warehouse order picking: a literature review (Q881508) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- On the general routing polytope (Q2473035) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY (Q2772854) (← links)
- On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
