Pages that link to "Item:Q1278583"

The following pages link to Heuristic concentration: Two stage solution construction (Q1278583):

Displayed 42 items.

• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) ‎ (← links)
• Concurrent optimization of harvesting and road network layouts under steep terrain (Q748552) ‎ (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) ‎ (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) ‎ (← links)
• The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) ‎ (← links)
• The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) ‎ (← links)
• Incorporating waiting time in competitive location models (Q883196) ‎ (← links)
• Facility location for market capture when users rank facilities by shorter travel and waiting times (Q930936) ‎ (← links)
• The heuristic concentration-integer and its application to a class of location problems (Q960388) ‎ (← links)
• Exemplar-based clustering via simulated annealing (Q1036142) ‎ (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) ‎ (← links)
• Heuristic concentration and tabu search: A head to head comparison (Q1291635) ‎ (← links)
• The design of reverse distribution networks: Models and solution procedures (Q1400663) ‎ (← links)
• A cellular heuristic for the multisource Weber problem. (Q1422355) ‎ (← links)
• Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works (Q1603329) ‎ (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) ‎ (← links)
• A set partitioning heuristic for the home health care routing and scheduling problem (Q1711476) ‎ (← links)
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) ‎ (← links)
• Location analysis: a synthesis and survey (Q1776950) ‎ (← links)
• Reserve design for species preservation (Q1806910) ‎ (← links)
• A gamma heuristic for the \(p\)-median problem (Q1806941) ‎ (← links)
• Network distance characteristics that affect computational effort in \(p\)-median location problems (Q1841151) ‎ (← links)
• Integrating location and network restoration decisions in relief networks under uncertainty (Q2312329) ‎ (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) ‎ (← links)
• A neural model for the \(p\)-median problem (Q2384886) ‎ (← links)
• BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) ‎ (← links)
• Solving the maximal covering location problem with heuristic concentration (Q2384889) ‎ (← links)
• Solving the hub location problem with modular link capacities (Q2387305) ‎ (← links)
• Optimizing two-level reverse distribution networks with hybrid memetic algorithms (Q2448154) ‎ (← links)
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) ‎ (← links)
• A fast swap-based local search procedure for location problems (Q2480210) ‎ (← links)
• Public facility location using dispersion, population, and equity criteria (Q2514787) ‎ (← links)
• On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) ‎ (← links)
• Allocating servers to facilities, when demand is elastic to travel and waiting times (Q5479858) ‎ (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) ‎ (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) ‎ (← links)
• Variable neighborhood search: Principles and applications (Q5937708) ‎ (← links)
• Defining tabu list size and aspiration criterion within tabu search methods (Q5955472) ‎ (← links)
• Redesign of vaccine distribution networks (Q6092508) ‎ (← links)
• Fixed set search applied to the clique partitioning problem (Q6112737) ‎ (← links)
• Variable neighborhood search: the power of change and simplicity (Q6164603) ‎ (← links)
• Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows (Q6164607) ‎ (← links)