Bounded Dual Simplex Algorithm: Definition and Structure

L. P. Garcés, L. A. Gallego, R. Romero. Bounded Dual Simplex Algorithm: Definition and Structure. In Ivan Zelinka, Václav Snásel, Ajith Abraham, editors, Handbook of Optimization - From Classical to Modern Approach. Volume 38 of Intelligent Systems Reference Library, pages 29-50, Springer, 2013. [doi]

@incollection{GarcesGR13,
  title = {Bounded Dual Simplex Algorithm: Definition and Structure},
  author = {L. P. Garcés and L. A. Gallego and R. Romero},
  year = {2013},
  doi = {10.1007/978-3-642-30504-7_2},
  url = {http://dx.doi.org/10.1007/978-3-642-30504-7_2},
  researchr = {https://researchr.org/publication/GarcesGR13},
  cites = {0},
  citedby = {0},
  pages = {29-50},
  booktitle = {Handbook of Optimization - From Classical to Modern Approach},
  editor = {Ivan Zelinka and Václav Snásel and Ajith Abraham},
  volume = {38},
  series = {Intelligent Systems Reference Library},
  publisher = {Springer},
  isbn = {978-3-642-30503-0},
}