The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 37, Issue 10, Pages 1762-1773
Publisher
Elsevier BV
Online
2010-01-19
DOI
10.1016/j.cor.2010.01.004

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.