At least version of the generalized minimum spanning tree problem

MaRDI QIDQ5444811zbMATH OpenFDO

Authors Petrica Pop, Andrei Horvat-Marc, Corina Pop Sitar

Publication date 25 February 2008

zbMATH Keywords

generalized minimum spanning treesGMSTinteger programminglinear relaxationminimum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• An approximation algorithm for the least version of the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• New models of the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5621997
• The generalized minimum spanning tree: polyhedra and branch-and-cut

Cited in

(4)

• A two-level solution approach for solving the generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• An approximation algorithm for the least version of the generalized minimum spanning tree problem
• On generalized minimum spanning trees

This page was built for publication: At least version of the generalized minimum spanning tree problem

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