Formulating and solving splittable capacitated multiple allocation hub location problems

DOI10.1016/J.COR.2004.04.008MaRDI QIDQ2387295zbMATH OpenOpenAlexFDO

Authors Alfredo Marín

Publication date 2 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.04.008

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Solving a capacitated hub location problem
• New formulations for the uncapacitated multiple allocation hub location problem
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities
• Solving the hub location problem with modular link capacities

Cites work

• A quadratic integer program for the location of interacting hub facilities
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• scientific article; zbMATH DE number 1803765 (Why is no real title available?)
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Preprocessing and cutting for multiple allocation hub location problems.
• Solution algorithms for the capacitated single allocation hub location problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(34)

• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The tree of hubs location problem
• Preprocessing and cutting for multiple allocation hub location problems.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A capacitated hub location problem under hose demand uncertainty
• Incremental optimization of hub and spoke network for the spokes' numbers and flow
• Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount
• Efficient metaheuristics to solve the intermodal terminal location problem
• General network design: a unified view of combined location and network design problems
• Proprietor and customer costs in the incomplete hub location-routing network topology
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion
• A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
• Solving a capacitated hub location problem
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Network hub location problems: The state of the art
• Capacitated single allocation hub location problem-A bi-criteria approach
• A capacitated hub location problem in freight logistics multimodal networks
• A decomposition approach for single allocation hub location problems with multiple capacity levels
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities
• An M/M/c queue model for hub covering location problem
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Multiple allocation hub location with service level constraints for two shipment classes
• A parallel adaptive memory algorithm for the capacitated modular hub location problem
• A fuzzy programming approach for dynamic virtual hub location problem
• General variable neighborhood search for the capacitated single allocation hub maximal covering problem
• Some new clique inequalities in four-index hub location models
• Single-allocation ordered median hub location problems
• New formulations for the uncapacitated multiple allocation hub location problem
• Multiple allocation hub-and-spoke network design under hub congestion
• Tight bounds from a path based formulation for the tree of hub location problem
• A conditional p-hub location problem with attraction functions
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation

This page was built for publication: Formulating and solving splittable capacitated multiple allocation hub location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387295)