A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923)
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 heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints |
scientific article; zbMATH DE number 7138067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints |
scientific article; zbMATH DE number 7138067 |
Statements
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (English)
0 references
28 November 2019
0 references
dual ascent heuristic
0 references
Lagrangian relaxation
0 references
subgradient method
0 references
generalized set partitioning
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9119134
0 references
0.9086246
0 references
0.8786394
0 references
0.8784972
0 references
0.8757102
0 references
0.8725791
0 references
0.8707324
0 references
0.8672147
0 references
