Branch and price for large-scale capacitated hub location problems with single assignment

DOI10.1287/IJOC.1100.0391zbMATH Open1243.90087OpenAlexW2133786786MaRDI QIDQ2899101FDOQ2899101

Authors: Juan A. Díaz, Elena Fernández, Ivan 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

Recommendations

• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A branch and cut algorithm for hub location problems with single assignment
• A branch-and-price algorithm for the capacitated facility location problem
• Solving a capacitated hub location problem

zbMATH Keywords

column generationhub locationLagrangean relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Cited In (35)

• Multi-product capacitated single-allocation hub location problems: formulations and inequalities
• Benders decomposition algorithms for two variants of the single allocation hub location problem
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
• Exact solution of hub network design problems with profits
• On carriers collaboration in hub location problems
• Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem
• An \(M/M/c\) queue model for hub covering location problem
• A decomposition approach for single allocation hub location problems with multiple capacity levels
• Spatial analysis of single allocation hub location problems
• The hub location problem with market selection
• Scalable vertiport hub location selection for air taxi operations in a metropolitan region
• General network design: a unified view of combined location and network design problems
• Tight bounds from a path based formulation for the tree of hub location problem
• An exact algorithm for the modular hub location problem with single assignments
• Reliable single allocation hub location problem under hub breakdowns
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion
• A branch‐and‐cut algorithm for hub network design problems with profits
• Lower bounding procedures for the single allocation hub location problem
• A Stackelberg hub arc location model for a competitive environment
• Stochastic single-allocation hub location
• A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• A competitive hub location and pricing problem
• A look at the past and present of optimization - an editorial
• A branch and cut algorithm for hub location problems with single assignment
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• Hub location as the minimization of a supermodular set function
• Task assignment in tree-like hierarchical structures
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
• HUBBI: iterative network design for incomplete hub location problems
• Single allocation hub location with heterogeneous economies of scale
• Perspectives on modeling hub location problems
• A fuzzy programming approach for dynamic virtual hub location problem

This page was built for publication: Branch and price for large-scale capacitated hub location problems with single assignment

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