Añadir a mi colección
Formato
También te puede gustar
Branch-and-bound strategies for dynamic programming
Thomas L. Morin
1975
Automatic verification of sequential infinite-state processes
Olaf Burkart
1997
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program
Jay Culliney
1976
Optimizing binary trees grown with a sorting algorithm
William A Martin
1969
Pruning and branching methods for designing optimal networks by the branch-and-bound method
Tomoyasu Nakagawa
1971
Branch and bound methods for combinatorial problems
John D. C. Little
1966
Standortplanung für Abfallbehandlungsanlagen
Gerd Dehnert
A group theoretic branch and bound algorithm for the zero-one integer programming problem
Jeremy F. Shapiro
1967