The book presents a unified treatment of decision analysis, location theory and scheduling, with topics ranging from multicriteria decision-making, multiattribute utility theory, classical decision analysis and game theory, to location and layout planning, and to project and machine scheduling. While the emphasis of the book is on models and applications, the most important methods and algorithms, exact as well as heuristic, are described in detail and illustrated by numerical examples. The formulations and the discussion of a large variety of models provide insight into their structures,...
The book presents a unified treatment of decision analysis, location theory and scheduling, with topics ranging from multicriteria decision-making,...
The book presents a unified treatment of integer programming and network models with topics ranging from exact and heuristic algorithms to network flows, traveling salesman tours, and traffic assignment problems. While the emphasis of the book is on models and applications, the most important methods and algorithms are described in detail and illustrated by numerical examples. The formulations and the discussion of a large variety of models provides insight into their structures that allows the user to better evaluate the solutions to the problems.
The book presents a unified treatment of integer programming and network models with topics ranging from exact and heuristic algorithms to network flo...
Based on earlier work by a variety of authors in the 1930s and 1940s, the simplex method for solving linear programming problems was developed in 1947 by the American mathematician George B. Dantzig. Helped by the computer revolution, it has been described by some as the overwhelmingly most significant mathematical development of the last century. Owing to the simplex method, linear programming (or linear optimization, as some would have it) is pervasive in modern society for the planning and control of activities that are constrained by the availability of resources such as manpower, raw...
Based on earlier work by a variety of authors in the 1930s and 1940s, the simplex method for solving linear programming problems was developed in 1947...
This conference volume is a collection of over thirty refereed contributions in the areas of optimization and control. The volume is organized into the following sections: Mathematics of Operations Research and Global Optimization Linear and Combinatorial Programming Tours, Locations and Scheduling Dynamic Programming and Game Theory Control Theory Economic Models. There is a balance between papers dealing with theoretical aspects of the field and those discussing the respective areas of application.
This conference volume is a collection of over thirty refereed contributions in the areas of optimization and control. The volume is organized into th...
