On the public citation graph

Approximation algorithm for facility location with service installation costs

https://doi.org/10.1016/j.orl.2007.04.002
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1998.0993openalex-snapshot
Greedy Strikes Back: Improved Facility Location Algorithms
inferredcites →https://doi.org/10.1007/3-540-47867-1_18openalex-snapshot
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_3openalex-snapshot
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
inferredcites →https://doi.org/10.1007/s10107-006-0704-xopenalex-snapshot
Approximating the two-level facility location problem via a quasi-greedy approach
inferredcites →https://doi.org/10.1016/j.orl.2005.06.002openalex-snapshot
The k-level facility location game
inferredcites →https://doi.org/10.1016/j.orl.2006.03.017openalex-snapshot
The approximation gap for the metric facility location problem is not yet closed
inferredcites →https://doi.org/10.1016/s0020-0190(99)00144-1openalex-snapshot
A 3-approximation algorithm for the -level uncapacitated facility location problem
inferredcites →https://doi.org/10.1016/s0167-6377(02)00183-9openalex-snapshot
A note on the maximization version of the multi-level facility location problem
inferredcites →https://doi.org/10.1137/s0097539701398594openalex-snapshot
Improved Combinatorial Algorithms for Facility Location Problems
inferredcites →https://doi.org/10.1137/s0097539703405754openalex-snapshot
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
inferredcites →https://doi.org/10.1137/s0097539703435716openalex-snapshot
Approximation Algorithms for Metric Facility Location Problems
inferredcites →https://doi.org/10.1137/s0895480102417215openalex-snapshot
Improved Combinatorial Approximation Algorithms for the k -Level Facility Location Problem
inferredcites →https://doi.org/10.1145/258533.258600openalex-snapshot
Approximation algorithms for facility location problems (extended abstract)
inferredcites →https://doi.org/10.1145/375827.375845openalex-snapshot
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
inferredcites →https://doi.org/10.1145/509907.510012openalex-snapshot
A new greedy approach for facility location problems
inferredcites →https://doi.org/10.1287/moor.1040.0125openalex-snapshot
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
inferredcites →https://doi.org/10.5555/982792.982953openalex-snapshot
Facility location with Service Installation Costs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4494889openalex-extracted
Approximation Algorithms for Facility Location Problem with Service Installation Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_15openalex-snapshot
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
inferred← citeshttps://doi.org/10.1007/s00453-011-9526-1openalex-snapshot
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
inferred← citeshttps://doi.org/10.1007/s10255-008-8111-0openalex-snapshot
Soft-capacitated facility location game
inferred← citeshttps://doi.org/10.1007/s10255-014-0277-zopenalex-snapshot
An approximation algorithm for the dynamic facility location problem with submodular penalties
inferred← citeshttps://doi.org/10.1007/s10878-009-9213-1openalex-snapshot
An approximation algorithm for the k-level capacitated facility location problem
inferred← citeshttps://doi.org/10.1007/s11424-012-9067-yopenalex-snapshot
A cost-sharing method for an uncapacitated facility location game with penalties
inferred← citeshttps://doi.org/10.1007/s11425-009-0173-9openalex-snapshot
A cross-monotonic cost sharing method for the facility location game with service installation costs
inferred← citeshttps://doi.org/10.1007/s11464-011-0153-6openalex-snapshot
A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
inferred← citeshttps://doi.org/10.1016/j.apm.2013.10.012openalex-snapshot
A new mixed integer linear programming model for the multi level uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2011.10.008openalex-snapshot
A logistics network design model with vendor managed inventory
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.014openalex-snapshot
Better guarantees for k-median with service installation costs
inferred← citeshttps://doi.org/10.1057/jors.2012.107openalex-snapshot
Logistics distribution network design with two commodity categories
inferred← citeshttps://doi.org/10.1080/02331934.2011.611511openalex-snapshot
Approximation algorithms for the stochastic priority facility location problem
inferred← citeshttps://doi.org/10.1109/satml64287.2025.00044openalex-snapshot
SoK: Fair Clustering: Critique, Caveats, and Future Directions
inferred← citeshttps://doi.org/10.1142/s0129054117500320openalex-snapshot
Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties
inferred← citeshttps://doi.org/10.1145/3534678.3539451openalex-snapshot
Fair Labeled Clustering
inferred← citeshttps://doi.org/10.1155/2019/2143042openalex-snapshot
A Capacitated Location-Inventory Model with Demand Selection
inferred← citeshttps://doi.org/10.11591/telkomnika.v12i3.4536openalex-snapshot
A Heuristic Algorithm based on Combinatorial Optimization Problem in Content Distribution Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.