\(k\)-balanced center location problem: a new multi-objective facility location problem
type: Item
instance of: scholarly article
title: \(k\)-balanced center location problem: a new multi-objective facility location problem
zbMATH Open document ID: 1458.90426
author: Mansoor Davoodi
published in: Computers \& Operations Research
publication date: 2019-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7024940
zbMATH Keywords: \(k\)-balanced problem
zbMATH Keywords: \(k\)-center problem
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: location problems
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: NP-completeness
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
full work available at URL: j.cor.2019.01.009
OpenAlex ID: W2914942460
cites work: Multiple criteria facility location problems: a survey
cites work: The load-distance balancing problem
cites work: How to Allocate Network Centers
cites work: Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
cites work: The Euclidean k-Supplier Problem
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Algorithms and Computation
cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem
cites work: The p-Centre Problem-Heuristic and Optimal Algorithms
cites work: Q4258215
cites work: On minimax-regret Huff location models
cites work: Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem
cites work: The discrete facility location problem with balanced allocation of customers
cites work: Variable neighborhood search for solving the balanced location problem
cites work: Nonlinear multiobjective optimization
cites work: The Capacitated K-Center Problem
cites work: An exact algorithm for the capacitated vertex \(p\)-center problem
cites work: Some APX-completeness results for cubic graphs
cites work: Q4451071
cites work: Q5452284
cites work: Multi-objective optimization using evolutionary algorithms
cites work: A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
cites work: Dynamic Voronoi diagrams
Wikidata QID: Q128520307
DOI: 10.1016/J.COR.2019.01.009
description: scientific article; zbMATH DE number 7024940