scientific article; zbMATH DE number 3801290
From MaRDI portal
Publication:4745600
zbMath0507.90050MaRDI QIDQ4745600
M. F. Kaspshitskaya, Ivan V. Sergienko
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decomposition methodnumerical methodscombinatorial optimizationeffectivity of algorithmsprogram package organization
Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Problems of discrete optimization: challenges and main approaches to solve them ⋮ New applications of partial orders ⋮ Optimization theory on antichains with the Steinitz exchange property ⋮ Classification of applied methods of combinatorial optimization ⋮ A modification of the method of combinatorial truncation in optimization problems over vertex-located sets ⋮ Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty ⋮ Approach to finding the optimal solution in the assignment problem ⋮ Optimal control of the immune response synchronizing the various regulatory compartments of the immune system. I: Mathematical analysis of the risk of pathological disorders in the organism ⋮ Using concepts of fuzzy mathematics for formalization and solution of combinatorial optimization problems ⋮ Gradient methods of maximization of convex functions on discrete structures ⋮ Some directions and results of research in mathematical programming and system analysis ⋮ Certain exact and approximate algorithms for solving precedence problems with constraints ⋮ Construction of Hamiltonian paths in graphs of permutation polyhedra ⋮ Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations ⋮ Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives ⋮ Direct cut-off method for combinatorial optimization problems with additional constraints ⋮ Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements ⋮ Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method ⋮ Standardization of the input data in classification problems using the descent vector method ⋮ A procedure for solution of the problem of optimal covering of a finite set ⋮ Ordering a set of values of an objective-function argument in combinatorial optimization ⋮ Solvable cases of a new combinatorial problem of optimization ⋮ Convergence of a modified algorithm of fast probabilistic modeling ⋮ An approach to solving discrete vector optimization problems over a combinatorial set of permutations ⋮ Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements ⋮ Transportation problems on permutations: properties of estimates in the branch and bound method ⋮ Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations ⋮ Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements ⋮ Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method ⋮ The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations ⋮ Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations ⋮ Decomposition method of solving a class of combinatorial optimization problems ⋮ Certain calculational aspects of the clusterization problem ⋮ Construction of a topological drawing of the most planar subgraph of the non-planar graph ⋮ Main directions in the development of informatics ⋮ Remarks on stability of solutions of the property domination problem ⋮ Interindustry model of planned technological-structural changes ⋮ Method of ordering the values of a linear function on a set of permutations ⋮ Subclasses of solvable problems from classes of combinatorial optimization problems ⋮ A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements ⋮ A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
