An advanced dual algorithm with constraint relaxation for all-integer programming (Q3671759)
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: An advanced dual algorithm with constraint relaxation for all-integer programming |
scientific article; zbMATH DE number 3825564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An advanced dual algorithm with constraint relaxation for all-integer programming |
scientific article; zbMATH DE number 3825564 |
Statements
An advanced dual algorithm with constraint relaxation for all-integer programming (English)
0 references
1983
0 references
advanced dual algorithm
0 references
constraint relaxation
0 references
all-integer cutting plane algorithm
0 references
reduced advanced start algorithm
0 references
binding constraints
0 references
allocation problems
0 references
fixed-charge problems
0 references
branch and bound
0 references
computational experience
0 references
