Abstract
Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasible solution of the master problem rather than only at an optimal solution. We perform the first systematic empirical comparison of logic-based Benders decomposition and branch-and-check. On four problem types the results indicate that either Benders or branch-and-check may perform best, depending on the relative difficulty of solving the master problem and the sub-problems. We identify a characteristic of the logic-based Benders decomposition runs, the proportion of run-time spent solving the master problem, that is valuable in predicting the performance of branch-and-check. We also introduce a variation of branch-and-check to address difficult sub-problems. Empirical results show that this variation leads to more robust performance than both logic-based Benders decomposition and branch-and-check on the problems investigated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hooker, J.N.: Logic-based Methods for Optimization. Wiley, Chichester (2000)
Hooker, J., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming 96, 33–60 (2003)
Thorsteinsson, E.S.: Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 16–30. Springer, Heidelberg (2001)
Hooker, J.: A hybrid method for planning and scheduling. Constraints 10, 385–401 (2005)
Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing 13(4), 258–276 (2001)
Bockmayr, A., Pisaruk, N.: Detecting infeasibility and generating cuts for mixed integer programming using constraint programming. Computers & Operations Research 33, 2777–2786 (2006)
Sadykov, R., Wolsey, L.A.: Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS Journal on Computing 18(2), 209–217 (2006)
Sadykov, R.: A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates. European Journal of Operational Research 189, 1284–1304 (2008)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)
Fazel-Zarandi, M.M., Beck, J.C.: Solving a location-allocation problem with logic-based Benders decomposition. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 344–351. Springer, Heidelberg (2009)
Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)
Cohen, P.R.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beck, J.C. (2010). Checking-Up on Branch-and-Check. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)