Pages that link to "Item:Q1837098"

The following pages link to The simple plant location problem: Survey and synthesis (Q1837098):

Displaying 50 items.

• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
• A multiperiod two-echelon multicommodity capacitated plant location problem (Q1569931) (← links)
• The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach (Q1577135) (← links)
• A new mixed integer linear programming model for the multi level uncapacitated facility location problem (Q1630134) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
• Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints (Q1652382) (← links)
• Solving the robust two-stage capacitated facility location problem with uncertain transportation costs (Q1677305) (← links)
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374) (← links)
• A facility location model for air pollution detection (Q1720454) (← links)
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
• Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities (Q1730613) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← 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)
• Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs (Q1762122) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
• Assessment of approximate algorithms: The error measure's crucial role (Q1820671) (← links)
• A multifactor model for international plant location and financing under uncertainty (Q1821012) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Genetic algorithm for obstacle location-allocation problems with customer priorities (Q1983729) (← links)
• The double-assignment plant location problem with co-location (Q2026959) (← links)
• Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms (Q2060614) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
• A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
• Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach (Q2150554) (← links)
• The optimization of a multi-period multi-product closed-loop supply chain network with cross-docking delivery strategy (Q2165788) (← links)
• A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
• A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks (Q2278781) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution (Q2290286) (← links)
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
• Dynamic supply chain design with inventory (Q2384884) (← links)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• On the complexity of some problems of searching for a family of disjoint clusters (Q2424385) (← links)
• A hierarchical location model for public facility planning (Q2456408) (← 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)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)