Publication:3820366
From MaRDI portal
zbMath0667.90058MaRDI QIDQ3820366
Publication date: 1985
stability; discrete optimization; convex analysis; Benders decomposition; approximate solution methods; parametrized discrete optimization
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
90C27: Combinatorial optimization
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
On the complexity of calculating sensitivity parameters in Boolean programming problems, Optimal control of the immune response synchronizing the various regulatory compartments of the immune system. II. Identification of model parameters and missing data recovery, Stability of linear path problems in lexicographic optimization, Main directions in the development of informatics, Completeness of vector discrete optimization problems, 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, Lexicographic optima in the multicriteria discrete optimization problem, Optimization issues in structured-modular composition programming technology, Asymptotic optimality of a transport-problem plan constructed by the minimum-element method, Discrete optimization by optimal control methods. I: Separable problems, The minimax problem solving of physical fields sources allocation in specified positions, The use of classification theory for automated selection of algorithms in program packages, Discrete optimization methods for multiprocessor computer systems, Models and methods of solution of quadratic integer programming problems, Finding the set of alternatives in discrete multicriterion problems, Bounds on the minimum of convex functions on Euclidean combinatorial sets, Algorithms to construct a mathematical model of preferences using expert judgments, Topics of polyhedral combinatorics in transportation problems with exclusions
