The capacitated facility location problem with random input data

DOI10.1134/S1990478914040115zbMath1324.90107OpenAlexW1984257316MaRDI QIDQ5264758

A. A. Kurochkin

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478914040115

zbMATH Keywords

probabilitypolynomial algorithmfacility location problemasymptotic exactness

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facility location models for distribution planning
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A probabilistic analysis of the capacitated facility location problem
• Improved approximation algorithms for capacitated facility location problems
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Analysis of a Local Search Heuristic for Facility Location Problems

This page was built for publication: The capacitated facility location problem with random input data