Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion
From MaRDI portal
Publication:2052283
Recommendations
- GRASP for the uncapacitated r-allocation p-hub median problem
- The uncapacitated r‐allocation p‐hub center problem
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- 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
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
- 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
- A hub covering model for cargo delivery systems
- A hub covering network design problem for cargo applications in Turkey
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A quadratic integer program for the location of interacting hub facilities
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A single allocation hub location and pricing problem
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- Adjustable robust balanced hub location problem with uncertain transportation cost
- Allocation strategies in hub networks
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- Applications of second-order cone programming
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Design of intermodal logistics networks with hub delays
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Handbook of metaheuristics
- Hub Location and the p-Hub Median Problem
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Hub-and-spoke network design with congestion
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Modeling congestion and service time in hub location problems
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Network hub location problems: The state of the art
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Optimization by simulated annealing
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Perspectives on modeling hub location problems
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Second-order cone programming
- Solution algorithms for the capacitated single allocation hub location problem
- Solving the uncapacitated hub location problem using genetic algorithms
- Stochastic air freight hub location and flight routes planning
- The uncapacitated r‐allocation p‐hub center problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(9)- An \(M/M/c\) queue model for hub covering location problem
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
- Competitive multiple allocation hub location problem considering primary and backup routes
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Modeling congestion and service time in hub location problems
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
This page was built for publication: Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052283)
