Branch And Bound Algorithms

41 books
A branch and bound algorithm for assembly line balancing with parallelingBasheer M. Khumawala
⏱ 14m

A branch and bound algorithm for assembly line balancing with paralleling

Basheer M. Khumawala

197414 pp.
Scheduling the hybrid flowshopOmar Moursli
⏱ 2h 57m

Scheduling the hybrid flowshop

Omar Moursli

1999177 pp.
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)Tomoyasu Nakagawa
⏱ 29m

A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

Tomoyasu Nakagawa

197129 pp.
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)Tomoyasu Nakagawa
⏱ 29m

A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

Tomoyasu Nakagawa

197129 pp.
An efficient branch and bound algorithm for the capacitated warehouse location problemBasheer M. Khumawala
⏱ 31m

An efficient branch and bound algorithm for the capacitated warehouse location problem

Basheer M. Khumawala

197431 pp.
A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functionsY. Breitbart
⏱ 16m

A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functions

Y. Breitbart

197416 pp.
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)Tomoyasu Nakagawa
⏱ 39m

A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

Tomoyasu Nakagawa

197139 pp.
An improvement of a branch-and-bound algorithm for designing NOR optimal networksD. Alkhateeb
⏱ 34m

An improvement of a branch-and-bound algorithm for designing NOR optimal networks

D. Alkhateeb

198034 pp.
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)Tomoyasu Nakagawa
⏱ 39m

A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

Tomoyasu Nakagawa

197139 pp.
A group theoretic branch and bound algorithm for the zero-one integer programming problemJeremy F. Shapiro
⏱ 53m

A group theoretic branch and bound algorithm for the zero-one integer programming problem

Jeremy F. Shapiro

196753 pp.
Branch-and-bound strategies for dynamic programmingThomas L. Morin
⏱ 23m

Branch-and-bound strategies for dynamic programming

Thomas L. Morin

197523 pp.
Optimal solution of set covering problems using dual heuristicsPradeep Kedia
⏱ 23m

Optimal solution of set covering problems using dual heuristics

Pradeep Kedia

198723 pp.
Pruning and branching methods for designing optimal networks by the branch-and-bound methodTomoyasu Nakagawa
⏱ 59m

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

Tomoyasu Nakagawa

197159 pp.
Branch and bound methods for combinatorial problemsJohn D. C. Little
⏱ 23m

Branch and bound methods for combinatorial problems

John D. C. Little

196623 pp.
Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteriErmanno Pitacco
⏱ 16m

Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteri

Ermanno Pitacco

197616 pp.
On a dominance test for a single machine scheduling problem with release dates to minimize total flow timeShūzō Yanai
⏱ 18m

On a dominance test for a single machine scheduling problem with release dates to minimize total flow time

Shūzō Yanai

200318 pp.
Teoria dei grafiGiorgio Carpaneto

Teoria dei grafi

Giorgio Carpaneto

1976No page data
Branch and boundFranz Weinberg
⏱ 2h 54m

Branch and bound

Franz Weinberg

1973174 pp.
Optimizing binary trees grown with a sorting algorithmWilliam A Martin
⏱ 23m

Optimizing binary trees grown with a sorting algorithm

William A Martin

196923 pp.
A note on multiactivity multifacility systems by branch and boundBasheer M. Khumawala

A note on multiactivity multifacility systems by branch and bound

Basheer M. Khumawala

1974No page data
Page 1 of 3Next →