scientific article; zbMATH DE number 1488100

MaRDI QIDQ4495206zbMATH OpenFDO

Authors Erik Rolland, Raymond A. Patterson, Hasan Pirkul

Publication date 10 August 2000

zbMATH Keywords

capacitated minimum spanning tree problemheuristicsearch procedure

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Automata, Languages and Programming
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• scientific article; zbMATH DE number 2090612
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Heuristics for the multi-level capacitated minimum spanning tree problem

Cited in

(4)

• Heuristic procedure neural networks for the CMST problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• Adaptive memory in multistart heuristics for multicommodity network design
• Greedy random adaptive memory programming search for the capacitated clustering problem

This page was built for publication:

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