• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • Inverse Combinatorial Optimization Problems

    Inverse Combinatorial Optimization Problems by Guan, Xiucui; Pardalos, Panos M.; Zhang, Binwu;

    Series: Springer Optimization and Its Applications; 225;

      • GET 20% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 149.79
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        62 125 Ft (59 167 Ft + 5% VAT)
      • Discount 20% (cc. 12 425 Ft off)
      • Discounted price 49 700 Ft (47 334 Ft + 5% VAT)

    62 125 Ft

    db

    Availability

    printed on demand

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Publisher Springer Nature Switzerland
    • Date of Publication 25 July 2025
    • Number of Volumes 1 pieces, Book

    • ISBN 9783031911743
    • Binding Hardback
    • No. of pages367 pages
    • Size 235x155 mm
    • Language English
    • Illustrations XXX, 367 p. 26 illus., 17 illus. in color. Illustrations, black & white
    • 775

    Categories

    Long description:

    "

    This book offers as exploration into the emerging field of Inverse Combinatorial Optimization Problems (ICOPs), a transformative area within operations research. As traditional optimization focuses on maximizing or minimizing objectives under constraints, ICOPs reverse this process, allowing for the inference of hidden parameters from observed outcomes. This monograph provides a comprehensive framework for understanding and applying ICOPs across various domains.
    Key concepts such as inverse shortest path, spanning tree, and center location problems are meticulously examined, offering theoretical insights and algorithmic solutions. The authors present a structured approach to these complex problems, making this work an essential resource for both academic and practical applications. By addressing critical questions and providing algorithmic tools, this book is a must-read for those seeking to enhance network design, logistics, and strategic planning.
    Researchers, academics, and practitioners in operations research and management science will find this monograph invaluable. It not only contributes to academic discourse but also equips professionals with the knowledge to tackle real-world challenges. This book is a vital addition to any library supporting advanced studies in optimization and decision-making processes.
    "

    More

    Table of Contents:

    Preface.- Part I. An Introduction to Inverse Combinatorial Optimization Problems.- An Outline of Inverse Combinatorial Optimization Problems.- Generalized Inverse Bottleneck Optimization Problems.- Generalized Inverse Maximum Capacity Path Problems.- Some General Methods to Solve Inverse Linear Programming Problem under Weighted l1 Norm.- Part II. Generalized Inverse Shortest Path Problems.- Shortest Path Improvement Problems.- Shortest Path Interdiction Problems on Trees.- Sum of Root-leaf Distance Interdiction Problems on Trees.- Restricted Inverse Optimal Value Problem on Shortest Path under Weighted l1 Norm on Trees.- Part III. Generalized Inverse Spanning Tree Problems.- Inverse Minimum Spanning Tree Problems.- Inverse Max+Sum Spanning Tree Problems.- Restricted Inverse Optimal Value Problem on Minimum Spanning Tree.- Partial Inverse Minimum Spanning Tree Problems.- Part IV. Generalized Inverse Center Location Problems.- Inverse vertex obnoxious 1-center location problems.- Inverse Quickest 1-Center Location Problem on Trees.- References.

    More