Pages that link to "Item:Q4422623"

The following pages link to The facility location problem with general cost functions (Q4422623):

Displaying 30 items.

• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Competitive cost sharing with economies of scale (Q547291) (← links)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
• Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
• An effective linear approximation method for separable programming problems (Q1036545) (← links)
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover (Q1683144) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
• Improved local search for universal facility location (Q2354309) (← links)
• Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
• A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
• A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem (Q2441152) (← links)
• From stars to comets: improved local search for universal facility location (Q2457256) (← links)
• An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs (Q2668783) (← links)
• The load-distance balancing problem (Q2892142) (← links)
• Integrating facility location and production planning decisions (Q3057133) (← links)
• Serving Online Requests with Mobile Servers (Q3459911) (← links)
• A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
• Data-Driven Robust Resource Allocation with Monotonic Cost Functions (Q5031001) (← links)
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
• Modeling and solving an economies‐of‐scale service system design problem (Q6187314) (← links)