Pages that link to "Item:Q1184343"
From MaRDI portal
The following pages link to The traveling salesman problem in graphs with some excluded minors (Q1184343):
Displaying 26 items.
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- On the core of routing games (Q1358628) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- Traveling salesman path problems (Q2476987) (← 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)
- Cut dominants and forbidden minors (Q2818204) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- A note on the 5-person traveling salesman game (Q3142153) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- The traveling salesman problem in graphs with 3-edge cutsets (Q3773723) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
