A heuristic 0-1 integer programming method
A heuristic method is described for the following problem: given \(A\in\{- 1,0,+1\}^{m\times N}\), \(b\in Z^ m\), \(N>m\), find \(x\in\{0,1\}^ N\) such that \(Ax=b\). The method is based on a general search strategy which enables search paths to be followed or abandoned according to their heuristic likelihood of leading to a solution. Based on two rules pertaining to the strategy an algorithm requires for large search trees a linear execution time with respect to the number of expanded edges is proved. The only major criticism of this interesting paper is that it lacks clearly formulated algorithms.
- A simple strategy for solving a class of 0-1 integer programming models
- A heuristic with tie breaking for certain 0–1 integer programming models
- scientific article; zbMATH DE number 1094193
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
- A simple strategy for solving a class of 0-1 integer programming models
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
- AN INTEGRAL HEURISTIC
- Octane: A New Heuristic for Pure 0–1 Programs
- A heuristic with tie breaking for certain 0–1 integer programming models
- scientific article; zbMATH DE number 1094193 (Why is no real title available?)
This page was built for publication: A heuristic 0-1 integer programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190388)
