Note from the Editor

    References

    • Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.LinkGoogle Scholar
    • Johnson DS, Trick MA, eds. (1996) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11-13, 1993, vol. 26 (American Mathematical Society).CrossrefGoogle Scholar
    • Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. INFORMS J. Comput. 8(4):344–354.LinkGoogle Scholar
    • Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (The National Academies of Sciences, Engineering, and Medicine, Washington, DC), 269–280.Google Scholar
    INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.