Exact solution of the centralized network design problem on directed graphs

DOI10.1002/net.20061zbMath1068.90105OpenAlexW4255492803MaRDI QIDQ5463666

Fatma Gzara, Jean-Louis Goffin

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

zbMATH Keywords

Lagrangian relaxationbranch-and-priceanalytic center cutting plane methodcapacitated spanning treescut and column generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items

Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

Cites Work

• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem