Interior Point Algorithms for Integer Programming

@inproceedings{Mitchell1994InteriorPA,
  title={Interior Point Algorithms for Integer Programming},
  author={John E. Mitchell},
  year={1994}
}
Research on using interior point algorithms to solve integer programming problems is surveyed. This paper concentrates on branch and bound and cutting plane methods; a potential function method is also briefly mentioned. The principal difficulty with using an interior point algorithm in a branch and cut method to solve integer programming problems is in warm starting the algorithm efficiently. Methods for overcoming this difficulty are described and other features of the algorithms are given… CONTINUE READING

From This Paper

Topics from this paper.
7 Citations
41 References
Similar Papers

References

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

An analytic center based cutting plane algorithm for convex programming

  • D. S. Atkinson, P. M. Vaidya
  • Technical report, Department of Mathematics,
  • 1992
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…