Limited memory rank-1 cuts for vehicle routing problems (Q1728212)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7027691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limited memory rank-1 cuts for vehicle routing problems |
scientific article; zbMATH DE number 7027691 |
Statements
Limited memory rank-1 cuts for vehicle routing problems (English)
0 references
22 February 2019
0 references
set partitioning
0 references
polyhedral combinatorics
0 references
branch-cut-and-price algorithms
0 references
0 references
0 references
0 references
0.8048012256622314
0 references
0.8006922602653503
0 references
0.8001907467842102
0 references
0.7925828695297241
0 references
