On solving the continuous data editing problem

DOI10.1016/0305-0548(96)81769-2zbMATH Open0855.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

zbMATH Keywords

data editing problem

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• A Mathematical Programming Approach to Editing of Continuous Survey Data
• 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

Cited In (5)

• 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
• Error correction for massive datasets
• Discrete models for data imputation
• Automatic Editing for Business Surveys: An Assessment of Selected Algorithms

This page was built for publication: On solving the continuous data editing problem

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