Multiple allocation tree of hubs location problem for non-complete networks
From MaRDI portal
Publication:2669573
Recommendations
Cites work
- \(p\)-hub median problem for non-complete networks
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- 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 multicut algorithm for two-stage stochastic linear programs
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An improved Benders decomposition algorithm for the tree of hubs location problem
- 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 for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Exact and heuristic approaches for the cycle hub location problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub location problems in urban traffic networks
- Improving Benders decomposition using a genetic algorithm
- Network hub location problems: The state of the art
- New formulations for the uncapacitated multiple allocation hub location problem
- Partitioning procedures for solving mixed-variables programming problems
- Solving the hub location problem in a star–star network
- Solving the Hub location problem in telecommunication network design: A local search approach
- Star p-hub median problem with modular arc capacities
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- The Benders decomposition algorithm: a literature review
- The complexity of the network design problem
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- The tree of hubs location problem
- Tight bounds from a path based formulation for the tree of hub location problem
- Topological design of a two-level network with ring-star configuration
- Upgrading nodes in tree-shaped hub location
Cited in
(10)- The tree of hubs location problem
- \(p\)-hub median problem for non-complete networks
- A biased random-key genetic algorithm for the tree of hubs location problem
- Simple multistage location problem on a treelike network
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Proprietor and customer costs in the incomplete hub location-routing network topology
- A non-triangular hub location problem
- Heuristic strategies for a multi-allocation problem in LTL logistics
- A random-key GRASP for combinatorial optimization
- The tree-of-hubs location problem with interhub stopovers
This page was built for publication: Multiple allocation tree of hubs location problem for non-complete networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669573)
