Pages that link to "Item:Q1283802"
From MaRDI portal
The following pages link to On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802):
Displayed 23 items.
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Sensitivity analysis of the knapsack problem: a negative result (Q465932) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- On the complexity of calculating sensitivity parameters in Boolean programming problems (Q904419) (← links)
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- Calculation of stability radii for combinatorial optimization problems (Q1306464) (← links)
- Quantitative stability analysis for vector problems of 0-1 programming (Q1952505) (← links)
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems (Q2379875) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← 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)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- A general approach to the calculation of stability radii for the max-cut problem with multiple criteria (Q3186842) (← links)
- Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem (Q3534643) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← 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)