On some polynomial solvable cases of the generalized minimum spanning tree problem

MaRDI QIDQ3446182zbMATH OpenFDO

Authors Petrica Pop

Publication date 14 June 2007

Full work available at URL https://eudml.org/doc/130266

zbMATH Keywords

\(\mathcal N\mathcal P\)-hard problemsgeneralized minimum spanning tree problem

Mathematics Subject Classification ID

Linear programming (90C05) Convex programming (90C25) Semi-infinite programming (90C34)

Recommendations

• A note on the complexity of the generalized minimum spanning tree problem
• New models of the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 1788251
• scientific article; zbMATH DE number 2201897

Cited in

(2)

• A note on the complexity of the generalized minimum spanning tree problem
• New models of the generalized minimum spanning tree problem

This page was built for publication: On some polynomial solvable cases 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 Q3446182)