The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
Authors:
- Temel ÖncanTÖTemel Öncan
- Abraham P. PunnenAPAbraham P. Punnen
- 1 October 2010
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 37 (10) , 1762-1773
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A New Evolutionary Algorithm for Spanning-Tree Based Communication Network DesignIEICE Transactions on Communications, 2005
- Fuzzy quadratic minimum spanning tree problemApplied Mathematics and Computation, 2005
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- An effective genetic algorithm approach to the quadratic minimum spanning tree problemComputers & Operations Research, 1998
- Tabu Thresholding: Improved Search by Nonmonotonic TrajectoriesINFORMS Journal on Computing, 1995
- Linear multiplicative programmingMathematical Programming, 1992
- On the quadratic assignment problemDiscrete Applied Mathematics, 1983
- The Quadratic Assignment ProblemManagement Science, 1963
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956