Combinatorial optimization for undergraduates

From MaRDI portal





The author introduces the main concepts of combinatorial optimization, understood as discrete optimization in which problems have a finite number of feasible solutions, in the most elementary form, suitable as an undergraduate text. Practically no mathematical background is needed, which makes the text particularly suitable for being used in economics and the social sciences. The reviewer found the book pleasant to read and well fulfilling its purpose. Proofs are omitted but all methods are approached in a way that the reader can believe that it works. Exercises are provided ranging from very easy to challenging. Contents: Linear programming. Transportation problem. Assignment problem. Integer programming. Dynamic programming. Complexity. Heuristic problem solving. Optimization on graphs and networks. Minimal spanning tree. Shortest paths. Maximum flow. Minimum cost flow. Activity networks. Applications: Facilities layout. Traveling salesman. Vehicle scheduling. Car pooling.











This page was built for publication: Combinatorial optimization for undergraduates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706825)