On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function

DOI10.1023/A:1018991826728zbMATH Open0918.90121OpenAlexW286879630MaRDI QIDQ1290128FDOQ1290128

Marek Libura

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018991826728

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Cited In (9)

• A note on robustness tolerances for combinatorial optimization problems
• Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
• Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
• Title not available (Why is that?)
• Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto
• Balancing of simple assembly lines under variations of task processing times
• Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies
• Optimal makespan scheduling with given bounds of processing times
• Stability and accuracy functions in multicriteria linear combinatorial optimization problems

   Recommendations

• On the accuracy function and the accuracy radius for combinatorial optimization problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290128)