Hybrid modeling

Springer Optimization and Its Applications

Volumn 45, Issue , 2011, Pages 11-62

  Hooker, John N ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976420370     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-1-4419-1644-0_2     Document Type: Chapter

References (62)

1. Achterberg T, Berthold T, Koch T, Wolter K (2008) A new approach to integrate CP and MIP. In: Perron L, Trick MA (eds) Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combinatorial optimization problems (CPAIOR 2008). Lecture notes in computer science, vol 5015. Springer, Berlin, pp 6-20
2. Ajili F, Wallace M (2004) Hybrid problem solving in ECLiPSe. In: Milano M (ed) Constraint and integer programming: toward a unified methodology. Kluwer, Dordrecht, pp 169-206
3. Althaus E, Bockmayr A, Elf M, Kasper T, Jünger M, Mehlhorn K (2002) SCIL-Symbolic constraints in integer linear programming. In: 10th European symposium on Algorithms (ESA 2002). Lecture notes in computer science, vol 2461. Springer, New York, pp 75-87
4. Apt K, Wallace M (2006) Constraint logic programming using ECLiPSe. Cambridge University Press, Cambridge
5. Aron I, Hooker JN, Yunes TH (2004) SIMPL: a system for integrating optimization techniques. In: R´egin JC, Rueher M (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2004). Lecture notes in computer science, vol 3011. Springer, Berlin, pp 21-36
6. Balas E, Fischetti M (2002) Polyhedral theory for the asymmetric traveling salesman problem. In: Gutin G, Punnen AP (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht, pp 117-168
7. Baptiste P, Pape CL, Nuijten W (2001) Constraint-based scheduling: applying constraint programming to scheduling problems. Kluwer, Dordrecht
8. Beldiceanu N (2001) Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Walsh T (ed) Principles and practice of constraint programming (CP 2001). Lecture notes in computer science, vol 2239. Springer, London, pp 211-224
9. Beldiceanu N, Carlsson M, Rampon JX (2009) Global constraint catalog. http://www.emn.fr/x-info/sdemasse/gccat/
10. Beldiceanu N, Contejean E (1994) Introducing global constraints in CHIP. Math Comput Model 12:97-123
11. Bessière C, Hebrard E, Hnich B, Kiziltan Z, Walsh T (2005) Filtering algorithms for the nvalue constraint. In: Barták R, Milano M (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2005). Lecture notes in computer science, vol 3524. Springer, Berlin, pp 79-93
12. Bockmayr A, Pisaruk N (2003) Detecting infeasibility and generating cuts for mixed integer programming using constraint progrmaming. In: Gendreau M, Pesant G, Rousseau LM (eds) Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combintaorial optimization problems (CPAIOR 2003). Montrèal, Canada
13. Bourdais S, Galinier P, Pesant G (2003) Hibiscus: a constraint programming application to staff scheduling in health care. In: Rossi F (ed) Principles and practice of constraint programming (CP 2003). Lecture notes in computer science, vol 2833. Springer, Berlin, pp 153-167
14. Caseau Y, Laburthe F (1997) Solving small TSPs with constraints. In: Naish L (ed) Proceedings, fourteenth international conference on logic programming (ICLP 1997), vol 2833. MIT, Cambridge, pp 316-330
15. Cheadle AM, Harvey W, Sadler AJ, Schimpf J, Shen K, Wallace MG (2003) ECLiPSe: a tutorial introduction. Technical Report IC-Parc-03-1, IC-Park, Imperial College London
16. Cheng BMW, Lee JHM, Wu JCK (1996) Speeding up constraint propagation by redundant modeling. In: Freuder EC (ed) Principles and practice of constraint programming (CP 1996). Lecture notes in computer science, vol 1118. Springer, Berlin, pp 91-103
17. Colombani Y, Heipcke S (2002) Mosel: an extensible environment for modeling and programming solutions. In: Jussien N, Laburthe F (eds) Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combinatorial optimization problems (CPAIOR 2002). Le Croisic, France, pp 277-290
18. Colombani Y, Heipcke S (2004) Mosel: an overview. white paper, DASH Optimization
19. Guéret C, Heipcke S, Prins C, Sevaux M(2000) Applications of optimization with Xpress-MP. White paper, Dash Optimization
20. Hellsten L, Pesant G, van Beek P (2004) A domain consistency algorithm for the stretch constraint. In: Wallace M (ed) Principles and practice of constraint programming (CP 2004). Lecture notes in computer science, vol 3258. Springer, Berlin, pp 290-304
21. Hentenryck PV, Michel L (2005) Constraint based local search. MIT, Cambridge
22. Hentenryck PV, Michel L, Perron L, Régin JC (1999) Constraint programming in OPL. In: International conference on principles and practice of declarative programming (PPDP 1999). Paris
23. van Hoeve WJ, Pesant G, Rousseau LM, Sabharwal A (2006) Revisiting the sequence constraint. In: Benhamou F (ed) Principles and practice of constraint programming (CP 2006). Lecture notes in computer science, vol 4204. Springer, Berlin, pp 620-634
24. Hooker JN (2000) Logic-based methods for optimization: combining optimization and constraint satisfaction. Wiley, New York
25. Hooker JN (2004) A hybrid method for planning and scheduling. In:WallaceM(ed) Principles and practice of constraint programming (CP 2004). Lecture notes in computer science, vol 3258. Springer, Berlin, pp 305-316
26. Hooker JN (2007) Integrated methods for optimization. Springer, Heidelberg
27. Hooker JN (2007) Planning and scheduling by logic-based Benders decomposition. Oper Res 55:588-602
28. Hooker JN (2009) A principled approach to mixed integer/linear problem formulation. In: Chinneck JW, Kristjansson B, Saltzman M (eds) Operations research and cyber-infrastructure (ICS 2009 proceedings). Springer, Berlin, pp 79-100
29. Hooker JN, Kim HJ, Ottosson G (2001) A declarative modeling framework that integrates solution methods. Ann Oper Res 104:141-161
30. Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J Comput 13:258-276
31. Jeroslow RG (1987) Representability in mixed integer programming, I: characterization results. Discrete Appl Math 17:223-243
32. Kaya LG, Hooker JN (2006) A filter for the circuit constraint. In: Benhamou F (ed) Principles and practice of constraint programming (CP 2006). Lecture notes in computer science, vol 4204. Springer, Berlin, pp 706-710
33. Kaya LG, Hooker JN (2008) The circuit polytope. Manuscript, Carnegie Mellon University
34. Keha AB, de Farias IR, Nemhauser GL (2004) Models for representing piecewise linear cost functions. Oper Res Lett 32:44-48
35. Kruk S (2009) Some facets of multiple alldifferent predicate. In: Belotti P (ed) Workshop on bound reduction techniques for constraint programming and mixed-integer nonlinear programming, at CPAIOR
36. Li HL, Lu HC, Huang CH, Hu NZ (2009) A superior representation method for piecewise linear functions. INFORMS J Comput 21:314-321
37. Magos D, Mourtos I, Appa G (2008) A polyhedral approach to the alldifferent system. Technical report, Technological Educational Institute of Athens
38. Maher MJ, Narodytska N, Quimper CG, Walsh T (2008) Flow-based propagators for the SEQUENCE and related global constraints. In: Stuckey PJ (ed) Principles and practice of constraint programming (CP 2008). Lecture notes in computer science, vol 5202. Springer, Heidelberg, pp 159-174
39. Marchand H, Martin A, Weismantel R, Wolsey L (2002) Cutting planes in integer and mixed integer programming. Discrete Appl Math 123:397-446
40. Michel L, Hentenryck PV (1999) Localizer: a modeling language for local search. INFORMS J Comput 11:1-14
41. Nethercote N, Stuckey PJ, Becket R, Brand S, Duck GJ, Tack G (2007) Minizinc: towards a standard CP modelling language. In: Bessière C (ed) Principles and practice of constraint programming (CP 2007). Lecture notes in computer science, vol 4741. Springer, Heidelberg, pp 529-543
42. Orman AJ, Williams HP (2006) A survey of different integer programming formulations of the travelling salesman problem. In: Kontoghiorghes EJ, Gatu C (eds) Optimisation, economics and financial analysis, advances in computational management science. Springer, Berlin, pp 933-106
43. Ottosson G, Thorsteinsson E, Hooker JN (2002) Mixed global constraints and inference in hybrid CLP-IP solvers. Ann Math Artif Intell 34:271-290
44. Padberg M (2000) Approximating separable nonlinear functions via mixed zero-one programs. Oper Res Lett 27:1-5
45. Pesant G (2001) A filtering algorithm for the stretch constraint. In:Walsh T (ed) Principles and practice of constraint programming (CP 2001). Lecture notes in computer science, vol 2239. Springer, Berlin, pp 183-195
46. Pesant G (2004) A regular language membership constraint for finite sequences of variables. In:WallaceM(ed) Principles and practice of constraint programming (CP 2004). Lecture notes in computer science, vol 3258. Springer, Berlin, pp 482-495
47. Quimper CG, López-Ortiz A, van Beek P, Golynski A (2004) Improved algorithms for the global cardinality constraint. In:Wallace M(ed) Principles and practice of constraint programming (CP 2004). Lecture notes in computer science, vol 3258. Springer, Berlin, pp 542-556
48. Règin JC (1996) Generalized arc consistency for global cardinality constraint. In: National conference on artificial intelligence (AAAI 1996). AAAI, Portland, pp 209-215
49. Règin JC (2004) Modeling problems in constraint programming. In: Tutorial presented at conference on Principles and Practice of constraint programming (CP 2004). Toronto
50. Rodoˇsek R, Wallace M, Hajian M (1999) A new approach to integrating mixed integer programming and constraint logic programming. Ann Oper Res 86:63-87
51. Sherali HD (2001) On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper Res Lett 28:155-160
52. Simonis H (2009) Modelling in CP: tutorial presented at CPAIOR 2009. http://4c.ucc.ie/hsimonis/slidescpaior.pdf
53. Stuckey PJ, de la Banda MG, Maher M, Marriott K, Slaney J, Somogyi Z, Wallace M, Walsh T (2005) The G12 project: mapping solver independent models to efficient solutions. In: van Beek P (ed) Principles and practice of constraint programming (CP 2005). Lecture notes in computer science, vol 3668. Springer, Berlin, pp 314-327
54. Tawarmalani M, Sahinidis NV (2002) Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications. Springer, Berlin
55. Tawarmalani M, Sahinidis NV (2004) Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math Program 99:563-591
56. Vielma JP, Nemhauser GL (2008) Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. In: Integer programming and combintorial optimization proceedings (IPCO 2008). Lecture notes in computer science, vol 5035, pp 199-213
57. Williams HP (1999) Model building in mathematical programming, 4th edn. Wiley, New York
58. Williams HP (2006) The formulation and solution of discrete optimizationmodels. In: Appa G, Pitsoulis L, Williams HP (eds) Handbook on modelling for discrete optimization. Springer, Berlin, pp 3-38
59. Williams HP (2009) Logic and integer programming. Springer, Berlin
60. Williams HP, Brailsford SC (1997) The splitting of variables and constraints in the formulation of integer programming models. Eur J Oper Res 100:623-628
61. Williams HP, Yan H (2001) Representations of the all different predicate of constraint satisfaction in integer programming. INFORMS J Comput 13:96-103
62. Yunes TH, Aron I, Hooker JN (2010) An integrated solver for optimization problems. Oper Res 58:342-356