PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION

DOI10.3846/13926292.2015.1088903zbMath1488.90115OpenAlexW2253075372MaRDI QIDQ5011261

Julius Žilinskas, Pilar Martínez Ortigosa, Algirdas Lančinskas

Publication date: 27 August 2021

Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3846/13926292.2015.1088903

zbMATH Keywords

optimizationparallel computingfacility location

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Parallel algorithms in computer science (68W10) Discrete location and assignment (90B80)

Related Items (1)

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
• A parallel interior point method and its application to facility location problems
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
• A bibliography for some fundamental problem categories in discrete location science
• A PARALLEL SOLVER FOR THE DESIGN OF OIL FILTERS
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION