Linear And Combinatorial Optimization In Ordered Algebraic Structures

Linear and Combinatorial Optimization in Ordered Algebraic Structures

For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability. Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.

The conference on Ordered Algebraic Structures held in Curat;ao, from the 26th of June through the 30th of June, 1995, at the Avila Beach Hotel, marked the eighth year of ac tivities by the Caribbean Mathematics Foundation (abbr. CMF), which was the principal sponsor of this conference. CMF was inaugurated in 1988 with a conference on Ordered Algebraic Structures. During the years between these two conferences the field has changed sufficiently, both from my point of view and, I believe, that of my co-organizer, W. Charles Holland, to make one wonder about the label "Ordered Algebraic Structures" itself. We recognized this from the start, and right away this conference carried a subtitle, or, if one prefers, an agenda: we concentrated on the one hand, on traditional themes in the theory of ordered groups, including model-theoretic aspects, and, on the other hand, on matters in which topology (more precisely C(X)-style topology) and category theory would play a prominent role. Plainly, ordered algebra has many faces, and it is becoming increas ingly difficult to organize an intimate conference, such as the ones encouraged in the series sponsored by CMF, in this area on a broad set of themes. These proceedings reflect, accurately we think, the spirit of the conferees, but it is not a faithful record of the papers presented at the conference.

Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.

Orders: Description and Roles

Studies on Graphs and Discrete Programming