Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (Q3786281)
From MaRDI portal
!
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 4049392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems |
scientific article; zbMATH DE number 4049392 |
Statements
Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (English)
0 references
1988
0 references
Lagrange multipliers
0 references
Lagrangian relaxations
0 references
branch-and-bound
0 references
adding a single surrogate constraint
0 references
Lagrangian subproblems
0 references
Computational results
0 references
set-covering
0 references
0.838020384311676
0 references
0.8343628644943237
0 references
0.8190569281578064
0 references
0.8114371299743652
0 references
