Variable Neighborhood Search for Solving the Balanced Location Problem

DOI10.1016/j.endm.2012.10.004zbMath1268.90149OpenAlexW1969654985WikidataQ57705369 ScholiaQ57705369MaRDI QIDQ2840746

Markus Leitner, Jozef Kratica, Ivana Ljubić

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.004

zbMATH Keywords

variable neighborhood searchdiscrete locationbalanced allocation of clients

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

\(k\)-balanced center location problem: a new multi-objective facility location problem

Cites Work

• The discrete facility location problem with balanced allocation of customers
• Equitable service by a facility: minimizing the Gini coefficient
• Genetic algorithms for solving the discrete ordered median problem
• Variable neighbourhood search: methods and applications
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)

This page was built for publication: Variable Neighborhood Search for Solving the Balanced Location Problem