A Group Theoretic Branch and Bound Algorithm: For the Zero-One Integer Programming (Classic Reprint) - Hardcover

Jeremy F. Shapiro

9780260743633: A Group Theoretic Branch and Bound Algorithm: For the Zero-One Integer Programming (Classic Reprint)

Hardcover

ISBN 10: 0260743631 ISBN 13: 9780260743633

Publisher: Forgotten Books, 2020

View all copies of this ISBN edition

0 Used

2 New

From � 19.66

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.

"synopsis" may belong to another edition of this title.