On the complexity of postoptimality analysis of 0/1 programs
From MaRDI portal
On the complexity of postoptimality analysis of \(0/1\) programs
Recommendations
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- Post-optimal analysis of linear semi-infinite programs
- Postoptimal Analysis in Nonserial Dynamic Programming
- On complexity of unconstrained hyperbolic 0--1 programming problems
- scientific article; zbMATH DE number 1747699
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- On the complexity of semidefinite programs
Cites work
- scientific article; zbMATH DE number 3858850 (Why is no real title available?)
- scientific article; zbMATH DE number 3926663 (Why is no real title available?)
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- Calculation of stability radii for combinatorial optimization problems
- On the calculation of the stability radius of an optimal or an approximate schedule
- Optimal schedules with infinitely large stability radius∗
- Solving the k-best traveling salesman problem
- Some concepts of stability analysis in combinatorial optimization
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- The stability of the approximate Boolean minimization of a linear form
Cited in
(41)- Reoptimization of the shortest common superstring problem
- On one type of stability for multiobjective integer linear programming problem with parameterized optimality
- Assessing the effect of multiple cost changes using reverse set tolerances
- A note on robustness tolerances for combinatorial optimization problems
- Approximating the stability region for binary mixed-integer programs
- Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
- On radius of one stability type for a multicriteria investment problem with risk minimization
- Strong stability for multiobjective investment problem with perturbed minimax risks of different types and parameterized optimality
- Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
- On the relative complexity of 15 problems related to~0/1-integer programming
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- Compact representation of near-optimal integer programming solutions
- Tolerance analysis for 0-1 knapsack problems
- Quantitative stability analysis for vector problems of 0-1 programming
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
- A general approach to the calculation of stability radii for the max-cut problem with multiple criteria
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- Three methods for postoptimal analysis in integer linear programming
- Sensitivity analysis of the knapsack problem: a negative result
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
- Analysis-aware defeaturing: Problem setting and a posteriori estimation
- On the complexity of calculating sensitivity parameters in Boolean programming problems
- On the Hardness of Reoptimization
- Calculation of stability radii for combinatorial optimization problems
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- Investment Boolean problem with savage risk criteria under uncertainty
- Approximation hardness of deadline-TSP reoptimization
- Integer Programming: Optimization and Evaluation Are Equivalent
- Postoptimal analysis of the multicriteria combinatorial median location problem
- Postoptimal Analysis in Nonserial Dynamic Programming
- Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study
- Reoptimization of the Metric Deadline TSP
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of the metric deadline TSP
- Knowing all optimal solutions does not help for TSP reoptimization
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems
- Sensitivity analysis in the single-machine scheduling problem with max-min criterion
This page was built for publication: On the complexity of postoptimality analysis of \(0/1\) programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283802)
