The following pages link to (Q3351135):
Displaying 50 items.
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures (Q1342071) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- A model for the capacitated \(p\)-facility location problem in global environments (Q1374025) (← links)
- Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
- The gradual covering decay location problem on a network. (Q1410306) (← links)
- Budget constrained location problem with opening and closing of facilities. (Q1413833) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Voluntary formation of communities for the provision of public projects. (Q1427494) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Exact solution methods for uncapacitated location problems with convex transportation costs (Q1809831) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- An optimization approach to plan for reusable software components (Q1847245) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- A note on the maximization version of the multi-level facility location problem (Q1866995) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- A supply chain design problem with facility location and bi-objective transportation choices (Q1939103) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach (Q2150554) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- An efficient model formulation for level of repair analysis (Q2267298) (← links)
- A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
- 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)
