On the complexity of postoptimality analysis of \(0/1\) programs
From MaRDI portal
Publication:1283802
DOI10.1016/S0166-218X(98)00151-6zbMath0917.90250MaRDI QIDQ1283802
Albert P. M. Wagelmans, Stan P. M. van Hoesel
Publication date: 5 August 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Related Items
On one type of stability for multiobjective integer linear programming problem with parameterized optimality ⋮ Postoptimal analysis of the multicriteria combinatorial median location problem ⋮ Approximating the stability region for binary mixed-integer programs ⋮ Stability and accuracy functions in multicriteria linear combinatorial optimization problems ⋮ Integer Programming: Optimization and Evaluation Are Equivalent ⋮ A general approach to the calculation of stability radii for the max-cut problem with multiple criteria ⋮ Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria ⋮ Unnamed Item ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Compact representation of near-optimal integer programming solutions ⋮ On the complexity of calculating sensitivity parameters in Boolean programming problems ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ Reoptimization of the shortest common superstring problem ⋮ Quantitative stability analysis for vector problems of 0-1 programming ⋮ General approach to estimating the complexity of postoptimality analysis for discrete optimization problems ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function ⋮ Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem ⋮ Sensitivity analysis of the knapsack problem: a negative result ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization ⋮ Sensitivity analysis in the single-machine scheduling problem with max-min criterion ⋮ Reoptimization of the metric deadline TSP ⋮ A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem ⋮ Reoptimization of the Metric Deadline TSP ⋮ Unnamed Item ⋮ On the Hardness of Reoptimization ⋮ Approximation hardness of deadline-TSP reoptimization ⋮ Reoptimization of the Shortest Common Superstring Problem ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A note on robustness tolerances for combinatorial optimization problems ⋮ Investment Boolean problem with savage risk criteria under uncertainty ⋮ Calculation of stability radii for combinatorial optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the calculation of the stability radius of an optimal or an approximate schedule
- Solving the \(k\)-best traveling salesman problem
- Calculation of stability radii for combinatorial optimization problems
- The stability of the approximate Boolean minimization of a linear form
- Some concepts of stability analysis in combinatorial optimization
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- Optimal schedules with infinitely large stability radius∗
