A discretizing algorithm for location problems

DOI10.1016/0377-2217(93)E0145-NzbMATH Open0928.90050OpenAlexW2068440630MaRDI QIDQ1129969FDOQ1129969

Authors: Emilio Carrizosa, Justo Puerto 

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0145-n

Recommendations

• Methods for a class of discrete location problems
• A Decomposition Algorithm for a Discrete Location-Allocation Problem
• scientific article; zbMATH DE number 4020810
• A discrete location problem
• scientific article; zbMATH DE number 3856820
• A flexible model and efficient solution strategies for discrete location problems
• A flexible model and efficient solution strategies for discrete location problems
• The discrete p-maxian location problem
• A fast algorithm for the rectilinear distance location problem
• Approximation of solutions for location problems

zbMATH Keywords

planar continuous single-facility location

Mathematics Subject Classification ID

Nonlinear programming (90C30) Continuous location (90B85)

Cites Work

• Convex Analysis
• Solving general continuous single facility location problems by cutting planes
• The Minisum and Minimax Location Problems Revisited
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• Title not available (Why is that?)
• The Asymmetric Distance Location Problem
• Geometrical properties of the Fermat-Weber problem
• Title not available (Why is that?)
• On the uniqueness of optimal solutions in continuous location theory
• A destination optimality in asymmetric distance Fermat-Weber problems
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• A localization property for facility-location problems with arbitrary norms
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Title not available (Why is that?)
• Minimizing a unimodal function of two integer variables

Cited In (23)

• Discrete Monotonic Optimization with Application to a Discrete Location Problem
• A Two‐Stage Algorithm for Solving a Discrete Minisum Problem
• Algorithms of placing recovery points
• An application of the great deluge algorithm in planar location problems
• An approximative lexicographic MIN-MAX approach to the discrete facility location problem
• A discrete location problem
• A continuous strategy to solve a class of discrete optimization problems
• Maximin location: Discretization not always works
• A discrete algorithm for localizing the discontinuity lines of a function of two variables
• Solving general continuous single facility location problems by cutting planes
• Using interval analysis for solving planar single-facility location problems: New discarding tests
• Title not available (Why is that?)
• Continuous multifacility ordered median location problems
• Approximation of solutions for location problems
• A bibliography for some fundamental problem categories in discrete location science
• Algorithms for location problems based on angular distances
• Title not available (Why is that?)
• A flexible model and efficient solution strategies for discrete location problems
• A candidate set construction method in distribution center location based on a multi-scale gridding model
• Location problems with different norms for different points
• Decomposition of the location problem
• Title not available (Why is that?)
• On location-allocation problems for dimensional facilities

This page was built for publication: A discretizing algorithm for location problems

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