A hub location problem with fully interconnected backbone and access networks

DOI10.1016/j.cor.2005.09.018zbMath1175.90077OpenAlexW2010755434MaRDI QIDQ869014

N. E. Zubov

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.018

zbMATH Keywords

branch-and-pricehub locationhierarchical networksfully interconnected networks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ Perspectives on modeling hub location problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• The generalized fixed-charge network design problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Min-cut clustering
• An exact algorithm for IP column generation
• A survey on Benders decomposition applied to fixed-charge network design problems
• Generalized network design problems.
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact Solution of the Quadratic Knapsack Problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication: A hub location problem with fully interconnected backbone and access networks