scientific article; zbMATH DE number 7141408
From MaRDI portal
Publication:5203914
zbMath1427.90203MaRDI QIDQ5203914
Yury V. Nikulin, Vladimir A. Emelichev
Publication date: 9 December 2019
Full work available at URL: http://www.math.md/publications/basm/issues/y2018-n2/12756/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stability radiusBoolean programmingmulticriteria optimizationPareto setquadratic problemHölder's norms
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)
Related Items (1)
Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability radius of a vector investment problem with Savage's minimax risk criteria
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Nonlinear multiobjective optimization
- The maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- Quantitative stability analysis for vector problems of 0-1 programming
- Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems
- Stability of the bicriteria Boolean investment problem subject to extreme optimism and pessimism criteria
- On the stability measure of solutions to a vector version of an investment problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Quadratic knapsack problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Stability and Regularization of Vector Problems of Integer Linear Programming
- A Decomposition Method for Quadratic Zero-One Programming
- On stability of a vector Boolean investment problem with Wald’s criteria
- Multicriteria Optimization
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A branch and bound algorithm for the maximum clique problem
This page was built for publication:
