Pages that link to "Item:Q5704227"

The following pages link to A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem (Q5704227):

Displaying 50 items.

• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← 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)
• Capacitated domination problem (Q534769) (← links)
• An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
• An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
• A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• Site selection in the US retailing industry (Q858847) (← links)
• A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
• Approximation algorithm for facility location with service installation costs (Q924885) (← links)
• A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
• Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
• Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
• Donation center location problem (Q1949758) (← links)
• An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
• RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
• Approximating soft-capacitated facility location problem with uncertainty (Q2251144) (← links)
• Soft-capacitated facility location game (Q2267278) (← links)
• Improved local search for universal facility location (Q2354309) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← 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)
• A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem (Q2441152) (← links)
• Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Respecting lower bounds in uniform lower and upper bounded facility location problem (Q2695314) (← links)
• An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem (Q2942463) (← links)
• Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)