A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering (Q4346340)
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 1042705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering |
scientific article; zbMATH DE number 1042705 |
Statements
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering (English)
0 references
3 August 1997
0 references
branch and bound
0 references
set covering
0 references
dynamic subgradient optimization
0 references
primal and dual heuristics
0 references
0.815954864025116
0 references
0.7891532182693481
0 references
0.7740893959999084
0 references
