A simple strategy for solving a class of 0-1 integer programming models

DOI10.1016/0305-0548(86)90076-6zbMath0619.90046OpenAlexW2076598890MaRDI QIDQ1090232

G. Edward Fox, Gary D. Scudder

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90076-6

zbMATH Keywords

heuristiccutting planelinear programming relaxationgeneralized set packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Boolean programming (90C09)

Related Items (2)

Algorithms for solving the mixed integer two-level linear programming problem ⋮ An algorithm of internal feasible directions for linear integer programming

Cites Work

• Outline of an algorithm for integer solutions to linear programs
• Integer Rounding for Polymatroid and Branching Optimization Problems
• A heuristic with tie breaking for certain 0–1 integer programming models
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple strategy for solving a class of 0-1 integer programming models