On the complexity of postoptimality analysis of 0/1 programs
From MaRDI portal
Publication:1283802
DOI10.1016/S0166-218X(98)00151-6zbMATH Open0917.90250MaRDI QIDQ1283802FDOQ1283802
Albert P. M. Wagelmans, Stan Van Hoesel
Publication date: 5 August 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Cites Work
- Some concepts of stability analysis in combinatorial optimization
- On the calculation of the stability radius of an optimal or an approximate schedule
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the \(k\)-best traveling salesman problem
- Title not available (Why is that?)
- Calculation of stability radii for combinatorial optimization problems
- The stability of the approximate Boolean minimization of a linear form
- Optimal schedules with infinitely large stability radius∗
- Title not available (Why is that?)
Cited In (35)
- Assessing the effect of multiple cost changes using reverse set tolerances
- On one type of stability for multiobjective integer linear programming problem with parameterized optimality
- Reoptimization of the shortest common superstring problem
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
- A note on robustness tolerances for combinatorial optimization problems
- Approximating the stability region for binary mixed-integer programs
- Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
- 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
- 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
- Three methods for postoptimal analysis in integer linear programming
- Sensitivity analysis of the knapsack problem: a negative result
- Analysis-aware defeaturing: Problem setting and a posteriori estimation
- On the Hardness of Reoptimization
- On the complexity of calculating sensitivity parameters in Boolean programming problems
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Investment Boolean problem with savage risk criteria under uncertainty
- Integer Programming: Optimization and Evaluation Are Equivalent
- Approximation hardness of deadline-TSP reoptimization
- Postoptimal analysis of the multicriteria combinatorial median location problem
- 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
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Reoptimization of the metric deadline TSP
- 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)
