Arc Consistency via Linear Programming

  • Grigori German
  • Olivier Briant
  • Hadrien Cambazard
  • Vincent Jost
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10416)

Abstract

A typical technique in integer programming for filtering variables is known as variable fixing. The optimal dual solution of the linear relaxation can be used to detect some of the 0/1 variables that must be fixed to either 0 or 1 in any solution improving the best known, but this filtering is incomplete. A complete technique is proposed in this paper for satisfaction problems with an ideal integer programming formulation. We show, in this case, that the 0/1 variables taking the same value in all solutions can be identified by solving a single linear program with twice the number of the original variables. In other words, a complete variable fixing of the 0/1 variables can be performed for a small overhead. As a result, this technique can be used to design generic arc consistency algorithms. We believe it is particularly useful to quickly prototype arc consistency algorithms for numerous polynomial constraints and demonstrate it for the family of Sequence global constraints.

Keywords

Constraint Programming Linear Programming filtering Arc consistency Reduced-cost fixing 

References

  1. 1.
    Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 6–20. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68155-7_4 CrossRefGoogle Scholar
  2. 2.
    Aron, I., Hooker, J.N., Yunes, T.H.: SIMPL: a system for integrating optimization techniques. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 21–36. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24664-0_2 CrossRefGoogle Scholar
  3. 3.
    Bacchus, F.: GAC via unit propagation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 133–147. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74970-7_12 CrossRefGoogle Scholar
  4. 4.
    Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-pathconstraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 59–73. Springer, Heidelberg (2001). doi:10.1007/3-540-45635-X_12 CrossRefGoogle Scholar
  5. 5.
    Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Math. Comput. Modell. 20(12), 97–123 (1994)CrossRefMATHGoogle Scholar
  6. 6.
    Bockmayr, A., Kasper, T.: Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS J. Comput. 10(3), 287–300 (1998)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P., Walsh, T.: Encodings of the sequence constraint. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 210–224. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74970-7_17 CrossRefGoogle Scholar
  8. 8.
    Chvátal, V.: Linear Programming. Series of Books in the Mathematical Sciences. W.H. Freeman, New York (1983)MATHGoogle Scholar
  9. 9.
    Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189–203. Springer, Heidelberg (1999). doi:10.1007/978-3-540-48085-3_14 Google Scholar
  10. 10.
    Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Ann. Math. Artif. Intell. 34(4), 291–311 (2002)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Hooker, J.N.: Operations research methods in constraint programming (chap. 15). In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)Google Scholar
  12. 12.
    Hooker, J.N., Yan, H.: A relaxation of the cumulative constraint. In: van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 686–691. Springer, Heidelberg (2002). doi:10.1007/3-540-46135-3_46 CrossRefGoogle Scholar
  13. 13.
    Maher, M., Narodytska, N., Quimper, C.-G., Walsh, T.: Flow-based propagators for the SEQUENCE and related global constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 159–174. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85958-1_11 CrossRefGoogle Scholar
  14. 14.
    George, L., Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)MATHGoogle Scholar
  15. 15.
    Pesant, G.: CSPLib problem 067: Quasigroup completion. http://www.csplib.org/Problems/prob067
  16. 16.
    Prud’homme, C., Fages, J.-G., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016)Google Scholar
  17. 17.
    Refalo, P.: Tight cooperation and its application in piecewise linear optimization. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 375–389. Springer, Heidelberg (1999). doi:10.1007/978-3-540-48085-3_27 Google Scholar
  18. 18.
    Refalo, P.: Linear formulation of constraint programming models and hybrid solvers. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 369–383. Springer, Heidelberg (2000). doi:10.1007/3-540-45349-0_27 CrossRefGoogle Scholar
  19. 19.
    Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: AAAI, vol. 94, pp. 362–367 (1994)Google Scholar
  20. 20.
    Régin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997). doi:10.1007/BFb0017428 CrossRefGoogle Scholar
  21. 21.
    Rodosek, R., Wallace, M.G., Hajian, M.T.: A new approach to integrating mixed integer programming and constraint logicprogramming. Ann. Oper. Res. 86, 63–87 (1999)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Siala, M., Hebrard, E., Huguet, M.-J.: A study of constraint programming heuristics for the car-sequencing problem. Eng. Appl. Artif. Intell. 38, 34–44 (2015)CrossRefGoogle Scholar
  23. 23.
    Smith, B.: CSPLib problem 001: car sequencing. http://www.csplib.org/Problems/prob001
  24. 24.
    Van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: Revisiting the sequence constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 620–634. Springer, Heidelberg (2006). doi:10.1007/11889205_44 CrossRefGoogle Scholar
  25. 25.
    Van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: New filtering algorithms for combinations of among constraints. Constraints 14(2), 273–292 (2009)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)MATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Grigori German
    • 1
  • Olivier Briant
    • 1
  • Hadrien Cambazard
    • 1
  • Vincent Jost
    • 1
  1. 1.CNRS, Grenoble INP G-SCOPUniversity Grenoble AlpesGrenobleFrance

Personalised recommendations