Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem

Published Online:https://doi.org/10.1287/ijoc.10.3.265

References

  • Brown A. R. Optimum Packing and Depletion (1971) (Macdonald, London) Google Scholar
  • Dash Associates XPRESS-MP Reference Manual (1990) Google Scholar
  • Fores S. Column Generation Approaches to Bus Driver Scheduling (1996) . Ph.D. thesis, University of Leeds Google Scholar
  • Ignizio J. P. Linear Programming in Single and Multiple Objective Systems (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
  • Puget J.-F. On the Satisfiability of Symmetrical Constrained Satisfaction Problems. Proceedings of ISMIS'93 (1993) CrossrefGoogle Scholar
  • Puget J.-F. A C++ Implementation of CLP. Proceedings of SPICIS94 (Singapore International Conference on Intelligent Systems) (1994) Google Scholar
  • Régin J.-C. A Filtering Algorithm for Constraints of Difference in CSPs. Proceedings AAAI-94 1 362 367 Google Scholar
  • Ribeiro C. C. , Minoux M. , Penna M. C. An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment. European Journal of Operations Research (1989) 41 232 239 CrossrefGoogle Scholar
  • Tsang E. Foundations of Constraint Satisfaction (1993) (Academic Press, New York) Google Scholar
  • van Hentenryck P. Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge, MA) Google Scholar
  • Vance P. , Barnhart C. , Johnson E. L. , Nemhauser G. L. Solving Binary Cutting Stock Problems by Column Generation and Branch-and-Bound. Computational Optimization and Applications 3 111 130 CrossrefGoogle Scholar
  • Williams H. P. Model Building in Mathematical Programming 3rd ed. revised (Wiley, Chichester) 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.