Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time (Q4645942): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Small Travelling Salesman Polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4845366 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random sampling in cut, flow, and network design problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On some connectivity properties of Eulerian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expressing combinatorial optimization problems by linear programs / rank | |||
Normal rank | |||
Latest revision as of 20:57, 17 July 2024
scientific article; zbMATH DE number 7000368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time |
scientific article; zbMATH DE number 7000368 |
Statements
Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time (English)
0 references
11 January 2019
0 references
0 references
0 references
