New formulations for the uncapacitated multiple allocation hub location problem
From MaRDI portal
Publication:818098
DOI10.1016/J.EJOR.2004.09.047zbMATH Open1116.90071OpenAlexW2014853670MaRDI QIDQ818098FDOQ818098
Authors: Alfredo Marín, Lázaro Cánovas, Mercedes Landete 
Publication date: 24 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.047
Recommendations
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- A new formulation and branch-and-cut method for single-allocation hub location problems
- A dual algorithm for the uncapacitated hub location problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
Programming involving graphs or networks (90C35) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Title not available (Why is that?)
- A dual algorithm for the uncapacitated hub location problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- On the facial structure of set packing polyhedra
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Adapting polyhedral properties from facility to hub location problems
- Hub network design with single and multiple allocation: A computational study
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Weber problems with alternative transportation systems
- Title not available (Why is that?)
- New facets for the set packing polytope
Cited In (41)
- Multiple allocation tree of hubs location problem for non-complete networks
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Allocation strategies in hub networks
- Stochastic uncapacitated hub location
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- Hub location for time definite transportation
- Multiple allocation hub-and-spoke network design under hub congestion
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- An efficient model for the multiple allocation hub maximal covering problem
- The tree of hubs location problem
- On carriers collaboration in hub location problems
- \(p\)-hub median problem for non-complete networks
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Stochastic set packing problem
- Multimodal freight transportation planning: a literature review
- The uncapacitated hub location problem in networks under decentralized management
- Single-allocation ordered median hub location problems
- General network design: a unified view of combined location and network design problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- When centers can fail: a close second opportunity
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- A non-triangular hub location problem
- A Stackelberg hub arc location model for a competitive environment
- A competitive hub location and pricing problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Network hub location problems: The state of the art
- A multiobjective hub-airport location problem for an airline network design
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The uncapacitated r‐allocation p‐hub center problem
- Hub location as the minimization of a supermodular set function
- Formulating and solving splittable capacitated multiple allocation hub location problems
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Multiple allocation hub location with service level constraints for two shipment classes
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- Matheuristics for optimizing the network in German wagonload traffic
- A fuzzy programming approach for dynamic virtual hub location problem
- A new formulation and branch-and-cut method for single-allocation hub location problems
- On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem
This page was built for publication: New formulations for the uncapacitated multiple allocation hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818098)
