Add to ORKGSIGLEAvailable from TIB Hannover: RR 4487(2002,27) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...
textabstractThe main objective of this paper is to stimulate interest in stability analysis for sche...
This paper presents a readily computable formula for the real stability radius with respect to an ar...
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
ABSTRACT. The notion of the set of stability of a locally optimal solution is introduced for Boolean...
We consider a multicriteria Boolean programming problem of finding the Pareto set. Partial criteria...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--213) / BLDSC - Briti...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider a wide class of quadratic optimization problems with integer and Boolean variables. In t...
Recently, Qiu et al. obtained a computationally attractive formula for the computation of the real s...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider optimization problems with some binary variables, where the objective function is linear...
This paper is devoted to the calculation of the stability radius of an optimal schedule for a genera...
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...
textabstractThe main objective of this paper is to stimulate interest in stability analysis for sche...
This paper presents a readily computable formula for the real stability radius with respect to an ar...
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
ABSTRACT. The notion of the set of stability of a locally optimal solution is introduced for Boolean...
We consider a multicriteria Boolean programming problem of finding the Pareto set. Partial criteria...
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linea...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--213) / BLDSC - Briti...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider a wide class of quadratic optimization problems with integer and Boolean variables. In t...
Recently, Qiu et al. obtained a computationally attractive formula for the computation of the real s...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider optimization problems with some binary variables, where the objective function is linear...
This paper is devoted to the calculation of the stability radius of an optimal schedule for a genera...
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...
textabstractThe main objective of this paper is to stimulate interest in stability analysis for sche...
This paper presents a readily computable formula for the real stability radius with respect to an ar...