An advanced dual algorithm with constraint relaxation for all-integer programming (Q3671759): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800300110 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062643516 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5538306 / rank | |||
Normal rank | |||
Latest revision as of 09:27, 14 June 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
