scientific article; zbMATH DE number 1342123
From MaRDI portal
Publication:4263705
zbMath0955.90068MaRDI QIDQ4263705
David P. Williamson, Fabián A. Chudak
Publication date: 4 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (13)
New approximation algorithms for the unsplittable capacitated facility location problem ⋮ A cutting plane algorithm for the capacitated facility location problem ⋮ A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ An approximation algorithm for the \(k\)-level capacitated facility location problem ⋮ Improved approximation algorithm for universal facility location problem with linear penalties ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ A model for minimizing active processor time ⋮ Local search algorithm for universal facility location problem with linear penalties ⋮ Facility location models for distribution system design ⋮ Improved approximation algorithms for capacitated facility location problems ⋮ An improved approximation algorithm for uncapacitated facility location problem with penalties ⋮ An effective heuristic for large-scale capacitated facility location problems
This page was built for publication:
