A simple strategy for solving a class of 0-1 integer programming models
DOI10.1016/0305-0548(86)90076-6zbMATH Open0619.90046OpenAlexW2076598890MaRDI QIDQ1090232FDOQ1090232
Authors: 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
Recommendations
- A heuristic 0-1 integer programming method
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Solving Large-Scale Zero-One Linear Programming Problems
- scientific article; zbMATH DE number 3894836
- A heuristic with tie breaking for certain 0–1 integer programming models
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Outline of an algorithm for integer solutions to linear programs
- Integer Rounding for Polymatroid and Branching Optimization Problems
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Title not available (Why is that?)
- A heuristic with tie breaking for certain 0–1 integer programming models
Cited In (7)
- An analysis of six greedy selection rules on a class of zero-one integer programming models
- A heuristic with tie breaking for certain 0–1 integer programming models
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- A heuristic 0-1 integer programming method
- Algorithms for solving the mixed integer two-level linear programming problem
- Investigation of solutions of randomly generated integer programming problems with 0-1 variables
- An algorithm of internal feasible directions for linear integer programming
This page was built for publication: A simple strategy for solving a class of 0-1 integer programming models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090232)
