Preprocessing and cutting for multiple allocation hub location problems.

DOI10.1016/S0377-2217(03)00072-9MaRDI QIDQ1427587zbMATH OpenOpenAlexFDO

Authors Natashia Boland, Jamie Ebery, Mohan Krishnamoorthy, Andreas T. Ernst

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

zbMATH Keywords

Hub locationInteger programmingLocation

Mathematics Subject Classification ID

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

Recommendations

• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Formulating and solving splittable capacitated multiple allocation hub location problems
• A new formulation and branch-and-cut method for single-allocation hub location problems
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• A branch-and-cut algorithm for the hub location and routing problem
• A branch and cut algorithm for hub location problems with single assignment
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Lower bounding procedures for the single allocation hub location problem
• A decomposition approach for single allocation hub location problems with multiple capacity levels

Cites work

• A quadratic integer program for the location of interacting hub facilities
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Hub Location and the p-Hub Median Problem
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Integer programming formulations of discrete hub location problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• MINTO, a Mixed INTeger Optimizer
• Reformulation of capacitated facility location problems: How redundant information can help
• Solution algorithms for the capacitated single allocation hub location problem
• Solving large single allocation p-hub problems with two or three hubs
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(38)

• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The tree of hubs location problem
• A capacitated hub location problem under hose demand uncertainty
• 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
• Incremental optimization of hub and spoke network for the spokes' numbers and flow
• A multiobjective hub-airport location problem for an airline network design
• Efficient metaheuristics to solve the intermodal terminal location problem
• 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
• Perspectives on modeling hub location problems
• The capacitated directed cycle hub location and routing problem under congestion
• A non-triangular hub location problem
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion
• Formulating and solving splittable capacitated multiple allocation hub location problems
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Network hub location problems: The state of the art
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Hub location as the minimization of a supermodular set function
• Exact approaches for static data segment allocation problem in an information network
• On the Quadratic Programming Approach for Hub Location Problems
• An M/M/c queue model for hub covering location problem
• Allocation strategies in hub networks
• Multi-period hub network design problems with modular capacities
• Models and algorithms for intermodal transportation and equipment selection
• Hub location-allocation in intermodal logistic networks
• Multiple allocation hub location with service level constraints for two shipment classes
• An alternative approach to address uncertainty in hub location
• Hub location with congestion and time-sensitive demand
• Single-allocation ordered median hub location problems
• Flow shipment scheduling in an incomplete hub location-routing network design problem
• Double-layer Benders decomposition for large-scale robust uncapacitated hub location
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
• Multiple allocation hub-and-spoke network design under hub congestion
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation

Describes a project that uses

Uses Software

• CPLEX
• OR-Library
• MINTO

This page was built for publication: Preprocessing and cutting for multiple allocation hub location problems.

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