A branch-and-cut algorithm for the continuous error localization problem in data cleaning

DOI10.1016/J.COR.2005.10.016MaRDI QIDQ875426zbMATH OpenOpenAlexFDO

Authors Jorge Riera-Ledesma, Juan-José Salazar-González

Publication date 13 April 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.10.016

zbMATH Keywords

Benders' decompositionediting and imputationinteger linear programming

Mathematics Subject Classification ID

Theory of data (68P99) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A heuristic approach for the continuous error localization problem in data cleaning
• Automatic error localisation for categorical, continuous and integer data
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• Automatic Editing for Business Surveys: An Assessment of Selected Algorithms
• On solving the continuous data editing problem

Cites work

• A Mathematical Programming Approach to Editing of Continuous Survey Data
• Discrete models for data imputation
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• Facets and lifting procedures for the set covering polytope
• scientific article; zbMATH DE number 4062554 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1175944 (Why is no real title available?)
• On solving the continuous data editing problem
• Optimal Imputation of Erroneous Data: Categorical Data, General Edits
• Partitioning procedures for solving mixed-variables programming problems

Cited in

(5)

• Automatic error localisation for categorical, continuous and integer data
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency
• A heuristic approach for the continuous error localization problem in data cleaning
• A new approach for data editing and imputation

This page was built for publication: A branch-and-cut algorithm for the continuous error localization problem in data cleaning

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