Explore: Branch And Bound Algorithms

Discover books, insights, and more — all in one place.

Learn more about Branch And Bound Algorithms with top reads curated from trusted sources — all in one place.

Topic Search

Search for any topic

AI-Generated Overview About “branch-and-bound-algorithms”:


Books Results

Source: The Open Library

The Open Library Search Results

Search results from The Open Library

1Automatic verification of sequential infinite-state processes

By

Book's cover

“Automatic verification of sequential infinite-state processes” Metadata:

  • Title: ➤  Automatic verification of sequential infinite-state processes
  • Author:
  • Language: English
  • Number of Pages: Median: 163
  • Publisher: ➤  Springer - Springer London, Limited
  • Publish Date:
  • Publish Location: New York - London - Berlin

“Automatic verification of sequential infinite-state processes” Subjects and Themes:

Edition Identifiers:

Access and General Info:

  • First Year Published: 1997
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Marketplaces

Find Automatic verification of sequential infinite-state processes at online marketplaces:


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

By

“Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus” Metadata:

  • Title: ➤  Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus
  • Author:
  • Language: ger
  • Number of Pages: Median: 152
  • Publisher: Physica-Verlag
  • Publish Date:
  • Publish Location: Würzburg

“Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus” Subjects and Themes:

Edition Identifiers:

Access and General Info:

  • First Year Published: 1969
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Marketplaces

Find Die Lösung von Reihenfolgeproblemen aus den Bereich der Maschinenbelegungsplanung mit Hilfe des branch and bound algorithmus at online marketplaces:


3Single-and multi-net wiring by the branch-and-bound method

By

“Single-and multi-net wiring by the branch-and-bound method” Metadata:

  • Title: ➤  Single-and multi-net wiring by the branch-and-bound method
  • Author:
  • Language: English
  • Number of Pages: Median: 143
  • Publish Date:
  • Publish Location: [New York]

“Single-and multi-net wiring by the branch-and-bound method” Subjects and Themes:

Edition Identifiers:

  • The Open Library ID: OL5318753M
  • Online Computer Library Center (OCLC) ID: 14464928
  • Library of Congress Control Number (LCCN): 72169135

Access and General Info:

  • First Year Published: 1972
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Marketplaces

Find Single-and multi-net wiring by the branch-and-bound method at online marketplaces:


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

By

“An improvement of a branch-and-bound algorithm for designing NOR optimal networks” Metadata:

  • Title: ➤  An improvement of a branch-and-bound algorithm for designing NOR optimal networks
  • Author:
  • Language: English
  • Number of Pages: Median: 34
  • Publisher: ➤  Dept. of Computer Science, University of Illinois at Urbana-Champaign
  • Publish Date:
  • Publish Location: Urbana, Ill

“An improvement of a branch-and-bound algorithm for designing NOR optimal networks” Subjects and Themes:

Edition Identifiers:

Access and General Info:

  • First Year Published: 1980
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Marketplaces

Find An improvement of a branch-and-bound algorithm for designing NOR optimal networks at online marketplaces:


5Scheduling the hybrid flowshop

By

“Scheduling the hybrid flowshop” Metadata:

  • Title: Scheduling the hybrid flowshop
  • Author:
  • Language: English
  • Number of Pages: Median: 177
  • Publisher: CIACO
  • Publish Date:
  • Publish Location: Louvain-la-Neuve

“Scheduling the hybrid flowshop” Subjects and Themes:

Edition Identifiers:

Access and General Info:

  • First Year Published: 1999
  • Is Full Text Available: No
  • Is The Book Public: No
  • Access Status: No_ebook

Online Marketplaces

Find Scheduling the hybrid flowshop at online marketplaces:


6Efficient branch and bound search with application to computer-aided design

By

Book's cover

“Efficient branch and bound search with application to computer-aided design” Metadata:

  • Title: ➤  Efficient branch and bound search with application to computer-aided design
  • Author:
  • Language: English
  • Number of Pages: Median: 146
  • Publisher: Kluwer Academic Publishers
  • Publish Date:
  • Publish Location: Boston

“Efficient branch and bound search with application to computer-aided design” Subjects and Themes:

Edition Identifiers:

