Separating clique tree and bipartition inequalities in polynomial time (Q5101404): 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: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4845366 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Binested Inequalities for the Symmetric Traveling Salesman Polytope / rank | |||
Normal rank |
Latest revision as of 00:06, 30 July 2024
scientific article; zbMATH DE number 7577880
Language | Label | Description | Also known as |
---|---|---|---|
English | Separating clique tree and bipartition inequalities in polynomial time |
scientific article; zbMATH DE number 7577880 |
Statements
Separating clique tree and bipartition inequalities in polynomial time (English)
0 references
30 August 2022
0 references