New LP relaxations for minimum cycle/path/tree cover problems (Q2283007): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127575553, #quickstatements; #temporary_batch_1722465628192 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.05.041 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2019.05.041 / rank | |||
Normal rank | |||
Latest revision as of 19:46, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New LP relaxations for minimum cycle/path/tree cover problems |
scientific article |
Statements
New LP relaxations for minimum cycle/path/tree cover problems (English)
0 references
27 December 2019
0 references
vehicle routing
0 references
cycle cover
0 references
path cover
0 references
approximation algorithm
0 references
integrality gap
0 references
0 references
0 references
0 references
