scientific article; zbMATH DE number 3801290
From MaRDI portal
Publication:4745600
zbMATH Open0507.90050MaRDI QIDQ4745600FDOQ4745600
Authors: M. F. Kaspshitskaya, I. V. Sergienko 
Publication date: 1981
Title of this publication is not available (Why is that?)
combinatorial optimizationnumerical methodsdecomposition methodeffectivity of algorithmsprogram package organization
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)
Cited In (41)
- Standardization of the input data in classification problems using the descent vector method
- Optimization theory on antichains with the Steinitz exchange property
- Certain exact and approximate algorithms for solving precedence problems with constraints
- Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
- The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
- Using concepts of fuzzy mathematics for formalization and solution of combinatorial optimization problems
- Construction of a topological drawing of the most planar subgraph of the non-planar graph
- Main directions in the development of informatics
- Certain calculational aspects of the clusterization problem
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
- Solvable cases of a new combinatorial problem of optimization
- 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
- Some directions and results of research in mathematical programming and system analysis
- Direct cut-off method for combinatorial optimization problems with additional constraints
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
- Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
- Decomposition method of solving a class of combinatorial optimization problems
- A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
- Method of ordering the values of a linear function on a set of permutations
- New applications of partial orders
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- Gradient methods of maximization of convex functions on discrete structures
- Classification of applied methods of combinatorial optimization
- Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
- Interindustry model of planned technological-structural changes
- Approach to finding the optimal solution in the assignment problem
- Remarks on stability of solutions of the property domination problem
- Subclasses of solvable problems from classes of combinatorial optimization problems
- 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
- Convergence of a modified algorithm of fast probabilistic modeling
- Construction of Hamiltonian paths in graphs of permutation polyhedra
- Transportation problems on permutations: properties of estimates in the branch and bound method
- A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
- Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
- Problems of discrete optimization: challenges and main approaches to solve them
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 Q4745600)
