Pages that link to "Item:Q1029272"

The following pages link to An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272):

Displaying 36 items.

• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• The online prize-collecting facility location problem (Q324761) (← links)
• An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← links)
• Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
• An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748) (← links)
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
• A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
• An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties (Q2037976) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
• Improved approximation algorithm for universal facility location problem with linear penalties (Q2424885) (← links)
• A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
• Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
• Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
• (Q3054119) (← links)
• A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
• (Q3840357) (← links)
• Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
• A per-scenario bound for the two-stage stochastic facility location problem with linear penalty (Q5169466) (← links)
• (Q5399852) (← links)
• Supply Chain Management with Online Customer Selection (Q5740223) (← links)
• The facility location problem with maximum distance constraint (Q6121428) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties (Q6176404) (← links)
• Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)