Preprocessing and cutting for multiple allocation hub location problems.
From MaRDI portal
Publication:1427587
DOI10.1016/S0377-2217(03)00072-9zbMath1049.90034OpenAlexW2045691061MaRDI QIDQ1427587
Natashia Boland, Jamie Ebery, Andreas T. Ernst, Mohan Krishnamoorthy
Publication date: 14 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00072-9
Related Items
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing, Multiple allocation hub-and-spoke network design under hub congestion, Robust optimization approach to capacitated single and multiple allocation hub location problems, Formulating and solving splittable capacitated multiple allocation hub location problems, A capacitated hub location problem under hose demand uncertainty, Exact approaches for static data segment allocation problem in an information network, Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty, Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique, Incremental optimization of hub and spoke network for the spokes' numbers and flow, Hub Location as the Minimization of a Supermodular Set Function, 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, A non-triangular hub location problem, An \(M/M/c\) queue model for hub covering location problem, Multiple allocation hub location with service level constraints for two shipment classes, Allocation strategies in hub networks, An alternative approach to address uncertainty in hub location, A specialized branch \& bound \& cut for single-allocation ordered median hub location problems, A multiobjective hub-airport location problem for an airline network design, Benders decomposition for the uncapacitated multiple allocation hub location problem, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, Multi-period hub network design problems with modular capacities, Hub location-allocation in intermodal logistic networks, Efficient metaheuristics to solve the intermodal terminal location problem, Network hub location problems: The state of the art, Models and Algorithms for Intermodal Transportation and Equipment Selection, Single-allocation ordered median hub location problems, The capacitated single-allocation hub location problem revisited: a note on a classical formulation, Perspectives on modeling hub location problems, The capacitated directed cycle hub location and routing problem under congestion, On the Quadratic Programming Approach for Hub Location Problems, Lagrangean relaxation for the capacitated hub location problem with single assignment, The tree of hubs location problem, Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
Uses Software
Cites Work
- A quadratic integer program for the location of interacting hub facilities
- Reformulation of capacitated facility location problems: How redundant information can help
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- MINTO, a Mixed INTeger Optimizer
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Solving Large-Scale Zero-One Linear Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- HubLocator: An exact solution method for the multiple allocation hub location problem
