The following pages link to (Q3351135):
Displaying 50 items.
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model (Q301077) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
- Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment (Q342004) (← links)
- Stability and fairness in models with a multiple membership (Q361803) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- Multiperiod location-routing with decoupled time scales (Q439365) (← links)
- Graph clustering (Q458448) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Models and methods for standardization problems (Q704119) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705) (← links)
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- Strategic design of distribution systems with economies of scale in transportation (Q867550) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem (Q879323) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- Discrete facility location with nonlinear diseconomies in fixed costs (Q920006) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- Risk management in uncapacitated facility location models with random demands (Q958433) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Location problems (Q1062596) (← links)
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location (Q1076603) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
