Abstract
In hybrid solvers for combinatorial optimisation, combining Constraint (Logic) Programming (CLP) and Mixed Integer Programming (MIP), it is important to have tight connections between the two domains. We extend and generalise previous work on automatic linearisations and propagation of symbolic CLP constraints that cross the boundary between CLP and MIP. We also present how reduced costs from the linear programming relaxation can be used for domain reduction on the CLP side. Computational results comparing our hybrid approach with pure CLP and MIP on a configuration problem show significant speed-ups.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, Disjunctive programming, in: Discrete Optimization II, Vol. 5, eds. P.L. Hammer, E.L. Johnson and B.H. Korte, Annals of Discrete Mathematics (North-Holland, Amsterdam, 1979) pp. 3-51.
E.M.L. Beale and J.A. Tomlin, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, in: Proceedings of the Fifth International Conference on Operation Research, ed. J. Lawrence (Tavistock Publications, 1970).
M. Carlsson et al., SICStus Prolog user's manual, SICS Research Report, Swedish Institute of Computer Science (1995). URL: http://www.sics.se/sicstus.
V. Chvátal, Linear Programming (Freeman, New York, 1983).
Dash Optimization, Inc., XPRESS-MP: User Manuals, Version 12.11 (2000).
I.R. de Farias, E.L. Johnson and G.L. Nemhauser, A branch-and-cut approach without binary variables to combinatorial optimization problems with continuous variables and combinatorial constraints, Knowledge Engineering Review (1999) submitted.
F. Focacci, A. Lodi and M. Milano, Cost-based domain filtering, in: Principles and Practice of Constraint Programming, ed. J. Jaffar, Lecture Notes in Computer Science, Vol. 1713 (Springer, Berlin, 1999).
F. Focacci, A. Lodi and M. Milano, Integration of CP and OR methods for matching problems, in: CP-AI-OR'99 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (February 1999).
F. Focacci, A. Lodi and M. Milano, Solving TSP with time windows with constraints, in: Sixteenth International Conference on Logic Programming (November 1999).
F. Focacci, A. Lodi, M. Milano and D. Vigo, Solving TSP through the integration of OR and CP techniques, in: CP98Workshop on Large Scale Combinatorial Optimisation and Constraints (October 1998).
J.N. Hooker, Logic-based methods for optimization, in: Principles and Practice of Constraint Programming, PPCP'94, Second International Workshop, ed. A. Borning, Orcas Island, Seattle, USA, Lecture Notes in Computer Science, Vol. 874 (Springer, Berlin, 1994).
J.N. Hooker and M.A. Osorio, Mixed logical/linear programming, Discrete Applied Mathematics 96-97(1-3) (1999) 395-442.
J.N. Hooker, H.-J. Kim and G. Ottosson, A declarative modeling framework that integrates solution methods, Annals of Operations Research (1998) to appear.
J.N. Hooker, G. Ottosson, E.S. Thorsteinsson and H.-J. Kim, On integrating constraint propagation and linear programming for combinatorial optimization, in: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) (AAAI Press/MIT Press, 1999) pp. 136-141.
J.N. Hooker, G. Ottosson, E.S. Thorsteinsson and H.-J. Kim, A scheme for unifying optimization and constraint satisfaction methods, Knowledge Engineering Review 15(1) (2000) 11-30.
ILOG, ILOG CPLEX Reference Manual, Version 7.0 (2001).
G. Mitra, C. Lucas, S. Moody and E. Hadjiconstantinou, Tools for reformulating logical forms into zero-one mixed integer programs, European Journal of Operational Research 72(2) (1994) 263-277.
G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
K. Orsvärn and T. Axling, The Tacton view of configuration tasks and engines, in: Workshop on Configuration, Sixteenth National Conference on Artificial Intelligence (AAAI-99) (1999). www.tacton.com, Technical Report WS-99-05.
G. Ottosson, E.S. Thorsteinsson and J.N. Hooker, Mixed global constraints and inference in hybrid CLP-IP solvers, Annals of Mathematics and Artificial Intelligence (March 2001) to appear.
P. Refalo, Linear formulation of constraint programming models, in: CP-AI-OR'00 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (March 2000).
R. Rodošek, M. Wallace and M. Hajian, A new approach to integrating mixed integer programming and constraint logic programming, Annals of Operations Research 86 (1999) 63-87.
Tacton Systems, Tacton Configurator User's Manual (1999). www.tacton.com.
H.P. Williams and H. Yan, Representations of the all_different predicate of constraint satisfaction in integer programming, INFORMS Journal on Computing (2001) to appear.
L.A. Wolsey, Integer Programming (Wiley, New York, 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thorsteinsson, E.S., Ottosson, G. Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts. Annals of Operations Research 115, 15–29 (2002). https://doi.org/10.1023/A:1021136801775
Issue Date:
DOI: https://doi.org/10.1023/A:1021136801775