We consider a wide class of quadratic optimization problems with integer and Boolean variables. In this paper, the lower and upper bounds on the strong stability radius of the set of extremum solutions are obtained in the situation where solution space and criterion space are endowed with various H{\"o}lder's norms
We consider optimization problems with some binary variables, where the objective function is linear...
We consider a vector Boolean programming problem with the linear-quadratic partial criteria. Formula...
AbstractLagrangian duality underlies many efficient algorithms for convex minimization problems. A k...
We consider a multicriteria problem of integer linear programming with a targeting set of optimal so...
We consider a multicriteria Boolean programming problem of finding the Pareto set. Partial criteria...
A multiobjective problem of integer linear programming with parametric optimality is addressed. The ...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
In 2013, Buchheim and Wiegele introduced a quadratic optimisation problem, in which the domain of ea...
In 2013, Buchheim and Wiegele introduced a quadratic optimisation problem, in which the domain of ea...
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of...
We consider optimization problems with some binary variables, where the objective function is linear...
This paper presents a canonical duality approach to solve an integer quadratic programming problem, ...
AbstractThis paper presents a method to estimate the bounds of the radius of the feasible space for ...
We consider optimization problems with some binary variables, where the objective function is linear...
We consider a vector Boolean programming problem with the linear-quadratic partial criteria. Formula...
AbstractLagrangian duality underlies many efficient algorithms for convex minimization problems. A k...
We consider a multicriteria problem of integer linear programming with a targeting set of optimal so...
We consider a multicriteria Boolean programming problem of finding the Pareto set. Partial criteria...
A multiobjective problem of integer linear programming with parametric optimality is addressed. The ...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
In 2013, Buchheim and Wiegele introduced a quadratic optimisation problem, in which the domain of ea...
In 2013, Buchheim and Wiegele introduced a quadratic optimisation problem, in which the domain of ea...
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of...
We consider optimization problems with some binary variables, where the objective function is linear...
This paper presents a canonical duality approach to solve an integer quadratic programming problem, ...
AbstractThis paper presents a method to estimate the bounds of the radius of the feasible space for ...
We consider optimization problems with some binary variables, where the objective function is linear...
We consider a vector Boolean programming problem with the linear-quadratic partial criteria. Formula...
AbstractLagrangian duality underlies many efficient algorithms for convex minimization problems. A k...