Pages that link to "Item:Q2765605"

The following pages link to Solving the simple plant location problem by genetic algorithm (Q2765605):

Displaying 30 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
• An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← 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)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
• A fuzzy queuing location model with a genetic algorithm for congested systems (Q945385) (← links)
• A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
• Soft arc consistency revisited (Q969527) (← links)
• New valid inequalities and facets for the simple plant location problem (Q1749485) (← 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)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
• Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← 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)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678) (← links)
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
• The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
• GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS (Q3631235) (← links)
• RAMP experiments in solving the uncapacitated facility location problem (Q6496425) (← links)