Heuristic concentration: Two stage solution construction
From MaRDI portal
Publication:1278583
DOI10.1016/S0377-2217(96)00100-2zbMATH Open0923.90107OpenAlexW1967623040WikidataQ128111185 ScholiaQ128111185MaRDI QIDQ1278583FDOQ1278583
Authors: C. S. Revelle, Kenneth E. Rosing 
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00100-2
Recommendations
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- A gamma heuristic for the \(p\)-median problem
- Heuristic concentration and tabu search: A head to head comparison
- An efficient tabu search procedure for the \(p\)-median problem
- A new heuristic approach for the P-median problem
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Integer Programming: Methods, Uses, Computations
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Facility siting and integer-friendly programming
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- Title not available (Why is that?)
Cited In (45)
- BEAMR: an exact and approximate model for the \(p\)-median problem
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Optimizing two-level reverse distribution networks with hybrid memetic algorithms
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Heuristic concentration and tabu search: A head to head comparison
- Defining tabu list size and aspiration criterion within tabu search methods
- Heuristic methods for the optimal statistic median problem
- Multiple allocation hub-and-spoke network design under hub congestion
- The \(p\)-median problem: a survey of metaheuristic approaches
- Incorporating waiting time in competitive location models
- Redesign of vaccine distribution networks
- A neural model for the \(p\)-median problem
- Allocating servers to facilities, when demand is elastic to travel and waiting times
- Reserve design for species preservation
- Variable neighborhood search: the power of change and simplicity
- Variable neighborhood search: Principles and applications
- A gamma heuristic for the \(p\)-median problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Exemplar-based clustering via simulated annealing
- Optimization as a multistage decision making
- Facility location for market capture when users rank facilities by shorter travel and waiting times
- The heuristic concentration-integer and its application to a class of location problems
- Spatial analysis of single allocation hub location problems
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- A set partitioning heuristic for the home health care routing and scheduling problem
- Fixed set search applied to the clique partitioning problem
- Concurrent optimization of harvesting and road network layouts under steep terrain
- Network distance characteristics that affect computational effort in \(p\)-median location problems
- A fast swap-based local search procedure for location problems
- A conditional \(p\)-hub location problem with attraction functions
- Location analysis: a synthesis and survey
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
- Hybridizing exact methods and metaheuristics: a taxonomy
- Solving the maximal covering location problem with heuristic concentration
- A cellular heuristic for the multisource Weber problem.
- The design of reverse distribution networks: Models and solution procedures
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- Solving the hub location problem with modular link capacities
- The directional \(p\)-median problem: definition, complexity, and algorithms
- Integrating location and network restoration decisions in relief networks under uncertainty
- Public facility location using dispersion, population, and equity criteria
- On the unified dispersion problem: efficient formulations and exact algorithms
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
This page was built for publication: Heuristic concentration: Two stage solution construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278583)
