Pages that link to "Item:Q1805456"

The following pages link to Some concepts of stability analysis in combinatorial optimization (Q1805456):

Displaying 44 items.

• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
• Post-optimality approach to prevent cycling in linear MPC target calculation (Q389830) (← links)
• Postoptimal analysis of a vector minimax combinatorial problem (Q464908) (← links)
• Stability radius of a vector investment problem with Savage's minimax risk criteria (Q466377) (← links)
• A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
• Investment Boolean problem with savage risk criteria under uncertainty (Q783113) (← links)
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
• Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
• On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
• Stability analysis in discrete optimization involving generalized addition operations (Q896189) (← links)
• Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
• On the quasistability of trajectory problems of vector optimization (Q1272027) (← links)
• On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802) (← links)
• Calculation of stability radii for combinatorial optimization problems (Q1306464) (← links)
• Stability of a schedule minimizing mean flow time (Q1362250) (← links)
• Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
• Extending single tolerances to set tolerances (Q1671336) (← links)
• Quantitative stability analysis for vector problems of 0-1 programming (Q1952505) (← links)
• On a measure of quasistability of a certain vector linearly combinatorial Boolean problem (Q1956611) (← links)
• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000) (← links)
• A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
• Reoptimization of the metric deadline TSP (Q2266941) (← links)
• Stability and accuracy functions in multicriteria linear combinatorial optimization problems (Q2379875) (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
• Boolean problem of sequential minimization of moduli of linear functions and stability theorems (Q2480521) (← links)
• Stability radius of a lexicographic optimum of a vector problem of Boolean programming (Q2577237) (← links)
• Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
• Sensitivity analysis in the single-machine scheduling problem with max-min criterion (Q3025043) (← links)
• Postoptimal analysis of the multicriteria combinatorial median location problem (Q3165918) (← links)
• On stability of a vector combinatorial problem with MINMIN criteria (Q3184568) (← links)
• Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry (Q3186829) (← links)
• On five types of stability of the lexicographic variant of the combinatorial bottleneck problem (Q3225880) (← links)
• Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem (Q3534643) (← links)
• Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
• (Q4961725) (← links)
• (Q5228452) (← links)
• (Q5228568) (← links)
• (Q5228665) (← links)
• A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem (Q5439058) (← links)
• On the Hardness of Reoptimization (Q5448637) (← links)
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
• (Q5869347) (← links)
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis (Q6110625) (← links)