Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Technical Note—On the Expected Performance of Branch-and-Bound Algorithms

Technical Note—On the Expected Performance of Branch-and-Bound Algorithms For many combinatorial optimization problems, the use of enumerative solution methods exhibiting a superpolynomial worst-case behavior seems unavoidable. It is therefore of interest to investigate the expected behavior of such methods. Polynomial-bounded expected performance has been claimed by Bellmore and Malone for their traveling salesman algorithm. The purpose of this brief note is to point out some inadequacies of their proof. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Operations Research INFORMS

Technical Note—On the Expected Performance of Branch-and-Bound Algorithms

Lenstra, J. K.; Rinnooy Kan, A. H. G.
Operations Research , Volume 26 (2): 3 – Apr 1, 1978
Download PDF
4 pages

Loading next page...
 
/lp/informs/technical-note-on-the-expected-performance-of-branch-and-bound-YYW7wnSOjS

References (2)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Technical Note
ISSN
0030-364X
eISSN
1526-5463
DOI
10.1287/opre.26.2.347
Publisher site
See Article on Publisher Site

Abstract

For many combinatorial optimization problems, the use of enumerative solution methods exhibiting a superpolynomial worst-case behavior seems unavoidable. It is therefore of interest to investigate the expected behavior of such methods. Polynomial-bounded expected performance has been claimed by Bellmore and Malone for their traveling salesman algorithm. The purpose of this brief note is to point out some inadequacies of their proof.

Journal

Operations Research – INFORMS

Published: Apr 1, 1978

There are no references for this article.