An advanced dual algorithm with constraint relaxation for all-integer programming (Q3671759): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:20, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An advanced dual algorithm with constraint relaxation for all-integer programming |
scientific article |
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
