scientific article; zbMATH DE number 1544632

MaRDI QIDQ4520904zbMATH OpenFDO

Authors V. R. Khachaturov, V. E. Veselovskij, A. V. Èlotov, S. U. Kaldybaev, E. Zh. Kaliev, A. G. Kovalenko, V. M. Montlevich, I. Kh. Sigal, Roman V. Khachaturov

Publication date 18 December 2000

zbMATH Keywords

discrete optimizationdynamic allocationlarge traveling salesman problemray methodstatic allocationsupermodularity of objective functiontransportation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Review text

The book is devoted to methods for solving large combinatorial problems and their algorithmic realization. The material of the book is divided into 14 chapters, in which special classes of combinatorial problems are investigated. In Chapters 2 and 3, the authors describe methods for solving both static and dynamic allocation problems Chapters 4-6 contain procedures, which are appropriate for reducing the dimensionality of the allocation problems. The supermodularity of the objective function is proved. Some models and methods for solving various kinds of dynamic allocation problems are suggested. Chapter 7 and 8 deals with problems on the so called tree-like jet-works with disconnected cost functions and optimization of multistep processes on oriented trees. Chapter 9 is devoted to solution methods for distributive problems with Boolean variables. Transportation and allocation problems with indivisible customers are considered in Chapters 10 and Chapter 11 contains some special allocation problems. Further, in Chapter 12, the authors investigate maximization problems with supermodular objective function and show how some problems concerning the regional interaction can be ruduced to these maximization problems. A variant of the approximative-combinatorial method is suggested as a solution method for this class of optimization problems. Chapter 13 is devoted to methods, which are appropriate for solving large travelling salesman problems. In the concluding Chapter 14, so called ray-method and its application to solving integer problems are described. The explanation contains beside theoretical results also a lot of valuable information about computational experience. The text of the book is provided with a short summary and content in English.

Recommendations

• scientific article; zbMATH DE number 3847211
• Kombinatorische Optimierung
• scientific article; zbMATH DE number 863497
• scientific article; zbMATH DE number 4093169
• scientific article; zbMATH DE number 203962

Cited in

(5)

• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• Models and methods for solving the problem of network vulnerability
• Basic properties of lattices of cubes, algorithms for their construction, and application capabilities in discrete optimization.
• scientific article; zbMATH DE number 5503918 (Why is no real title available?)
• Multiobjective optimization in a pseudometric objective space as applied to a general model of business activities

This page was built for publication:

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