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-8zbMath1211.90208OpenAlexW2058329377MaRDI QIDQ632389
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
interval analysiscontinuous locationouter approximationefficient setbranch-and-bound methoddiscarding testsnonlinear biobjective optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Multi-objective and goal programming (90C29)
Related Items (29)
Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem ⋮ A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ The multicriteria big cube small cube method ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation ⋮ Limit sets in global multiobjective optimization ⋮ Reference-point-based branch and bound algorithm for multiobjective optimization ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Multi-objective branch and bound ⋮ FEMOEA: a fast and efficient multi-objective evolutionary algorithm ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ A new scalarization method for finding the efficient frontier in non-convex multi-objective problems ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Empirical convergence speed of inclusion functions for facility location problems
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Multicriterion optimization using interval analysis
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On proving existence of feasible points in equality constrained optimization problems
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Intensity-modulated radiotherapy -- a large scale multi-criteria programming problem
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- An MCDM approach to portfolio optimization.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A hybrid global optimization method: The multi-dimensional case
- Economics of location: A selective survey
- Multiple criteria decision analysis. State of the art surveys
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- New interval methods for constrained global optimization
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- Approximation methods in multiobjective programming
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- An interactive multicriteria decision model for multipurpose reservoir management: the Shellmouth Reservoir
- Dynamic facility location: The progressive p-median problem
- Constructing robust crew schedules with bicriteria optimization
- Competitive Location Models: A Framework and Bibliography
- Multicriteria Optimization
- Static competitive facility location: an overview of optimisation approaches.
- 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
This page was built for publication: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
