Pages that link to "Item:Q1121152"

The following pages link to On the exact solution of large-scale simple plant location problems (Q1121152):

Displaying 38 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
• An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
• A simple tabu search for warehouse location (Q703910) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
• Production planning and warehouse management in supply networks with inter-facility mold transfers (Q884036) (← links)
• On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• Risk management in uncapacitated facility location models with random demands (Q958433) (← links)
• Solving the plant location problem on a line by linear programming (Q1284603) (← links)
• Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
• An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
• Location analysis: a synthesis and survey (Q1776950) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
• Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem (Q2743665) (← links)
• Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)