The generalized fixed-charge network design problem

DOI10.1016/j.cor.2005.05.021zbMath1102.90012OpenAlexW1964780950MaRDI QIDQ856677

N. E. Zubov

Publication date: 7 December 2006

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

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

zbMATH Keywords

generalized network designbranch-cut-and-pricehierarchical networksfixed-charge network design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (7)

Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ A two-stage approach to the orienteering problem with stochastic weights ⋮ A hub location problem with fully interconnected backbone and access networks ⋮ The orienteering problem: a survey ⋮ The complexity of the timetable‐based railway network design problem ⋮ An improved hybrid ant-local search algorithm for the partition graph coloring problem ⋮ A fast solution method for the time-dependent orienteering problem

Cites Work

• An exact algorithm for IP column generation
• A survey on Benders decomposition applied to fixed-charge network design problems
• Generalized network design problems.
• Tailoring Benders decomposition for uncapacitated network design
• LP extreme points and cuts for the fixed-charge network design problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design

This page was built for publication: The generalized fixed-charge network design problem