GRASP for the uncapacitated r-allocation p-hub median problem
From MaRDI portal
(Redirected from Publication:336883)
GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
Recommendations
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- The uncapacitated r‐allocation p‐hub center problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Scatter search for an uncapacitated \(p\)-hub median problem
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A quadratic integer program for the location of interacting hub facilities
- Allocation strategies in hub networks
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Greedy randomized adaptive search procedures
- Hub location for time definite transportation
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- TTT plots: a perl program to create time-to-target plots
- The \(p\)-median problem: a survey of metaheuristic approaches
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(19)- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- A non-triangular hub location problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the capacitated modular hub location problem
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- An efficient heuristic for a hub location routing problem
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- The uncapacitated r‐allocation p‐hub center problem
- Hub location problem considering spoke links with incentive-dependent capacities
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- Scatter search for an uncapacitated \(p\)-hub median problem
- HUBBI: iterative network design for incomplete hub location problems
- Planning and design of intermodal hub networks: a literature review
This page was built for publication: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336883)
