The uncapacitated r‐allocation p‐hub center problem
From MaRDI portal
Publication:6070875
DOI10.1111/itor.12801OpenAlexW3019441366MaRDI QIDQ6070875
Stefan Mišković, Raca Todosijević, Dragan Urošević, Jack Brimberg
Publication date: 24 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12801
integer programmingmultiple allocationsingle allocationgeneral variable neighborhood search\(p\)-hub center problem
Related Items (3)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ An efficient heuristic for a hub location routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- Allocation strategies in hub networks
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- Aggregation in hub location problems
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Variable neighborhood search
- On the single-assignment \(p\)-hub center problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Variable neighborhood search: basics and variants
- First vs. best improvement: an empirical study
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
This page was built for publication: The uncapacitated r‐allocation p‐hub center problem
