It looks like you're offline.
Donate
Change Website Language
Open Library logo
additional options menu
Last edited anonymously
August 19, 2008 | History
Edit

Tomoyasu Nakagawa

We need a photo of Tomoyasu Nakagawa

11 works Add another?

Sorting by Sorted by: Most Editions | First Published | Most Recent | Top Rated | Reading Log | Random

Showing all works by author. Would you like to see only ebooks?

  • Cover of: Pruning and branching methods for designing optimal networks by the branch-and-bound method

    First published in 1971 2 editions in 1 language — 1 previewable
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks

    First published in 1971 2 editions in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

    First published in 1971 1 edition in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

    First published in 1971 1 edition in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Comparison of the implicit enumeration method and the branch-and-bound method for logical design

    First published in 1971 1 edition in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Design algorithm of optimal NOR networks by the branch-and-bound approach

    First published in 1984 1 edition in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Reference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networks

    First published in 1977 1 edition in 1 language
    Not in Library

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks

    First published in 1971 1 edition in 1 language — 1 previewable
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Comparison of the implicit enumeration method and the branch-and-bound method for logical design

    First published in 1971 1 edition in 1 language — 1 previewable
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

    First published in 1971 1 edition in 1 language — 1 previewable
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

    First published in 1971 1 edition in 1 language — 1 previewable
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
We need a photo of Tomoyasu Nakagawa

Subjects
Branch and bound algorithms, Switching theory, Logic design, Integer programming, Data processing, FORTRAN (Computer program language), ILLOD-(AND-OR-B), ILLOD-(NOR-B), ILLOD-(NOR-B) (Computer program), Mathematical optimization

Lists

Add to List

My Reading Lists:

Create a new list

ID Numbers

  • OLID: OL1171320A

Links (outside Open Library)

No links yet. Add one?

History

Download catalog record: RDF / JSON
August 19, 2008 Edited by an anonymous user fix author name
April 1, 2008 Created by an anonymous user initial import