Combinatorial optimization for undergraduates
combinatorial optimizationdiscrete optimizationfinite number of feasible solutionsundergraduate text
Trees (05C05) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Programming involving graphs or networks (90C35) Dynamic programming (90C39)
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.
- Genetic algorithm crossover operators for ordering applications
- scientific article; zbMATH DE number 4064777 (Why is no real title available?)
- Regular fuzzy equivalences on two-mode fuzzy networks
- Vehicle dispatching system based on Taguchi-tuned fuzzy rules
- Matching point features under small nonrigid motion
- Data compression using SVD and Fisher information for radar emitter location
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)