The following pages link to (Q3351135):
Displaying 42 items.
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach (Q2300640) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- A location-routing problem for the conversion to the ``click-and-mortar'' retailing: the static case (Q2462150) (← links)
- Modeling health care facility location for moving population groups (Q2468475) (← links)
- Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
- Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
- Cross-facility management of production and transportation planning problem (Q2499157) (← links)
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
- Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- A study on the budget constrained facility location model considering inventory management cost (Q3166271) (← links)
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets (Q3321801) (← links)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
- (Q3598875) (← links)
- (Q4229633) (← links)
- (Q4233440) (← links)
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN (Q4650616) (← links)
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
- (Q5009578) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- Simple dynamic location problem with uncertainty: a primal-dual heuristic approach (Q5746680) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5906501) (← links)
- On solving complex multi-period location models using simulated annealing. (Q5932034) (← links)
- Siting noxious facilities under uncertainty (Q5943938) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
- The generalized maximal covering location problem (Q5959382) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5967058) (← links)
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks (Q6065907) (← links)
