Author:
Lopes Isabel Cristina,de Carvalho J.M. Valério
Reference14 articles.
1. Dynamic programming to minimize the maximum number of open stacks;Banda;Informs Journal On Computing,2007
2. Simple MIP formulations to minimize the maximum number of open stacks;Baptiste,2005
3. A method for solving the minimization of the maximum number of open stacks problem within a cutting process;Becceneri;Computers & Operations Research,2004
4. CS 762: Graph-theoretic algorithms - Lecture notes of a graduate course.;Biedl,2005
5. Cliques, holes and the vertex coloring polytope;Campêlo;Information Processing Letters,2004