A software for the integer linear programming (Q2746895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1656827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A software for the integer linear programming |
scientific article; zbMATH DE number 1656827 |
Statements
11 October 2001
0 references
mixed integer programming
0 references
linear programming
0 references
general solver
0 references
software
0 references
penalty function method
0 references
numerical examples
0 references
packaged method
0 references
branch and bound method
0 references
Forrest-Tomlin method
0 references
0.90721047
0 references
0 references
0.88116544
0 references
0.8717723
0 references
0.87163687
0 references
A software for the integer linear programming (English)
0 references
A general purpose solver for the linear integer and mixed integer programming problems is developed. It is based on the branch and bound method with the linear programming relaxation. The inverse matrices are computed by a modified Forrest-Tomlin method [cf. \textit{J. J. H. Forrest} and \textit{J. A. Tomlin}, Math. Program. 2, No. 3, 263-278 (1972; Zbl 0288.90048)]. Branching variables are selected with the help of a penalty function [cf. \textit{M.~M.~Kovalev}, Discrete optimization (integer programming), Izdatel'stvo Belorusskogo Universiteta, Minsk (1977; Zbl 0463.90063)]. A local search procedure is applied to find feasible solutions. Computational results for real world problems in airline, scheduling, and other applications are discussed.
0 references
