Nonlinear biobjective optimization: improvements to interval branch & bound algorithms
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-019-00768-z
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Bertrand Neveu & Gilles Trombettoni & Ignacio Araya, 2016. "Node selection strategies in interval Branch and Bound algorithms," Journal of Global Optimization, Springer, vol. 64(2), pages 289-304, February.
- Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann, 2016. "On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach," Journal of Global Optimization, Springer, vol. 64(1), pages 3-16, January.
- Alexandre Goldsztejn & Ferenc Domes & Brice Chevalier, 2014. "First order rejection tests for multiple-objective optimization," Journal of Global Optimization, Springer, vol. 58(4), pages 653-672, April.
- Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
- Ignacio Araya & Bertrand Neveu, 2018. "lsmear: a variable selection strategy for interval branch and bound solvers," Journal of Global Optimization, Springer, vol. 71(3), pages 483-500, July.
- Ignacio Araya & Gilles Trombettoni & Bertrand Neveu & Gilles Chabert, 2014. "Upper bounding in inner regions for global optimization under inequality constraints," Journal of Global Optimization, Springer, vol. 60(2), pages 145-164, October.
- Martin, Benjamin & Goldsztejn, Alexandre & Granvilliers, Laurent & Jermann, Christophe, 2017. "Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 934-948.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo, 2021. "Nonlinear biobjective optimization: improving the upper envelope using feasible line segments," Journal of Global Optimization, Springer, vol. 79(2), pages 503-520, February.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo, 2021. "Nonlinear biobjective optimization: improving the upper envelope using feasible line segments," Journal of Global Optimization, Springer, vol. 79(2), pages 503-520, February.
- Charles Audet & Frédéric Messine & Jordan Ninin, 2022. "Numerical certification of Pareto optimality for biobjective nonlinear problems," Journal of Global Optimization, Springer, vol. 83(4), pages 891-908, August.
- Marendet, Antoine & Goldsztejn, Alexandre & Chabert, Gilles & Jermann, Christophe, 2020. "A standard branch-and-bound approach for nonlinear semi-infinite problems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 438-452.
- Martin, Benjamin & Goldsztejn, Alexandre & Granvilliers, Laurent & Jermann, Christophe, 2017. "Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 934-948.
- Bertrand Neveu & Martin Gorce & Pascal Monasse & Gilles Trombettoni, 2019. "A generic interval branch and bound algorithm for parameter estimation," Journal of Global Optimization, Springer, vol. 73(3), pages 515-535, March.
- Ignacio Araya & Bertrand Neveu, 2018. "lsmear: a variable selection strategy for interval branch and bound solvers," Journal of Global Optimization, Springer, vol. 71(3), pages 483-500, July.
- Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
- Lourdes Uribe & Johan M Bogoya & Andrés Vargas & Adriana Lara & Günter Rudolph & Oliver Schütze, 2020. "A Set Based Newton Method for the Averaged Hausdorff Distance for Multi-Objective Reference Set Problems," Mathematics, MDPI, vol. 8(10), pages 1-29, October.
- Thies, Christian & Kieckhäfer, Karsten & Spengler, Thomas S. & Sodhi, Manbir S., 2019. "Operations research for sustainability assessment of products: A review," European Journal of Operational Research, Elsevier, vol. 274(1), pages 1-21.
- Julius Bauß & Michael Stiglmayr, 2024. "Augmenting bi-objective branch and bound by scalarization-based information," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 85-121, August.
- Liesiö, Juuso & Andelmin, Juho & Salo, Ahti, 2020. "Efficient allocation of resources to a portfolio of decision making units," European Journal of Operational Research, Elsevier, vol. 286(2), pages 619-636.
- Atashpaz Gargari, Masoud & Sahraeian, Rashed, 2023. "An exact criterion space search method for a bi-objective nursing home location and allocation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 166-180.
- Li, Mingwu & Dankowicz, Harry, 2020. "Optimization with equality and inequality constraints using parameter continuation," Applied Mathematics and Computation, Elsevier, vol. 375(C).
- David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
- Ricardo Landa & Giomara Lárraga & Gregorio Toscano, 2019. "Use of a goal-constraint-based approach for finding the region of interest in multi-objective problems," Journal of Heuristics, Springer, vol. 25(1), pages 107-139, February.
- Tiago Montanher & Arnold Neumaier & Ferenc Domes, 2018. "A computational study of global optimization solvers on two trust region subproblems," Journal of Global Optimization, Springer, vol. 71(4), pages 915-934, August.
- Gabriele Eichfelder & Oliver Stein & Leo Warnow, 2024. "A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1736-1766, November.
- Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, December.
- Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
- Alvaro Sierra Altamiranda & Hadi Charkhgard, 2019. "A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 823-840, October.
More about this item
Keywords
Interval methods; Branch & bound; Multiobjective optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:75:y:2019:i:1:d:10.1007_s10898-019-00768-z. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.