null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

A Java Library of Graph Algorithms and Optimization

List Price: $87.99
SKU:
9780367390136
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Hang T. Lau
    Format:
    Paperback
    Pages:
    400
    Publisher:
    CRC Press (September 11, 2019)
    Language:
    English
    ISBN-13:
    9780367390136
    Weight:
    25.625oz
    Dimensions:
    7" x 10"
    File:
    TAYLORFRANCIS-TayFran_260117060453325-20260117.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $87.99
    Country of Origin:
    United States
    Series:
    Discrete Mathematics and Its Applications
    Case Pack:
    10
    As low as:
    $83.59
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Pub Discount:
    30
    Imprint:
    Chapman and Hall/CRC
  • Overview

    Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization. Self-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code. An accompanying CD-ROM contains all of the Java code included in the book.