Pages that link to "Item:Q4512576"

The following pages link to Analysis of a Local Search Heuristic for Facility Location Problems (Q4512576):

Displaying 50 items.

• Optimal Physician assignment and patient demand allocation in an outpatient care network (Q342387) (← links)
• A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
• Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
• Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Capacitated domination problem (Q534769) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
• A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems (Q1626279) (← links)
• Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← 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)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← 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)
• To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
• \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
• Facility location problems: a parameterized view (Q2275913) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
• An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← 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)
• From stars to comets: improved local search for universal facility location (Q2457256) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
• Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
• Locating repair shops in a stochastic environment (Q2581600) (← links)
• Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
• On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
• Respecting lower bounds in uniform lower and upper bounded facility location problem (Q2695314) (← links)
• Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
• Solving Facility Location Problem Based on Duality Approach (Q2942470) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)