The multicriteria big cube small cube method

DOI10.1007/S11750-009-0105-4MaRDI QIDQ611015zbMATH OpenOpenAlexFDO

Authors Daniel Scholz

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

zbMATH Keywords

approximation algorithmsbicriteria optimizationcontinuous locationfacility location problemsglobal optimizationmulticriteria optimizationnondifferentiable optimizationsemi-obnoxious location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Continuous location (90B85) Multi-objective and goal programming (90C29)

Recommendations

• The big cube small cube solution method for multidimensional facility location problems
• scientific article; zbMATH DE number 4055390
• MCS---a new algorithm for multicriteria optimisation in constraint programming
• scientific article; zbMATH DE number 3982928
• Methods and algorithms for solving multicriteria problems -- classification approach

Cites work

• A D.C. biobjective location model
• A general global optimization approach for solving location problems in the plane
• Continuous location problems and big triangle small triangle: Constructing better bounds
• Efficient location for a semi-obnoxious facility
• Epsilon efficiency
• Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
• Euclidean push--pull partial covering problems
• Exact generation of epsilon-efficient solutions in multiple objective programming
• Finding efficient solutions for rectilinear distance location problems efficiently
• GBSSS: The generalized big square small square method for planar single- facility location
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming
• scientific article; zbMATH DE number 3742987 (Why is no real title available?)
• scientific article; zbMATH DE number 1340521 (Why is no real title available?)
• scientific article; zbMATH DE number 1559403 (Why is no real title available?)
• Multicriteria optimization
• Multicriteria planar location problems
• Multicriterion optimization using interval analysis
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• On locating a semi-desirable facility on the continuous plane
• Semi-obnoxious single facility location in Euclidean space.
• The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
• The big cube small cube solution method for multidimensional facility location problems
• The Minisum and Minimax Location Problems Revisited

Cited in

(10)

• Multi-objective branch and bound
• Nonconvex constrained optimization by a filtering branch and bound
• A general branch-and-bound framework for continuous global multiobjective optimization
• An approximation algorithm for multi-objective optimization problems using a box-coverage
• An algorithm for a multicriteria optimization problem and its application to a facility location problem
• Limit sets in global multiobjective optimization
• Some algebraic methods for solving multiobjective polynomial integer programs
• A new complexity result on multiobjective linear integer programming using short rational generating functions
• A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones
• The big cube small cube solution method for multidimensional facility location problems

This page was built for publication: The multicriteria big cube small cube method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611015)