The bound improving sequence algorithm (Q1061001): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A bound-improving approach to discrete programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3932576 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank | |||
Normal rank | |||
Latest revision as of 18:16, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bound improving sequence algorithm |
scientific article |
Statements
The bound improving sequence algorithm (English)
0 references
1985
0 references
The purpose of this paper is to report on a new tool to help solve 0-1 LP's. It consists of a sequence of bounds that, under proper conditions, bridge the duality gap, i.e., converges in a finite number of steps to the optimal value of the objective function of the problem studied. As a by-product an optimal solution for that problem is produced. Computational experience is reported.
0 references
Lagrangean relaxation
0 references
knapsack problem
0 references
sequence of bounds
0 references
duality gap
0 references
Computational experience
0 references
