By Rainer Burkard, Mauro Dell'Amico, Silvano Martello

ISBN-10: 0898716632

ISBN-13: 9780898716634

This publication presents a entire therapy of project difficulties from their conceptual beginnings within the Twenties via present-day theoretical, algorithmic, and sensible advancements. The authors have geared up the booklet into 10 self-contained chapters to make it effortless for readers to exploit the explicit chapters of curiosity to them with no need to learn the e-book linearly. the subjects lined comprise bipartite matching algorithms, linear project difficulties, quadratic project difficulties, multi-index task difficulties, and plenty of adaptations of those difficulties. workouts within the kind of numerical examples offer readers with a mode of self-study or scholars with homework difficulties, and an linked web site bargains applets that readers can use to execute many of the easy algorithms in addition to hyperlinks to computing device codes which are on hand on-line. viewers: project difficulties is an invaluable device for researchers, practitioners, and graduate scholars. Researchers will enjoy the designated exposition of thought and algorithms with regards to task difficulties, together with the elemental linear sum task challenge and its many diversifications. Practitioners will know about useful functions of the tools, the functionality of actual and heuristic algorithms, and software program suggestions. This booklet can even function a textual content for complex classes in discrete arithmetic, integer programming, combinatorial optimization, and algorithmic computing device technology. Contents: Preface; bankruptcy 1: advent; bankruptcy 2: Theoretical Foundations; bankruptcy three: Bipartite Matching Algorithms; bankruptcy four: Linear Sum project challenge; bankruptcy five: extra effects at the Linear Sum project challenge; bankruptcy 6: different varieties of Linear task difficulties; bankruptcy 7: Quadratic project difficulties: Formulations and limits; bankruptcy eight: Quadratic project difficulties: Algorithms; bankruptcy nine: different varieties of Quadratic project difficulties; bankruptcy 10: Multi-index task difficulties; Bibliography; writer Index; topic Index