Integral Simplex Using Decomposition for the Set Partitioning Problem

@article{Zaghrouti2013IntegralSU,
  title={Integral Simplex Using Decomposition for the Set Partitioning Problem},
  author={Abdelouahab Zaghrouti and François Soumis and Issmail Elhallaoui},
  journal={Operations Research},
  year={2013},
  volume={62},
  pages={435-449}
}
Since the 1970s, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an optimal solution via a sequence of basic integer solutions. Balas and Padberg in 1972 proved the existence of such a sequence with nonincreasing costs, but degeneracy makes it difficult to find the terms of the sequence. This paper uses ideas from the improved primal simplex to deal efficiently with degeneracy and find subsequent terms in… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Similar Papers

Loading similar papers…