A hub location problem with fully interconnected backbone and access networks

DOI10.1016/J.COR.2005.09.018zbMATH Open1175.90077OpenAlexW2010755434MaRDI QIDQ869014FDOQ869014

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)

Cites Work

• Title not available (Why is that?)
• An exact algorithm for IP column generation
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Branch-and-price: Column generation for solving huge integer programs
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• Generalized network design problems.
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Min-cut clustering
• Exact Solution of the Quadratic Knapsack Problem
• The generalized fixed-charge network design problem

Cited In (5)

• Solving the Hub location problem in telecommunication network design: A local search approach
• The \(q\)-ad hoc hub location problem for multi-modal networks
• The uncapacitated hub location problem in networks under decentralized management
• 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

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

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