General variable neighborhood search for the uncapacitated single allocation p-hub center problem
From MaRDI portal
(Redirected from Publication:526421)
General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
Recommendations
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
Cites work
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(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 single allocation \(p\)-hub median problem
- Aggregation in hub location problems
- Developments of variable neighborhood search
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- On the single-assignment \(p\)-hub center problem
- Optimal design of a distributed network with a two-level hierarchical structure
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
Cited in
(22)- Location of facility based on simulated annealing and ``ZKW algorithms
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Improved hardness and approximation results for single allocation hub location
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
- A non-triangular hub location problem
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- An efficient heuristic for a hub location routing problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Improved hardness and approximation results for single allocation hub location problems
- A multiobjective hub-airport location problem for an airline network design
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- The uncapacitated r‐allocation p‐hub center problem
- A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey
- A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
This page was built for publication: General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526421)