Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
From MaRDI portal
Publication:2460136
DOI10.1007/S10898-006-9132-YzbMATH Open1172.90482OpenAlexW2066702091MaRDI QIDQ2460136FDOQ2460136
Boglárka G.-Tóth, José Fernández
Publication date: 14 November 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9132-y
Recommendations
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- scientific article; zbMATH DE number 1530351
- A constraint method in nonlinear multi-objective optimization
- Finding efficient solutions by free disposal outer approximation
- An approximation algorithm for convex multi-objective programming problems
Cites Work
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Location Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GBSSS: The generalized big square small square method for planar single- facility location
- 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
- Title not available (Why is that?)
- 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
- Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
- 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
Cited In (21)
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- A class of problems that can be solved using interval algorithms
- A constraint method in nonlinear multi-objective optimization
- A triobjective model for locating a public semiobnoxious facility in the plane
- A survey of interval algorithms for solving multicriteria analysis problems
- 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
- Bi-objective design-for-control of water distribution networks with global bounds
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm
- The multicriteria big cube small cube method
- 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
- From closed-loop to sustainable supply chains: the WEEE case
Uses Software
This page was built for publication: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460136)
