Optimal location with equitable loads
type: Item
instance of: scholarly article
title: Optimal location with equitable loads
zbMATH Open document ID: 1163.90591
author: Oded Berman
author: Zvi Drezner
author: George O. Wesolowsky
author: Arie Tamir
published in: Annals of Operations Research
publication date: 2009-06-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5570727
zbMATH Keywords: equitable loads
zbMATH Keywords: facility location
zbMATH Keywords: network
describes a project that uses: Isolde
describes a project that uses: Tabu search
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10479-008-0339-9
OpenAlex ID: W2014530950
cites work: An efficient genetic algorithm for the \(p\)-median problem
cites work: All-norm approximation algorithms
cites work: The equitable location problem on the plane
cites work: Optimal 2-Facility Network Districting in the Presence of Queuing
cites work: The multiple server location problem
cites work: The Stochastic Queue p-Median Problem
cites work: A statistical analysis of simulated annealing applied to the \(p\)-median problem
cites work: Dynamic facility location: The progressive p-median problem
cites work: On the Limit of the Generalized Binomial Distribution
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Q4198056
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: Variable neighborhood search for the p-median
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Optimization by Simulated Annealing
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: An optimization based heuristic for political districting
cites work: Q3993417
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: An efficient tabu search procedure for the \(p\)-median problem
cites work: The minimum equitable radius location problem with continuous demand
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: Algorithms for a facility location problem with stochastic customer demand and immobile servers
DOI: 10.1007/S10479-008-0339-9
description: scientific article; zbMATH DE number 5570727