Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
From MaRDI portal
Publication:632389
DOI10.1007/S10589-007-9135-8zbMATH Open1211.90208OpenAlexW2058329377MaRDI QIDQ632389FDOQ632389
Authors: José Fernández, Boglárka G.-Tóth 
Publication date: 24 March 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9135-8
Recommendations
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Branch-and-bound for bi-objective integer programming
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
outer approximationcontinuous locationinterval analysisefficient setbranch-and-bound methoddiscarding testsnonlinear biobjective optimization
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)
Cites Work
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Multiple criteria decision analysis. State of the art surveys
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive Location Models: A Framework and Bibliography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intensity-modulated radiotherapy -- a large scale multi-criteria programming problem
- Title not available (Why is that?)
- An MCDM approach to portfolio optimization.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Approximation methods in multiobjective programming
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Title not available (Why is that?)
- Solving a huff-like competitive location and design model for profit maximization in the plane
- On proving existence of feasible points in equality constrained optimization problems
- Dynamic facility location: The progressive p-median problem
- Static competitive facility location: an overview of optimisation approaches.
- New interval methods for constrained global optimization
- Economics of location: A selective survey
- Constructing robust crew schedules with bicriteria optimization
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Title not available (Why is that?)
- Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
- An interactive multicriteria decision model for multipurpose reservoir management: the Shellmouth Reservoir
- Title not available (Why is that?)
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- Empirical convergence speed of inclusion functions for facility location problems
- Multicriterion optimization using interval analysis
- A hybrid global optimization method: The multi-dimensional case
Cited In (34)
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Limit sets in global multiobjective optimization
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- A triobjective model for locating a public semiobnoxious facility in the plane
- Twenty years of continuous multiobjective optimization in the twenty-first century
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- A general branch-and-bound framework for continuous global multiobjective optimization
- Title not available (Why is that?)
- Nonconvex constrained optimization by a filtering branch and bound
- A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm
- The multicriteria big cube small cube method
- A decision space algorithm for multiobjective convex quadratic integer optimization
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- A geometric branch-and-bound algorithm for the service bundle design problem
- Reference-point-based branch and bound algorithm for multiobjective optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis
- Multi-objective branch and bound
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
Uses Software
This page was built for publication: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632389)
