Articoli correlati a A Group Theoretic Branch and Bound Algorithm: For the...
A Group Theoretic Branch and Bound Algorithm: For the Zero-One Integer Programming (Classic Reprint) - Brossura
Sinossi
Excerpt from A Group Theoretic Branch and Bound Algorithm: For the Zero-One Integer Programming
A more precise definition of an optimal correction is given ininduced correction and the resulting LP basic variables constitute a feasible solution to the integer programming problem, then this solution is optimalo Sufficient conditions can be given on when an unconstrained shortest route path can be guaranteed to produce a feasible and thus optimal integer solution.
As discussed in the class of problems for which the unconstrained shortest route solution will yield the optimal integer solution can be described qualitatively as steady - state If b is the vector of constants in the integer programming problem, steady state means that the optimal LP solution B-lb is sufficiently large in each component to remain non negative after the correction from the unconstrained shortest route or group problem is obtained.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
- EditoreForgotten Books
- Data di pubblicazione2018
- ISBN 10 1332262538
- ISBN 13 9781332262533
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine116
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 20,75
EUR 1,96 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per A Group Theoretic Branch and Bound Algorithm: For the...
Foto dell'editore
A Group Theoretic Branch and Bound Algorithm For the ZeroOne Integer Programming Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332262533
Quantità: 15 disponibili
Foto dell'editore
A Group Theoretic Branch and Bound Algorithm For the ZeroOne Integer Programming Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332262533
Quantità: 15 disponibili
Immagini fornite dal venditore
A Group Theoretic Branch and Bound Algorithm (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book presents a new algorithm for solving the zero-one integer programming problem, a problem that has been studied by mathematicians for decades. This problem has important applications in a variety of fields such as operations research, logistics, and finance. The author begins by reviewing the history and limitations of existing algorithms for solving this problem. He then introduces a new algorithm that is based on group theory and the concept of shortest paths in networks. The author provides a detailed explanation of the algorithm, along with examples to illustrate how it works. He also discusses the strengths and weaknesses of the algorithm, and he compares it with other existing algorithms. The book concludes with a discussion of the potential applications of the algorithm and its potential for future research. This book is a valuable resource for researchers and practitioners who are interested in solving zero-one integer programming problems. It provides a comprehensive overview of the state-of-the-art in this area, and it offers a new algorithm that has the potential to significantly improve the efficiency of solving these problems. 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. Codice articolo 9781332262533_0
Quantità: Più di 20 disponibili