New convergent heuristics for 0-1 mixed integer programming

@article{Wilbaut2009NewCH,
  title={New convergent heuristics for 0-1 mixed integer programming},
  author={Christophe Wilbaut and Sa{\"i}d Hanafi},
  journal={European Journal of Operational Research},
  year={2009},
  volume={195},
  pages={62-74}
}
Several hybrid methods have recently been proposed for solving 0–1 mixed integer programming problems. Some of these methods are based on the complete exploration of small neighborhoods. In this paper, we present several convergent algorithms that solve a series of small sub-problems generated by exploiting information obtained from a series of relaxations. These algorithms generate a sequence of upper bounds and a sequence of lower bounds around the optimal value. First, the principle of a… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Critical event tabu search

  • F. 425–440. Glover, G. Kochenberger
  • 1996
Highly Influential
6 Excerpts

Zero-one programming with many variables and few constraints

  • A. L. Soyster, B. Lev, W. Slivka
  • European Journal of Operational Research
  • 1978
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…