Exact solution of the centralized network design problem on directed graphs
From MaRDI portal
Publication:5463666
DOI10.1002/net.20061zbMath1068.90105MaRDI QIDQ5463666
Jean-Louis Goffin, Fatma Gzara
Publication date: 5 August 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20061
Lagrangian relaxation; branch-and-price; analytic center cutting plane method; capacitated spanning trees; cut and column generation
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B10: Deterministic network models in operations research
Related Items
Cites Work