Models and heuristics for a minimum arborescence problem

DOI10.1002/net.20194zbMath1175.90059OpenAlexW4230930919MaRDI QIDQ5433191

Christophe Duhamel, Luís Gouveia, Maurício C. Souza, Pedro Moura

Publication date: 8 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20194

zbMATH Keywords

Lagrangean relaxationlocal searchSteiner treearborescencereformulationconnectivity constraints

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (5)

Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Vertex covering with capacitated trees ⋮ Unnamed Item ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

Cites Work

• Optimum branchings

This page was built for publication: Models and heuristics for a minimum arborescence problem