Access and General Info:

  • First Year Published: 1996
  • Is Full Text Available: Yes
  • Is The Book Public: No
  • Access Status: Printdisabled

Online Access

Downloads Are Not Available:

The book is not public therefore the download links will not allow the download of the entire book, however, borrowing the book online is available.

Online Borrowing:

    Online Marketplaces

    Find Efficient branch and bound search with application to computer-aided design at online marketplaces:


    7Manipulating the branch and bound tree

    By

    “Manipulating the branch and bound tree” Metadata:

    • Title: ➤  Manipulating the branch and bound tree
    • Author:
    • Language: English
    • Publisher: ➤  Business Research Division, Graduate School of Business Administration, University of Colorado
    • Publish Date:
    • Publish Location: Boulder

    “Manipulating the branch and bound tree” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1975
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Manipulating the branch and bound tree at online marketplaces:


    8The assignment of men to machines

    By

    “The assignment of men to machines” Metadata:

    • Title: ➤  The assignment of men to machines
    • Author:
    • Language: English
    • Number of Pages: Median: 26
    • Publisher: ➤  Krannert Graduate School of Industrial Administration, Purdue University
    • Publish Date:
    • Publish Location: West Lafayette, Ind

    “The assignment of men to machines” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1973
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find The assignment of men to machines at online marketplaces:


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

    By

    “A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functions” Metadata:

    • Title: ➤  A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functions
    • Author:
    • Language: English
    • Number of Pages: Median: 16
    • Publisher: ➤  Technion-Israel Institute of Technology, Dept. of Computer Science
    • Publish Date:
    • Publish Location: Haifa

    “A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functions” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1974
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find A branch-and-bound algorithm for optimal evaluation of monotonic Boolean functions at online marketplaces:


    10Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva

    By

    “Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva” Metadata:

    • Title: ➤  Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva
    • Author:
    • Language: rus
    • Number of Pages: Median: 19
    • Publisher: ➤  Vychislitelʹnyĭ ͡tsentr AN SSSR
    • Publish Date:
    • Publish Location: Moskva

    “Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1985
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva at online marketplaces:


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

    By

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

    • Title: ➤  On a dominance test for a single machine scheduling problem with release dates to minimize total flow time
    • Author:
    • Language: English
    • Number of Pages: Median: 18
    • Publisher: ➤  Institute of Economic Research, Kobe University of Commerce
    • Publish Date:
    • Publish Location: Kobe

    “On a dominance test for a single machine scheduling problem with release dates to minimize total flow time” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 2003
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find On a dominance test for a single machine scheduling problem with release dates to minimize total flow time at online marketplaces:


    12Optimal solution of set covering problems using dual heuristics

    By

    “Optimal solution of set covering problems using dual heuristics” Metadata:

    • Title: ➤  Optimal solution of set covering problems using dual heuristics
    • Author:
    • Language: English
    • Number of Pages: Median: 23
    • Publisher: ➤  Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University
    • Publish Date:
    • Publish Location: West Lafayette, Ind

    “Optimal solution of set covering problems using dual heuristics” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1987
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Optimal solution of set covering problems using dual heuristics at online marketplaces:


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

    By

    “A branch-and-bound algorithm for optimal NOR networks (the algorithm description)” Metadata:

    • Title: ➤  A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
    • Author:
    • Language: English
    • Number of Pages: Median: 29
    • Publisher: ➤  Dept. of Computer Science, University of Illinois
    • Publish Date:
    • Publish Location: Urbana

    “A branch-and-bound algorithm for optimal NOR networks (the algorithm description)” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1971
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find A branch-and-bound algorithm for optimal NOR networks (the algorithm description) at online marketplaces:


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

    By

    “A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)” Metadata:

    • Title: ➤  A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
    • Author:
    • Language: English
    • Number of Pages: Median: 39
    • Publisher: ➤  Dept. of Computer Science, University of Illinois
    • Publish Date:
    • Publish Location: Urbana

    “A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1971
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description) at online marketplaces:


    15Comparison of the implicit enumeration method and the branch-and-bound method for logical design

    By

    “Comparison of the implicit enumeration method and the branch-and-bound method for logical design” Metadata:

    • Title: ➤  Comparison of the implicit enumeration method and the branch-and-bound method for logical design
    • Author:
    • Language: English
    • Number of Pages: Median: 94
    • Publisher: ➤  Dept. of Computer Science, University of Illinois
    • Publish Date:
    • Publish Location: Urbana

    “Comparison of the implicit enumeration method and the branch-and-bound method for logical design” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1971
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Comparison of the implicit enumeration method and the branch-and-bound method for logical design at online marketplaces:


    16Design algorithm of optimal NOR networks by the branch-and-bound approach

    By

    “Design algorithm of optimal NOR networks by the branch-and-bound approach” Metadata:

    • Title: ➤  Design algorithm of optimal NOR networks by the branch-and-bound approach
    • Author:
    • Language: English
    • Number of Pages: Median: 35
    • Publisher: ➤  Dept. of Computer Science, University of Illinois at Urbana-Champaign
    • Publish Date:
    • Publish Location: Urbana, Ill

    “Design algorithm of optimal NOR networks by the branch-and-bound approach” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1984
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Design algorithm of optimal NOR networks by the branch-and-bound approach at online marketplaces:


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

    By

    “Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteri” Metadata:

    • Title: ➤  Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteri
    • Author:
    • Language: ita
    • Number of Pages: Median: 16
    • Publisher: Del Bianco
    • Publish Date:
    • Publish Location: Trieste

    “Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteri” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1976
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Sulla determinazione dei punti di ottimo paretiano in problemi finiti di ottimizzazione a due criteri at online marketplaces:


    18Teoria dei grafi

    By

    “Teoria dei grafi” Metadata:

    • Title: Teoria dei grafi
    • Author:
    • Language: ita
    • Publisher: ➤  Officine grafiche Pitagora-Tecnoprint
    • Publish Date:
    • Publish Location: Bologna

    “Teoria dei grafi” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1976
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Teoria dei grafi at online marketplaces:


    19Discrete programming applications of techniques for handling a common list structure

    By

    “Discrete programming applications of techniques for handling a common list structure” Metadata:

    • Title: ➤  Discrete programming applications of techniques for handling a common list structure
    • Author:
    • Language: English
    • Number of Pages: Median: 20
    • Publisher: Rand Corp.
    • Publish Date:
    • Publish Location: Santa Monica, Calif

    “Discrete programming applications of techniques for handling a common list structure” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1969
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Discrete programming applications of techniques for handling a common list structure at online marketplaces:


    20Multiple resource-constrained scheduling using branch and bound

    By

    “Multiple resource-constrained scheduling using branch and bound” Metadata:

    • Title: ➤  Multiple resource-constrained scheduling using branch and bound
    • Author:
    • Language: English
    • Number of Pages: Median: 19
    • Publisher: ➤  Management Research Center, School of Management, Syracuse University
    • Publish Date:
    • Publish Location: Syracuse, N.Y

    “Multiple resource-constrained scheduling using branch and bound” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1977
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Multiple resource-constrained scheduling using branch and bound at online marketplaces:


    21Network models with generalized upper bound side constraints

    By

    “Network models with generalized upper bound side constraints” Metadata:

    • Title: ➤  Network models with generalized upper bound side constraints
    • Author:
    • Language: English
    • Number of Pages: Median: 272
    • Publish Date:

    “Network models with generalized upper bound side constraints” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1989
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Network models with generalized upper bound side constraints at online marketplaces:


    22The optimal state assignment problem

    By

    “The optimal state assignment problem” Metadata:

    • Title: ➤  The optimal state assignment problem
    • Author:
    • Language: English
    • Number of Pages: Median: 55
    • Publish Date:

    “The optimal state assignment problem” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1981
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find The optimal state assignment problem at online marketplaces:


    23Multiple resource-constrained scheduling using branch and bound

    By

    “Multiple resource-constrained scheduling using branch and bound” Metadata:

    • Title: ➤  Multiple resource-constrained scheduling using branch and bound
    • Author:
    • Language: English
    • Number of Pages: Median: 19
    • Publisher: ➤  Management Research Center, School of Management, Syracuse University
    • Publish Date:
    • Publish Location: Syracuse, N.Y

    “Multiple resource-constrained scheduling using branch and bound” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1977
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Multiple resource-constrained scheduling using branch and bound at online marketplaces:


    24Branch and bound

    By

    “Branch and bound” Metadata:

    • Title: Branch and bound
    • Author:
    • Language: English
    • Number of Pages: Median: 174
    • Publisher: Springer-Verlag
    • Publish Date:
    • Publish Location: Berlin - New York

    “Branch and bound” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1973
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Branch and bound at online marketplaces:


    25Standortplanung für Abfallbehandlungsanlagen

    By

    Book's cover

    “Standortplanung für Abfallbehandlungsanlagen” Metadata:

    • Title: ➤  Standortplanung für Abfallbehandlungsanlagen
    • Author:
    • Language: ger
    • Number of Pages: Median: 154
    • Publisher: E. Schmidt
    • Publish Date:
    • Publish Location: Bielefeld

    “Standortplanung für Abfallbehandlungsanlagen” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1976
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Standortplanung für Abfallbehandlungsanlagen at online marketplaces:


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

    By

    “An efficient branch and bound algorithm for the capacitated warehouse location problem” Metadata:

    • Title: ➤  An efficient branch and bound algorithm for the capacitated warehouse location problem
    • Author:
    • Language: English
    • Number of Pages: Median: 31
    • Publisher: ➤  Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University
    • Publish Date:
    • Publish Location: West Lafayette, Ind

    “An efficient branch and bound algorithm for the capacitated warehouse location problem” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1974
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find An efficient branch and bound algorithm for the capacitated warehouse location problem at online marketplaces:


    27A branch and bound algorithm for assembly line balancing with paralleling

    By

    “A branch and bound algorithm for assembly line balancing with paralleling” Metadata:

    • Title: ➤  A branch and bound algorithm for assembly line balancing with paralleling
    • Author:
    • Language: English
    • Number of Pages: Median: 14
    • Publisher: ➤  Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University
    • Publish Date:
    • Publish Location: West Lafayette, Ind

    “A branch and bound algorithm for assembly line balancing with paralleling” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1974
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find A branch and bound algorithm for assembly line balancing with paralleling at online marketplaces:


    28A note on multiactivity multifacility systems by branch and bound

    By

    “A note on multiactivity multifacility systems by branch and bound” Metadata:

    • Title: ➤  A note on multiactivity multifacility systems by branch and bound
    • Author:
    • Language: English
    • Publisher: ➤  Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University
    • Publish Date:
    • Publish Location: West Lafayette, Ind

    “A note on multiactivity multifacility systems by branch and bound” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1974
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find A note on multiactivity multifacility systems by branch and bound at online marketplaces:


    29Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems

    By

    “Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems” Metadata:

    • Title: ➤  Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems
    • Author:
    • Language: ger
    • Publisher: ➤  Technische Universität Dresden
    • Publish Date:
    • Publish Location: [Dresden]

    “Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1980
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems at online marketplaces:


    30Branch-and-bound applications in combinatorial data analysis

    By

    Book's cover

    “Branch-and-bound applications in combinatorial data analysis” Metadata:

    • Title: ➤  Branch-and-bound applications in combinatorial data analysis
    • Author:
    • Language: English
    • Number of Pages: Median: 200
    • Publisher: Springer
    • Publish Date:
    • Publish Location: New York

    “Branch-and-bound applications in combinatorial data analysis” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 2005
    • Is Full Text Available: No
    • Is The Book Public: No
    • Access Status: No_ebook

    Online Marketplaces

    Find Branch-and-bound applications in combinatorial data analysis at online marketplaces:


    31Branch-and-bound strategies for dynamic programming

    By

    Book's cover

    “Branch-and-bound strategies for dynamic programming” Metadata:

    • Title: ➤  Branch-and-bound strategies for dynamic programming
    • Author:
    • Language: English
    • Number of Pages: Median: 23
    • Publisher: ➤  Alfred P. Sloan School of Management, Massachusetts Institute of Technology - Creative Media Partners, LLC
    • Publish Date:
    • Publish Location: Cambridge, Mass

    “Branch-and-bound strategies for dynamic programming” Subjects and Themes:

    Edition Identifiers:

    Access and General Info:

    • First Year Published: 1975
    • Is Full Text Available: Yes
    • Is The Book Public: Yes
    • Access Status: Public

    Online Access

    Downloads:

      Online Borrowing:

      Online Marketplaces

      Find Branch-and-bound strategies for dynamic programming at online marketplaces:


      32Optimizing binary trees grown with a sorting algorithm

      By

      Book's cover

      “Optimizing binary trees grown with a sorting algorithm” Metadata:

      • Title: ➤  Optimizing binary trees grown with a sorting algorithm
      • Author:
      • Language: English
      • Number of Pages: Median: 23
      • Publisher: ➤  Creative Media Partners, LLC - M.I.T.]
      • Publish Date:
      • Publish Location: [Cambridge, Mass

      “Optimizing binary trees grown with a sorting algorithm” Subjects and Themes:

      Edition Identifiers:

      Access and General Info:

      • First Year Published: 1969
      • Is Full Text Available: Yes
      • Is The Book Public: Yes
      • Access Status: Public

      Online Access

      Downloads:

        Online Borrowing:

        Online Marketplaces

        Find Optimizing binary trees grown with a sorting algorithm at online marketplaces:


        33Branch and bound methods for combinatorial problems

        By

        Book's cover

        “Branch and bound methods for combinatorial problems” Metadata:

        • Title: ➤  Branch and bound methods for combinatorial problems
        • Author:
        • Language: English
        • Number of Pages: Median: 23
        • Publisher: ➤  M.I.T.] - Creative Media Partners, LLC
        • Publish Date:
        • Publish Location: [Cambridge, Mass

        “Branch and bound methods for combinatorial problems” Subjects and Themes:

        Edition Identifiers:

        Access and General Info:

        • First Year Published: 1966
        • Is Full Text Available: Yes
        • Is The Book Public: Yes
        • Access Status: Public

        Online Access

        Downloads:

          Online Borrowing:

          Online Marketplaces

          Find Branch and bound methods for combinatorial problems at online marketplaces:


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

          By

          Book's cover

          “Pruning and branching methods for designing optimal networks by the branch-and-bound method” Metadata:

          • Title: ➤  Pruning and branching methods for designing optimal networks by the branch-and-bound method
          • Author:
          • Language: English
          • Number of Pages: Median: 59
          • Publisher: ➤  Dept. of Computer Science, University of Illinois
          • Publish Date:
          • Publish Location: Urbana

          “Pruning and branching methods for designing optimal networks by the branch-and-bound method” Subjects and Themes:

          Edition Identifiers:

          Access and General Info:

          • First Year Published: 1971
          • Is Full Text Available: Yes
          • Is The Book Public: Yes
          • Access Status: Public

          Online Access

          Downloads:

            Online Borrowing:

            Online Marketplaces

            Find Pruning and branching methods for designing optimal networks by the branch-and-bound method at online marketplaces:


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

            By

            Book's cover

            “Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program” Metadata:

            • Title: ➤  Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program
            • Author:
            • Language: English
            • Number of Pages: Median: 47
            • Publisher: ➤  Dept. of Computer Science, University of Illinois at Urbana-Champaign
            • Publish Date:
            • Publish Location: Urbana

            “Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program” Subjects and Themes:

            Edition Identifiers:

            Access and General Info:

            • First Year Published: 1976
            • Is Full Text Available: Yes
            • Is The Book Public: Yes
            • Access Status: Public

            Online Access

            Downloads:

              Online Borrowing:

              Online Marketplaces

              Find Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program at online marketplaces:


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

              By

              Book's cover

              “A group theoretic branch and bound algorithm for the zero-one integer programming problem” Metadata:

              • Title: ➤  A group theoretic branch and bound algorithm for the zero-one integer programming problem
              • Author:
              • Language: English
              • Number of Pages: Median: 53
              • Publisher: M.I.T.]
              • Publish Date:
              • Publish Location: [Cambridge, Mass

              “A group theoretic branch and bound algorithm for the zero-one integer programming problem” Subjects and Themes:

              Edition Identifiers:

              Access and General Info:

              • First Year Published: 1967
              • Is Full Text Available: Yes
              • Is The Book Public: Yes
              • Access Status: Public

              Online Access

              Downloads:

                Online Borrowing:

                Online Marketplaces

                Find A group theoretic branch and bound algorithm for the zero-one integer programming problem at online marketplaces:


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

                By

                Book's cover

                “A branch-and-bound algorithm for optimal NOR networks (the algorithm description)” Metadata:

                • Title: ➤  A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
                • Author:
                • Language: English
                • Number of Pages: Median: 29
                • Publisher: ➤  Dept. of Computer Science, University of Illinois
                • Publish Date:
                • Publish Location: Urbana

                “A branch-and-bound algorithm for optimal NOR networks (the algorithm description)” Subjects and Themes:

                Edition Identifiers:

                Access and General Info:

                • First Year Published: 1971
                • Is Full Text Available: Yes
                • Is The Book Public: Yes
                • Access Status: Public

                Online Access

                Downloads:

                  Online Borrowing:

                  Online Marketplaces

                  Find A branch-and-bound algorithm for optimal NOR networks (the algorithm description) at online marketplaces:


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

                  By

                  Book's cover

                  “A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)” Metadata:

                  • Title: ➤  A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
                  • Author:
                  • Language: English
                  • Number of Pages: Median: 39
                  • Publisher: ➤  Dept. of Computer Science, University of Illinois
                  • Publish Date:
                  • Publish Location: Urbana

                  “A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)” Subjects and Themes:

                  Edition Identifiers:

                  Access and General Info:

                  • First Year Published: 1971
                  • Is Full Text Available: Yes
                  • Is The Book Public: Yes
                  • Access Status: Public

                  Online Access

                  Downloads:

                    Online Borrowing:

                    Online Marketplaces

                    Find A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description) at online marketplaces:


                    39Branch-and bound strategies for dynamic programming

                    By

                    Book's cover

                    “Branch-and bound strategies for dynamic programming” Metadata:

                    • Title: ➤  Branch-and bound strategies for dynamic programming
                    • Author:
                    • Language: English
                    • Number of Pages: Median: 24
                    • Publisher: M.I.T.
                    • Publish Date:
                    • Publish Location: Cambridge

                    “Branch-and bound strategies for dynamic programming” Subjects and Themes:

                    Edition Identifiers:

                    Access and General Info:

                    • First Year Published: 1974
                    • Is Full Text Available: Yes
                    • Is The Book Public: Yes
                    • Access Status: Public

                    Online Access

                    Downloads:

                      Online Borrowing:

                      Online Marketplaces

                      Find Branch-and bound strategies for dynamic programming at online marketplaces:


                      40A branch and bound method for nonseparable nonconvex optimization

                      By

                      Book's cover

                      “A branch and bound method for nonseparable nonconvex optimization” Metadata:

                      • Title: ➤  A branch and bound method for nonseparable nonconvex optimization
                      • Author:
                      • Language: English
                      • Number of Pages: Median: 11
                      • Publisher: Naval Postgraduate School
                      • Publish Date:
                      • Publish Location: Monterey, Calif

                      “A branch and bound method for nonseparable nonconvex optimization” Subjects and Themes:

                      Edition Identifiers:

                      Access and General Info:

                      • First Year Published: 1975
                      • Is Full Text Available: Yes
                      • Is The Book Public: Yes
                      • Access Status: Public

                      Online Access

                      Downloads:

                        Online Borrowing:

                        Online Marketplaces

                        Find A branch and bound method for nonseparable nonconvex optimization at online marketplaces:


                        41Comparison of the implicit enumeration method and the branch-and-bound method for logical design

                        By

                        Book's cover

                        “Comparison of the implicit enumeration method and the branch-and-bound method for logical design” Metadata:

                        • Title: ➤  Comparison of the implicit enumeration method and the branch-and-bound method for logical design
                        • Author:
                        • Language: English
                        • Number of Pages: Median: 94
                        • Publisher: ➤  Dept. of Computer Science, University of Illinois
                        • Publish Date:
                        • Publish Location: Urbana

                        “Comparison of the implicit enumeration method and the branch-and-bound method for logical design” Subjects and Themes:

                        Edition Identifiers:

                        Access and General Info:

                        • First Year Published: 1971
                        • Is Full Text Available: Yes
                        • Is The Book Public: Yes
                        • Access Status: Public

                        Online Access

                        Downloads:

                          Online Borrowing:

                          Online Marketplaces

                          Find Comparison of the implicit enumeration method and the branch-and-bound method for logical design at online marketplaces:


                          Top of Page