Branch and bound methods for combinatorial problems

1966

Páginas: 23

Género: Branch and bound algorithms

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

Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus

Gerhard Rubow

1969

Standortplanung für Abfallbehandlungsanlagen

Gerd Dehnert

1976

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

Jeremy F. Shapiro

1967