Solving the generalized minimum spanning tree problem with simulated annealing

MaRDI QIDQ3639558zbMATH OpenFDO

Authors Petrica Pop, Cosmin Sabo, Corina Pop Sitar, Marian Viorel Craciun

Publication date 2 November 2009

zbMATH Keywords

dynamic programminggeneralized minimum spanning tree problemsimulated annealing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• A new relaxation method for 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 2201897
• Upper and lower bounding strategies for the generalized minimum spanning tree problem

Cited in

(6)

• A two-level solution approach for solving the generalized minimum spanning tree problem
• A rapid learning automata-based approach for generalized minimum spanning tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics
• Building a capacitated minimum spanning tree using simulated annealing
• Graph minors from simulated annealing for annealing machines with sparse connectivity

This page was built for publication: Solving the generalized minimum spanning tree problem with simulated annealing

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