A Sequential Approach to the 0-1 Linear Programming Problem

The paper gives a method of minimizing a linear function of zero-one variables subject to linear constraints. The method is based on transforming an n-variable m-constraint problem into a sequence of n-variable 2-constraint problems which are easier to solve. The algorithm has been tested on test pr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on applied mathematics Ročník 31; číslo 2; s. 271 - 285
Hlavní autoři: Christofides, Nicos, Trypia, Mary
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.09.1976
Témata:
Algorithms
Dynamic programming
Integer programming
Integers
Iterative solutions
Linear programming
Methods
Objective functions
Optimal solutions
Tableaux
Variable coefficients
ISSN:0036-1399, 1095-712X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper gives a method of minimizing a linear function of zero-one variables subject to linear constraints. The method is based on transforming an n-variable m-constraint problem into a sequence of n-variable 2-constraint problems which are easier to solve. The algorithm has been tested on test problems found in the literature and on a set of 80 random problems. Good results have been obtained, both in terms of the number of iterations involved in solving this sequence of subproblems, and in terms of the total computation time required to reach the final solution. The method is most effective when the coefficients of the problem are small integer numbers.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0036-1399
1095-712X
DOI:10.1137/0131022