Computational results with a primal-dual subproblem simplex method

@article{Hu1999ComputationalRW,
  title={Computational results with a primal-dual subproblem simplex method},
  author={Jing Hu and Ellis L. Johnson},
  journal={Oper. Res. Lett.},
  year={1999},
  volume={25},
  pages={149-157}
}
  • Jing Hu, Ellis L. Johnson
  • Published in Oper. Res. Lett. 1999
  • Mathematics, Computer Science
  • The two main ideas implemented are a primal-dual subproblem simplex method and a compact matrix storage scheme to speed up linear programming solution times. Two classes of problems are solved: crew-pairing optimization and cutting stock. The matrix storage schemes are different for these two problem classes, and the one for cutting stock is a hybrid using dynamic programming ideas. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

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

    Airline crew pairing optimization problems and capacitated vehicle routing problems

    VIEW 6 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    A robust crew pairing based on Multi-agent Markov Decision Processes

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    A dual ascent procedure for the set partitioning problem

    VIEW 2 EXCERPTS
    CITES METHODS