Stability and Regularization of Vector Problems of Integer Linear Programming

From MaRDI portal
Publication:4804984

DOI10.1080/0233193021000030760zbMath1109.90325OpenAlexW2062658196WikidataQ57594132 ScholiaQ57594132MaRDI QIDQ4804984

D. P. Podkopaev, Yury V. Nikulin, Eberhard Girlich, Vladimir A. Emelichev

Publication date: 8 May 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193021000030760




Related Items (48)

On one type of stability for multiobjective integer linear programming problem with parameterized optimalityMaximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstationsPostoptimal analysis of the multicriteria combinatorial median location problemProblems of discrete optimization: challenges and main approaches to solve themStability of a vector integer quadratic programming problem with respect to vector criterion and constraintsUnnamed ItemStability and accuracy functions in multicriteria linear combinatorial optimization problemsOn stability of a vector combinatorial problem with MINMIN criteriaUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemOn the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutionsUnnamed ItemMinimizing total weighted completion time with uncertain data: a stability approachStability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to ParetoOn five types of stability of the lexicographic variant of the combinatorial bottleneck problemRegularization of the vector problem with quadratic criteria of Pareto optimizationUnnamed ItemUnnamed ItemMeasure of stability for a finite cooperative game with a parametric optimality principle (from Pareto to Nash)Balancing of simple assembly lines under variations of task processing timesVyacheslav Tanaev: contributions to scheduling and related areasQuantitative stability analysis for vector problems of 0-1 programmingOn a measure of quasistability of a certain vector linearly combinatorial Boolean problemStability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteriaUnnamed ItemStability analysis of the Pareto optimal solutions for some vector boolean optimization problemPostoptimal analysis of a vector minimax combinatorial problemStability radius of a vector investment problem with Savage's minimax risk criteriaDifferent types of stability of vector integer optimization problem: General approachStability of a combinatorial vector partition problemcategory:Brief communicationsStability criterion for a lexicographic Boolean optimization problemBoolean problem of sequential minimization of moduli of linear functions and stability theoremsUnnamed ItemPostoptimal analysis of bicriteria Boolean problems of selecting investment projects with Wald's and Savage's criteriaStability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategiesA general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problemUnnamed ItemStability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutionsStability Aspects of Multicriteria Integer Linear Programming ProblemsParameter analysis of stability of the Pareto front for optimal conditions of catalytic processesPerturbed cones for analysis of uncertain multi-criteria optimization problemsOn the regularization of vector integer quadratic programming problemsInvestment Boolean problem with savage risk criteria under uncertaintyStability radius of a lexicographic optimum of a vector problem of Boolean programming




This page was built for publication: Stability and Regularization of Vector Problems of Integer Linear Programming