A branch-and-bound algorithm for 0-1 parametric mixed integer programming (Q1061012): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(85)90050-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968202374 / rank | |||
Normal rank | |||
Revision as of 02:25, 20 March 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
