Abstract
We propose new formulations for the exact disclosure problem and develop Lagrangian schemes, that rely on shortest path problems, to generate near optimal solutions. Computational experience is reported for 550 tables with up to 40,000 cells. A proven optimal solution was obtained for 95% of the instances and a near optimal solution was computed for each remaining instance as well as an upper bound on the deviation from the optimum.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
