Modified branch-and-bound method for solving a series of problems (Q1113803)
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: Modified branch-and-bound method for solving a series of problems |
scientific article; zbMATH DE number 4081298
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modified branch-and-bound method for solving a series of problems |
scientific article; zbMATH DE number 4081298 |
Statements
Modified branch-and-bound method for solving a series of problems (English)
0 references
1988
0 references
The paper presents a modification of the branch-and-bound method for solving a series of discrete optimization problems which are solved in this case faster than when treated individually. The potentialities of this approach are illustrated by solving series of problems. The method is tested against series of integer programming problems and results are reported.
0 references
branch-and-bound
0 references
series of discrete optimization
0 references
0.8849127
0 references
0.8743495
0 references
0.8631615
0 references
0.8629318
0 references
0 references
