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

Handbook of Moth-Flame Optimization Algorithm (Variants, Hybrids, Improvements, and Applications)

List Price: $63.99
SKU:
9781032070926
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:
    Seyedali Mirjalili
    Format:
    Paperback
    Pages:
    346
    Publisher:
    CRC Press (March 12, 2025)
    Imprint:
    CRC Press
    Language:
    English
    Audience:
    College/higher education
    ISBN-13:
    9781032070926
    Weight:
    19.875oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260113055421006-20260113.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $63.99
    Country of Origin:
    United States
    Pub Discount:
    30
    Series:
    Advances in Metaheuristics
    As low as:
    $60.79
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
  • Overview

    Moth-Flame Optimization algorithm is an emerging meta-heuristic published in 2015. This book provides in-depth analysis of this algorithm and the existing methods to cope with challenges. It proposes improvements, variants, and hybrids of this algorithm. Applications are also covered to demonstrate the applicability of methods in this book.