Heuristics for the fixed cost median problem
From MaRDI portal
Publication:3929508
DOI10.1007/BF01581035zbMath0473.90029OpenAlexW2046554800WikidataQ57568236 ScholiaQ57568236MaRDI QIDQ3929508
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581035
continuous locationset coveringconvex costsworst case analysisplant locationpolynomial heuristicscontinuous fixed cost median problemdiscrete fixed cost median problemnetwork fixed cost median problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)
Related Items
An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties, Beyond Moulin mechanisms, Integrality gaps for strengthened linear relaxations of capacitated facility location, A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION, Rounding algorithms for covering problems, Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta, Minimizing energies with hierarchical costs, Fast approximate energy minimization with label costs, Study and development of the DTD generation system for XML documents, Unnamed Item, Dynamic Sum-Radii Clustering, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics, Micro-review synthesis for multi-entity summarization, Lagrangian relaxations for multiple network alignment, Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties, Easy capacitated facility location problems, with connections to lot-sizing, The approximation gap for the metric facility location problem is not yet closed, A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem, On the \(p\)-median polytope of \(Y\)-free graphs, Covering problems in edge- and node-weighted graphs, Multi-level facility location problems, Approximation algorithms for the max-buying problem with limited supply, Erratum to: ``Internet shopping with price-sensitive discounts, Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Unnamed Item, Approximating the two-level facility location problem via a quasi-greedy approach, Approximating the \(\tau\)-relaxed soft capacitated facility location problem, Approximation algorithms for the transportation problem with market choice and related models, An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme, Capacitated location-allocation problems on a line, An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties, A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems, Heuristic methods and applications: A categorized survey, Efficient Black-Box Reductions for Separable Cost Sharing, The simple plant location problem: Survey and synthesis, Bounding quality of pure Nash equilibria in dual-role facility location games, Generalized submodular cover problems and applications, An improved approximation algorithm for vertex cover with hard capacities, Unnamed Item
Cites Work
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- A Greedy Heuristic for the Set-Covering Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Compactness and ordinals
