Abstract
The paper discusses several theoretical and implementational problems of interval branch-and-bound methods. A trial to define a class of problems that can be solved with such methods is done. Features and variants of the method are presented. Useful data structures and shared-memory parallelization issues are considered.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alefeld G, Kreinovich V, Mayer G (1998) The shape of the solution set for systems of interval linear equations with dependent coefficients. Math Nachr 192: 23–36
Beelitz T, Lang B, Bischof CH (2006) Efficient task scheduling in the parallel result-verifying solution of nonlinear systems. Reliab Comput 12: 141–151
Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge
Fernandez J, Toth B (2007) Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. J Glob Optim 38: 315–331
Goualard F (2005) On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure. In: SAC’05 proceedings of the 2005 ACM symposium on applied computing, ACM, New York
Hansen E, Walster W (2004) Global optimization using interval analysis. Marcel Dekker, New York
Intel threading building blocks. http://www.threadingbuildingblocks.org
Jaulin L, Kieffer M, Didrit O, Walter E (2001) Applied interval analysis. Springer, London
Kearfott RB (1996) Rigorous global search: continuous problems. Kluwer, Dordrecht
Kearfott RB, Nakao MT, Neumaier A, Rump SM, Shary SP, van Hentenryck P (2002) Standardized notation in interval analysis. http://www.mat.univie.ac.at/~neum/software/int/notation.ps.gz
Kreinovich V, Kubica BJ (2010) From computing sets of optima, Pareto sets and sets of Nash equilibria to general decision-related set computations. J Univers Comput Sci 16: 2657–2685
Kubica BJ (2011) Interval methods for solving underdetermined nonlinear equations systems 2008. SCAN 2008 proceedings. Reliab Comput 15(3): 207–217
Kubica BJ, Woźniak A (2008) Interval methods for computing the Pareto-front of a multicriterial problem. PPAM 2007 proceedings. LNCS 4967: 1382–1391
Kubica BJ, Woźniak A (2012) A multi-threaded interval algorithm for the Pareto-front computation in a multi-core environment. Presented at PARA 2008 conference, accepted for publication in LNCS 6126
Kubica BJ (2008) Can interval computations be applied over spaces of non-numbers?. Prace Naukowe Politechniki Warszawskiej. Elektronika 165: 103–112
Kubica BJ (2009) Shared-memory parallelization of an interval equations systems solver—comparison of tools. Prace Naukowe Politechniki Warszawskiej. Elektronika 169: 121–128
Kubica BJ (2009) Intel TBB as a tool for parallelization of an interval solver of nonlinear equations systems. ICCE internal report no 09-02
Kubica BJ, Woźniak A (2010) Using the second-order information in Pareto-set computations of a multi-criteria problem. Presented at PARA 2010 conference, accepted for publication in LNCS
Kubica BJ, Woźniak A (2010) An interval method for seeking the Nash equilibria of non-cooperative games. PPAM 2009 proceedings. LNCS 6068: 446–455
Kubica BJ, Woźniak A (2010) Computing Pareto sets of multicriteria problems using interval methods. Presented at SCAN 2010 conference
Moir M, Shavit N (2007) Concurrent data structures. http://www.cs.tau.ac.il/~shanir/concurrent-data-structures.pdf
Ratschan S (2002) Continuous first-order constraint satisfaction. LNCS 2385: 181–195
Sharaya IA (2001) On maximal inner estimation of the solution sets of linear systems with interval parameters. Reliab Comput 7: 409–424
Shary SP (1996) Algebraic approach to the interval linear static identification, tolerance and control problems, or one more application of Kaucher arithmetic. Reliab Comput 2(1): 3–33
Shary SP (2001) A surprising approach in interval global optimization. Reliab Comput 7: 497–505
Shary SP (2002) A new technique in systems analysis under interval uncertainty and ambiguity. Reliab Comput 8: 321–418
Shary SP (2010) Konechnomiernyi Intiervalnyi Analiz. XYZ
Toth BG, Kreinovich V (2009) Verified methods for computing Pareto-sets: general algorithmic analysis. Int J Appl Math Comput Sci 19(3): 369–380
Villaverde K, Kreinovich V (1993) A linear-time algorithm that locates local extrema of a function of one variable from interval measurement results. Interval Comput 4: 176–194
Acknowledgments
The author would hereby like to acknowledge his discussions with Adam Woźniak. Thanks to the anonymous referees for helpful comments.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
The author has presented the results of this paper during the SCAN 2010 conference in Lyon, September 2010.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Kubica, B.J. A class of problems that can be solved using interval algorithms. Computing 94, 271–280 (2012). https://doi.org/10.1007/s00607-011-0173-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-011-0173-9