The big cube small cube solution method for multidimensional facility location problems

DOI10.1016/J.COR.2009.03.031zbMATH Open1171.90451OpenAlexW2038511562MaRDI QIDQ733529FDOQ733529

Authors: Anita Schöbel, Daniel Scholz 

Publication date: 16 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.031

Recommendations

• The multicriteria big cube small cube method
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• A heuristic method for large-scale multi-facility location problems
• Near-optimal solutions to large-scale facility location problems
• GBSSS: The generalized big square small square method for planar single- facility location
• On solving large instances of the capacitated facility location problem
• Approximate solutions to large scale capacitated facility location problems
• scientific article; zbMATH DE number 1560330
• An approximation algorithm for a large-scale facility location problem
• Solving Structured Multifacility Location Problems Efficiently

zbMATH Keywords

global optimizationapproximation algorithmscontinuous location\(p\)-median problemfacility location problemFermat-Weber problemnon-differentiable optimization

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Title not available (Why is that?)
• Global optimization using interval analysis - the multi-dimensional case
• The Minisum and Minimax Location Problems Revisited
• Title not available (Why is that?)
• On the Complexity of Some Common Geometric Location Problems
• GBSSS: The generalized big square small square method for planar single- facility location
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Locating lines and hyperplanes. Theory and algorithms
• Solving a huff-like competitive location and design model for profit maximization in the plane
• A new multisection technique in interval methods for global optimization
• Title not available (Why is that?)
• Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
• The Fermat-Weber location problem revisited
• A general global optimization approach for solving location problems in the plane
• Global optimization using interval analysis: The one-dimensional case
• Locating a minisum circle in the plane
• On the circle closest to a set of points
• A d.c. optimization method for single facility location problems
• Weber's problem with attraction and repulsion under polyhedral gauges
• The multiple server location problem
• Title not available (Why is that?)
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• An algorithm for the 2-median problem on two-dimensional meshes
• Integrated scheduling and location models: single machine makespan problems

Cited In (39)

• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Classical and inverse median location problems under uncertain environment
• Nearest neighbor distance in three-dimensional space
• Generating good starting solutions for the \(p\)-median problem in the plane
• A BSSS algorithm for the location problem with minimum square error
• The obnoxious competitive facility location model
• A refinement of the gravity model for competitive facility location
• A global optimization procedure for the location of a median line in the three-dimensional space
• Competitive facility location and design with reactions of competitors already in the market
• Competitive location models: a review
• The Weber obnoxious facility location model: a big arc small arc approach
• The obnoxious facilities planar \(p\)-median problem
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• One-dimensional center-based l 1-clustering method
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
• Covering part of a planar network
• The quintile share ratio in location analysis
• Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights
• Obnoxious facility location in multiple dimensional space
• Multipurpose shopping trips and location
• An algorithm for a multicriteria optimization problem and its application to a facility location problem
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
• The multicriteria big cube small cube method
• GBSSS: The generalized big square small square method for planar single- facility location
• Geometric fit of a point set by generalized circles
• Location equilibria for a continuous competitive facility location problem under delivered pricing
• New heuristic algorithms for solving the planar \(p\)-median problem
• Locating an axis-parallel rectangle on a Manhattan plane
• New local searches for solving the multi-source Weber problem
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
• A general global optimization approach for solving location problems in the plane
• Fitting concentric circles to measurements
• Sequential location of two facilities: comparing random to optimal location of the first facility
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• A branch-and-bound approach for estimating covering functionals of convex bodies
• Big segment small segment global optimization algorithm on networks

This page was built for publication: The big cube small cube solution method for multidimensional facility location problems

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