Branch-and-bound and beyond

Authors:
Patrick A. V. Hall
Affiliations:
Department of Mathematics, Division of Computing Science, City University, London
Venue:
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Year:
1971

Citing 1
Cited 2

Scatter storage techniques

Communications of the ACM

A general branch and bound formulation for understanding and synthesizing and/or tree search procedures

Artificial Intelligence
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an operational program that locates objects in a television image and traces their edges. The program accommodates the television camera, maximizing dynamic range during acquisition and sensitivity during tracing, to obtain the most appropriate ...