A dual ascent procedure for the set partitioning problem (Q955334)
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: A dual ascent procedure for the set partitioning problem |
scientific article; zbMATH DE number 5369036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual ascent procedure for the set partitioning problem |
scientific article; zbMATH DE number 5369036 |
Statements
A dual ascent procedure for the set partitioning problem (English)
0 references
19 November 2008
0 references
linear programming
0 references
large scale set partitioning
0 references
dual heuristics
0 references
Lagrangean relaxation
0 references
subgradient optimization
0 references
0 references
0 references
0 references
0 references
0 references
0.8238558173179626
0 references
0.8229392170906067
0 references
0.8229392170906067
0 references
0.8076752424240112
0 references
0.8064754009246826
0 references
