User menu

Solving steel mill slab problems with constraint-based techniques: CP, LNS, and CBLS

Bibliographic reference Schaus, Pierre ; Van Hentenryck, Pascal ; Monette, Jean-Noël ; Coffrin, Carleton ; Michel, Laurent ; et. al. Solving steel mill slab problems with constraint-based techniques: CP, LNS, and CBLS.n/a (n/a, du 12/09/2011 au 12/09/2011). In: Constraints : an international journal, Vol. 16, no. 2, p. 125-147 (2011)
Permanent URL http://hdl.handle.net/2078.1/87149
  1. Problem 38 of CSPLIB. www.csplib.org .
  2. Comet 2.1. www.dynadec.com .
  3. Gargani, A., & Refalo, P. (2007). An efficient model and strategy for the steel mill slab design problem. In C. Bessiere (Ed.), Principles and practice of constraint programming—CP 2007, 13th international conference. Lecture notes in computer science (Vol. 4741, pp. 77–89). Springer.
  4. Gervet, C. (1993). New structures of symbolic constraint objects: Sets and graphs. In In 3rd workshop on constraint logic programming, Marseille, France.
  5. Van Hentenryck, P., & Michel, L. (2008). The steel mill slab design problem revisited. In L. Perron, & M. A. Trick (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 5th international conference, CPAIOR 2008. Lecture notes in computer science (Vol. 5015, pp. 377–381). Springer.
  6. Kocjan, W., & Kreuger, P. (2004). Filtering methods for symmetric cardinality constraint. In J.-C. Régin, & M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, first international conference, CPAIOR 2004. Lecture notes in computer science (Vol. 3011, pp. 200–208). Springer.
  7. Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. Wiley Interscience Series in Discrete Mathematics and Optimization. England: Wiley.
  8. Régin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In AAAI ’94: Proceedings of the twelfth national conference on artificial intelligence (Vol. 1, pp. 209–215). American Association for Artificial Intelligence.
  9. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. J. Maher, & J.-F. Puget (Eds.), Principles and practice of constraint programming—CP98, 4th international conference. Lecture notes in computer science (Vol. 1520, pp. 417–431). Springer.
  10. Shaw, P. (2004). A constraint for bin packing. In M. Wallace (Ed.), Principles and practice of constraint programming—CP 2004, 10th international conference, CP 2004. LNCS (Vol. 3258, pp. 648–662). Springer.
  11. Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. MIT Press.
  12. Walser, J. (1997). Solving linear pseudo-boolean constraints with local search. In Proceedings of the eleventh conference on artificial intelligence (pp. 269–274).