A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Current network flows heuristics for cell suppression in positive tables (i.e, cell values are greater or equal than zero) rely on the solution of several minimum-cost subproblems. A very efficient heuristic based on shortest-paths was also developed in the past, but it was only appropriate for general tables (i.e., cell values can be either positive or negative), whereas in practice most real tables are positive. The method presented in this work overcomes the lacks of previous approaches: itdoi:10.1007/978-3-540-25955-8_11 fatcat:xn7k6crhurdkvmsk7htcugrjr4