Uniform capacitated facility location problem with random input data

DOI10.1007/S10958-012-1134-3zbMATH Open1272.90022OpenAlexW2061027057MaRDI QIDQ1948657FDOQ1948657

Authors: Eh. Kh. Gimadi, A. A. Kurochkin 

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

Recommendations

• A facility location problem with equal amounts of production at random input data
• The capacitated facility location problem with random input data
• A 3-approximation algorithm for the facility location problem with uniform capacities
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
• An 0. 828-approximation algorithm for the uncapacitated facility location problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A strongly polynomial algorithm for the transportation problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• A facility location problem with equal amounts of production at random input data
• Title not available (Why is that?)
• The capacitated facility location problem with random input data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948657)