On solving the continuous data editing problem
From MaRDI portal
Publication:1919203
DOI10.1016/0305-0548(96)81769-2zbMath0855.90080OpenAlexW2021971311MaRDI QIDQ1919203
Cliff T. Ragsdale, Patrick G. McKeown
Publication date: 3 February 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(96)81769-2
Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Information storage and retrieval of data (68P20)
Related Items
Discrete models for data imputation ⋮ Error correction for massive datasets ⋮ A heuristic approach for the continuous error localization problem in data cleaning ⋮ A branch-and-cut algorithm for the continuous error localization problem in data cleaning ⋮ Automatic Editing for Business Surveys: An Assessment of Selected Algorithms
Cites Work
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- AXIS: A framework for interactively combining structured algorithms and knowledge based systems
- Error Localization for Erroneous Data: Continuous Data, Linear Constraints
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Mathematical Programming Approach to Editing of Continuous Survey Data
- Unnamed Item