Linear integer programming. Theory, applications, recent developments (Q2043592)

This book considers several advanced problems that are modeled using linear integer programming. Each chapter examines a different problem and includes the problem description, the mathematical formulation and a description of the algorithm including a solved example where applicable. The first chapter considers the segment search method for the general linear integer program. This is followed by a study of the generalized assignment problem and general geometric polyhedron search algorithms. The fourth chapter considers the knapsack problem and its variants before moving on to study ill conditioned integer programming problems. The sixth chapter studies the random search method for solving mixed integer programs while the seventh chapter considers a number of applications of mixed integer programs such as assignment problems, transportation and network problems and related models. The last chapter of this very interesting book looks at the traveling salesman problem and methods for its efficient solution.