The multicriteria big cube small cube method
From MaRDI portal
Publication:611015
DOI10.1007/s11750-009-0105-4zbMath1201.90124OpenAlexW2155479334MaRDI QIDQ611015
Publication date: 13 December 2010
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-009-0105-4
global optimizationcontinuous locationnondifferentiable optimizationapproximation algorithmsmulticriteria optimizationbicriteria optimizationfacility location problemssemi-obnoxious location
Continuous location (90B85) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Related Items
An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Limit sets in global multiobjective optimization ⋮ Some algebraic methods for solving multiobjective polynomial integer programs ⋮ Unnamed Item ⋮ Multi-objective branch and bound ⋮ A new complexity result on multiobjective linear integer programming using short rational generating functions ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ A general branch-and-bound framework for continuous global multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- The big cube small cube solution method for multidimensional facility location problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Multicriterion optimization using interval analysis
- A general global optimization approach for solving location problems in the plane
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Epsilon efficiency
- Finding efficient solutions for rectilinear distance location problems efficiently
- GBSSS: The generalized big square small square method for planar single- facility location
- Multicriteria planar location problems
- Efficient location for a semi-obnoxious facility
- Semi-obnoxious single facility location in Euclidean space.
- Multicriteria optimization
- A D.C. biobjective location model
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Euclidean push--pull partial covering problems
- Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
- The Minisum and Minimax Location Problems Revisited
- On locating a semi-desirable facility on the continuous plane
