Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using the primal-dual interior point algorithm within the branch-price-and-cut method |
scientific article; zbMATH DE number 6650446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using the primal-dual interior point algorithm within the branch-price-and-cut method |
scientific article; zbMATH DE number 6650446 |
Statements
Using the primal-dual interior point algorithm within the branch-price-and-cut method (English)
0 references
10 November 2016
0 references
branch-price-and-cut
0 references
column generation
0 references
primal-dual interior point algorithm
0 references
vehicle routing problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.92487514
0 references
0 references
0.88581216
0 references
0.8843786
0 references
