EUR 1,09 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9780365653820
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9780365653820
Quantité disponible : 15 disponible(s)
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book explores a novel approach to solving integer programming problems, a type of optimization problem that arises in many real-world applications. The author introduces a group-theoretic reformulation of integer programming, providing a new perspective on these complex problems. By constructing a Lagrangian problem, the author demonstrates how to find optimal or near-optimal solutions to integer programming problems, offering a valuable tool for researchers and practitioners alike. The book delves into the theoretical underpinnings of the approach, discussing necessary and sufficient conditions for optimality and exploring the relationship between the Lagrangian method and existing cutting-plane techniques. Through numerical examples, the author illustrates the practical application of the proposed methods. The book's insights advance the field of integer programming, providing a deeper understanding of these problems and opening up new avenues for further research. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9780365653820_0
Quantité disponible : Plus de 20 disponibles