scientific article; zbMATH DE number 4093169
zbMATH Open0667.90058MaRDI QIDQ3820366FDOQ3820366
Authors: I. V. Sergienko 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
stabilityconvex analysisdiscrete optimizationBenders decompositionapproximate solution methodsparametrized discrete optimization
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (25)
- The minimax problem solving of physical fields sources allocation in specified positions
- Title not available (Why is that?)
- Algorithms to construct a mathematical model of preferences using expert judgments
- Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
- Title not available (Why is that?)
- Optimal control of the immune response synchronizing the various regulatory compartments of the immune system. II. Identification of model parameters and missing data recovery
- Discrete optimization by optimal control methods. I: Separable problems
- Main directions in the development of informatics
- Stability of linear path problems in lexicographic optimization
- Finding the set of alternatives in discrete multicriterion problems
- Lexicographic optima in the multicriteria discrete optimization 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
- Disnel: An application package for solving discrete and nonlinear optimization problems
- Completeness of vector discrete optimization problems
- The formulation and solution of discrete optimisation models
- Optimization issues in structured-modular composition programming technology
- On the complexity of calculating sensitivity parameters in Boolean programming problems
- Models and methods of solution of quadratic integer programming problems
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- Topics of polyhedral combinatorics in transportation problems with exclusions
- Title not available (Why is that?)
- The use of classification theory for automated selection of algorithms in program packages
- Discrete optimization methods for multiprocessor computer systems
- Title not available (Why is that?)
- 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 Q3820366)
