Pages that link to "Item:Q1278496"

The following pages link to An efficient tabu search procedure for the \(p\)-median problem (Q1278496):

Displaying 50 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Emergency facility location under random network damage: insights from the Istanbul case (Q337665) (← links)
• Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm (Q495424) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← links)
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
• The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• A genetic algorithm for the \(p\)-median problem with pos/neg weights (Q865554) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
• Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
• Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles (Q932267) (← links)
• The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
• Optimal location with equitable loads (Q1026600) (← links)
• Exemplar-based clustering via simulated annealing (Q1036142) (← links)
• Heuristic concentration: Two stage solution construction (Q1278583) (← links)
• Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
• Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
• Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works (Q1603329) (← links)
• A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
• Designing humanitarian supply chains by incorporating actual post-disaster decisions (Q1681165) (← links)
• A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights (Q1684321) (← links)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)
• A bilevel fixed charge location model for facilities under imminent attack (Q1762124) (← 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)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• A neural model for the \(p\)-median problem (Q2384886) (← links)
• BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
• A fast swap-based local search procedure for location problems (Q2480210) (← links)
• Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)
• Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases (Q2572249) (← links)
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model (Q2654319) (← links)
• Pharmacy duty scheduling problem (Q2811939) (← links)
• A Fast Tabu Search Algorithm for the Reliable P-Median Problem (Q2942500) (← links)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• Heuristics for Location Models (Q5506730) (← links)
• On solving unreliable planar location problems (Q5926602) (← links)
• Variable neighborhood search: Principles and applications (Q5937708) (← links)
• Defining tabu list size and aspiration criterion within tabu search methods (Q5955472) (← links)