Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

From MaRDI portal
Publication:2899101


DOI10.1287/ijoc.1100.0391zbMath1243.90087MaRDI QIDQ2899101

Juan A. Díaz, Elena Fernández, Iván A. Contreras

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1100.0391


90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B80: Discrete location and assignment


Related Items

Single Allocation Hub Location with Heterogeneous Economies of Scale, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, A branch‐and‐cut algorithm for hub network design problems with profits, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Multi-product capacitated single-allocation hub location problems: formulations and inequalities, A Stackelberg hub arc location model for a competitive environment, A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem, An \(M/M/c\) queue model for hub covering location problem, A fuzzy programming approach for dynamic virtual hub location problem, Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, An exact algorithm for the modular hub location problem with single assignments, Reliable single allocation hub location problem under hub breakdowns, HUBBI: iterative network design for incomplete hub location problems, Exact solution of hub network design problems with profits, A look at the past and present of optimization - an editorial, General network design: a unified view of combined location and network design problems, Benders decomposition algorithms for two variants of the single allocation hub location problem, Stochastic single-allocation hub location, Perspectives on modeling hub location problems, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, On carriers collaboration in hub location problems, A competitive hub location and pricing problem, Spatial analysis of single allocation hub location problems, Task assignment in tree-like hierarchical structures, A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels, Hub Location as the Minimization of a Supermodular Set Function, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem