A note on the pivot and complement heuristic for 0-1 programming problems

DOI10.1016/0167-6377(89)90028-XzbMath0661.90062OpenAlexW2088896926MaRDI QIDQ1113801

Ronny Aboudi, Reidun Helming, Kurt O. Jørnsten, Asa Hallefjord

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90028-x

zbMATH Keywords

large scale problemsgood feasible integer solutionspivot and complement heuristicproject sequencing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)

Related Items

Mathematical programming based heuristics for the 0--1 MIP: a survey, The multidimensional 0-1 knapsack problem: an overview., Sequencing offshore oil and gas fields under uncertainty, A Simulated Annealing Algorithm for General Zero-One Programming Problems, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Uses Software

• XMP

Cites Work

• Pivot and Complement–A Heuristic for 0-1 Programming