A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
From MaRDI portal
Publication:2567872
DOI10.1023/A:1009629727566zbMath1071.90581OpenAlexW1666636161MaRDI QIDQ2567872
Erik Rolland, Hasan Pirkul, Raymond A. Patterson
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009629727566
Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Unnamed Item, Greedy heuristics for the diameter-constrained minimum spanning tree problem, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, RAMP for the capacitated minimum spanning tree problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Seeking global edges for traveling salesman problem in multi-start search, Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, Combining metaheuristics with mathematical programming, constraint programming and machine learning, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, Adaptive memory programming: a unified view of metaheuristics, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Heuristic procedure neural networks for the CMST problem, Design of capacitated degree constrained min-sum arborescence, Savings based ant colony optimization for the capacitated minimum spanning tree problem
