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

DOI10.1016/j.cor.2005.10.016zbMath1141.90581OpenAlexW2167336209MaRDI QIDQ875426

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

integer linear programmingediting and imputationBenders' decomposition

Mathematics Subject Classification ID

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

Related Items (1)

A new approach for data editing and imputation

Cites Work

• Facets and lifting procedures for the set covering polytope
• Partitioning procedures for solving mixed-variables programming problems
• Discrete models for data imputation
• On solving the continuous data editing problem
• Optimal Imputation of Erroneous Data: Categorical Data, General Edits
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• A Mathematical Programming Approach to Editing of Continuous Survey Data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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