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

Optimization Algorithms for Networks and Graphs

List Price: $89.99
SKU:
9780367402808
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:
    James Evans
    Format:
    Paperback
    Pages:
    488
    Publisher:
    CRC Press (September 11, 2019)
    Language:
    English
    Audience:
    Professional and scholarly
    ISBN-13:
    9780367402808
    Weight:
    27.25oz
    Dimensions:
    7" x 9"
    File:
    TAYLORFRANCIS-TayFran_260403050946149-20260403.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $89.99
    Case Pack:
    14
    As low as:
    $85.49
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Country of Origin:
    United States
    Pub Discount:
    30
    Imprint:
    CRC Press
  • Overview

    A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm