Discrete programming applications of techniques for handling a common list structure View on Open Library

Discrete programming applications of techniques for handling a common list structure

by Bennett L. Fox

No reviews yet
First published: 1969 1 language
Subjects
Branch and bound algorithms List processing (Electronic computers) Programming (Mathematics)

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Bennett L. Fox

Semi-Markov processes

Semi-Markov processes

How to store it

How to store it

Calculating k-th shortest paths

Calculating k-th shortest paths

Discrete optimization via marginal analysis

Discrete optimization via marginal analy...

Markov renewal programming by linear fractional programming

Markov renewal programming by linear fra...

Adaptive policies for Markov renewal programs

Adaptive policies for Markov renewal pro...

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
Branch and bound methods for combinatorial problems

Branch and bound methods for combinatori...

John D. C. Little