Using Simulated Annealing to Solve Controlled Rounding Problems

DOI10.1287/IJOC.2.2.174MaRDI QIDQ4029058zbMATH OpenOpenAlexFDO

Authors James Kelly, Bruce Golden, Arjang A. Assad

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2.2.174

zbMATH Keywords

algorithmbinary searchcontrolled roundinglinear programmingnumerical resultssimulated annealing

Mathematics Subject Classification ID

Roundoff error (65G50) Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• The controlled rounding problem: Complexity and computational experience
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• Controlled rounding for tables with subtotals
• A Constructive Procedure for Unbiased Controlled Rounding
• Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

Cited in

(10)

• Confidentiality control of tabulated data: Some practical network models
• The controlled rounding problem: Complexity and computational experience
• Simulated annealing: Practice versus theory
• A two-phased approach to the supply network reconfiguration problem
• Large-scale controlled rounding using tabu search with strategic oscillation
• Minimum-distance controlled perturbation methods for large-scale tabular data protection
• Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data
• Obtaining cell counts for contingency tables from rounded conditional frequencies
• Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
• Controlled rounding for tables with subtotals

This page was built for publication: Using Simulated Annealing to Solve Controlled Rounding Problems

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