A branch-and-bound algorithm for 0-1 parametric mixed integer programming (Q1061012): Difference between revisions
From MaRDI portal
Latest revision as of 17:16, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch-and-bound algorithm for 0-1 parametric mixed integer programming |
scientific article |
Statements
A branch-and-bound algorithm for 0-1 parametric mixed integer programming (English)
0 references
1985
0 references
A branch-and-bound algorithm to solve 0-1 parametric mixed integer linear programming problems has been developed. The present algorithm is an extension of the branch-and-bound algorithm for parametric analysis on pure integer programming. The characteristic of the present method is that optimal solutions for all values of the parameter can be obtained.
0 references
branch-and-bound algorithm
0 references
parametric mixed integer linear programming
0 references