Branch and bound methods for combinatorial problems View on Open Library

Branch and bound methods for combinatorial problems

by John D. C. Little

No reviews yet
First published: 1966 1 language ISBN: 9781021500731
Subjects
Branch and bound algorithms Combinatorial analysis

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by John D. C. Little

Brandaid

Brandaid

Models and managers

Models and managers

The synchronization of traffic signals by mixed-integer linear programming

The synchronization of traffic signals b...

MEDIAC, an on-line media selection system

MEDIAC, an on-line media selection syste...

Operations research in marketing

Operations research in marketing

A media selection calculus

A media selection calculus

You Might Also Like

More in Branch and bound alg...
Branch-and-bound strategies for dynamic programming

Branch-and-bound strategies for dynamic ...

Thomas L. Morin
Automatic verification of sequential infinite-state processes

Automatic verification of sequential inf...

Olaf Burkart
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program

Results of the synthesis of optimal netw...

Jay Culliney
Optimizing binary trees grown with a sorting algorithm

Optimizing binary trees grown with a sor...

William A Martin
Pruning and branching methods for designing optimal networks by the branch-and-bound method

Pruning and branching methods for design...

Tomoyasu Nakagawa
Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus

Die Lösung von Reihenfolgeproblemen aus...

Gerhard Rubow