Separating a Superclass of Comb Inequalities in Planar Graphs (Q2757646): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57702391, #quickstatements; #temporary_batch_1712286835472 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57702391 / rank | |||
Normal rank | |||
Latest revision as of 05:39, 5 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating a Superclass of Comb Inequalities in Planar Graphs |
scientific article |
Statements
Separating a Superclass of Comb Inequalities in Planar Graphs (English)
0 references
26 November 2001
0 references
symmetric travelling salesman problem
0 references
valid inequalities
0 references
separation algorithm
0 references
branch-and-cut
0 references
