A note on the pivot and complement heuristic for 0-1 programming problems
From MaRDI portal
Publication:1113801
DOI10.1016/0167-6377(89)90028-XzbMath0661.90062MaRDI QIDQ1113801
Asa Hallefjord, Kurt O. Jørnsten, Ronny Aboudi, Reidun Helming
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
large scale problems; good feasible integer solutions; pivot and complement heuristic; project sequencing
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C10: Integer programming
90C11: Mixed integer programming
90C05: Linear programming
90C09: Boolean programming
Related Items
Sequencing offshore oil and gas fields under uncertainty, The multidimensional 0-1 knapsack problem: an overview.
Uses Software
