Pages that link to "Item:Q2429335"

The following pages link to A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335):

Displaying 27 items.

• Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← 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 primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
• Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
• An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
• A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
• On stochastic \(k\)-facility location (Q2151361) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
• A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
• An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem (Q2441152) (← links)
• Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
• Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
• A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties (Q4981876) (← links)
• A per-scenario bound for the two-stage stochastic facility location problem with linear penalty (Q5169466) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)
• The facility location problem with maximum distance constraint (Q6121428) (← links)