Uniform capacitated facility location problem with random input data

DOI10.1007/s10958-012-1134-3zbMath1272.90022OpenAlexW2061027057MaRDI QIDQ1948657

A. A. Kurochkin, E. Kh. Gimadi

Publication date: 24 April 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-1134-3

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A strongly polynomial algorithm for the transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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