The controlled rounding problem: Relaxations and complexity issues

DOI10.1007/BF01719708zbMath0800.90784MaRDI QIDQ1813913

James P. Kelly, Bruce L. Golden, Arjang A. Assad

Publication date: 25 June 1992

Published in: OR Spektrum (Search for Journal in Brave)

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Abstract computational complexity for mathematical programming problems (90C60) Mathematical programming (90C99)

Related Items (3)

Large-scale controlled rounding using tabu search with strategic oscillation ⋮ The controlled rounding problem: Complexity and computational experience ⋮ Minimum-distance controlled perturbation methods for large-scale tabular data protection

Cites Work

• Unnamed Item
• The edge-coloring of complete hypergraphs. I
• A Constructive Procedure for Unbiased Controlled Rounding
• Controlled Rounding

This page was built for publication: The controlled rounding problem: Relaxations and complexity issues