Machine learning augmented approaches for hub location problems
From MaRDI portal
Recommendations
- Discrete facility location in machine learning
- Perspectives on modeling hub location problems
- Solution approaches to hub location problems
- Neural versus traditional approaches to the location of interacting hub facilities
- Neural networks for facility location problems
- Aggregation in hub location problems
- Developing equilibrium optimization methods for hub location problems
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- Algorithms for hub label optimization
- Algorithms for hub label optimization
Cites work
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A quadratic integer program for the location of interacting hub facilities
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
- An efficient procedure for designing single allocation hub and spoke systems
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Boosting ant colony optimization via solution prediction and machine learning
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Heuristics for the capacitated modular hub location problem
- HUBBI: iterative network design for incomplete hub location problems
- Integer programming formulations of discrete hub location problems
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Learning a classification of mixed-integer quadratic programming problems
- Learning the travelling salesperson problem requires rethinking generalization
- Learning when to use a decomposition
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Network hub location problems: The state of the art
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- On tabu search for the location of interacting hub facilities
- Reinforcement learning for combinatorial optimization: a survey
- Reliable single allocation hub location problem under hub breakdowns
- Solution algorithms for the capacitated single allocation hub location problem
- Spatial analysis of single allocation hub location problems
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(3)
This page was built for publication: Machine learning augmented approaches for hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109558)
