Exact solution of the centralized network design problem on directed graphs

DOI10.1002/NET.20061MaRDI QIDQ5463666zbMATH OpenOpenAlexFDO

Authors 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

analytic center cutting plane methodbranch-and-pricecapacitated spanning treescut and column generationLagrangian relaxation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1264406
• Algorithms – ESA 2005
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Cites work

• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Cited in

(3)

• 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
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem

This page was built for publication: Exact solution of the centralized network design problem on directed graphs

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