Accelerating List Processing in Discrete Programming

1 April 1970

journal article
Published by Association for Computing Machinery (ACM) in Journal of the ACM

Vol. 17 (2), 383-384
https://doi.org/10.1145/321574.321590

Abstract

It is pointed out how two (existing) list-handling algorithms, heapsort and bal- anced tree search, can accelerate incremental allocation and branch and bound algorithms-- in particular, certain integer programming algorithms.

Keywords

BRANCH AND BOUND
: HEAPSORT
INCREMENTAL ALLOCATION
ACCELERATING LIST
BALANCED TREE SEARCH
DISCRETE PROGRAMMING

This publication has 2 references indexed in Scilit:

Discrete Optimization Via Marginal Analysis
Management Science, 1966
Branch-and-Bound Methods: A Survey
Operations Research, 1966

Cited by 5 articles