Single allocation hub location with heterogeneous economies of scale
From MaRDI portal
Publication:5080641
Recommendations
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Enumeration and search procedures for a hub location problem with economies of scale
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
Cites work
- 0-1 reformulations of the multicommodity capacitated network design problem
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A conditional \(p\)-hub location problem with attraction functions
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A quadratic integer program for the location of interacting hub facilities
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Airline network design and hub location problems
- An exact algorithm for the modular hub location problem with single assignments
- Benders decomposition for large-scale uncapacitated hub location
- Branch and price for large-scale capacitated hub location problems with single assignment
- Duality for mixed-integer linear programs
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Enumeration and search procedures for a hub location problem with economies of scale
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Hub Location and the p-Hub Median Problem
- Hub arc location problems: I. Introduction and results
- Hub location problems in urban traffic networks
- Hub-and-spoke network design with congestion
- Improving the integer L-shaped method
- Integer programming duality: Price functions and sensitivity analysis
- Integer programming formulations of discrete hub location problems
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Network cost minimization using threshold-based discounting
- Network hub location problems: The state of the art
- Perspectives on modeling hub location problems
- Projecting the flow variables for hub location problems
- Release time scheduling and hub location for next-day delivery
- Reliable single allocation hub location problem under hub breakdowns
- Routing and scheduling decisions in the hierarchical hub location problem
- Solution algorithms for the capacitated single allocation hub location problem
- Solving the Hub location problem in telecommunication network design: A local search approach
- Stochastic single-allocation hub location
- Stochastic uncapacitated hub location
- The Cutting-Plane Method for Solving Convex Programs
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The latest arrival hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Cited in
(4)- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Location of slaughterhouses under economies of scale
- The Economics of Hubs: The Case of Monopoly
- A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
This page was built for publication: Single allocation hub location with heterogeneous economies of scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080641)
