Optimal patchings for consecutive ones matrices-Reference-Cited by-同舟云学术

Optimal patchings for consecutive ones matrices

Published:2021-06-07 Issue: Volume: Page:
ISSN:1867-2949
Container-title:Mathematical Programming Computation
language:en
Short-container-title:Math. Prog. Comp.

Author:

Pfetsch Marc E.,Rinaldi Giovanni,Ventura Paolo

Abstract

AbstractWe study a variant of the weighted consecutive ones property problem. Here, a 0/1-matrix is given with a cost associated to each of its entries and one has to find a minimum cost set of zero entries to be turned to ones in order to make the matrix have the consecutive ones property for rows. We investigate polyhedral and combinatorial properties of the problem and we exploit them in a branch-and-cut algorithm. In particular, we devise preprocessing rules and investigate variants of “local cuts”. We test the resulting algorithm on a number of instances, and we report on these computational experiments.

Funder

Technische Universität Darmstadt

Publisher

Springer Science and Business Media LLC

Subject

Software,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s12532-021-00203-z.pdf

Reference33 articles.

1. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

2. Baptiste, P.: Simple MIP formulations to minimize the maximum number of open stacks. In: Smith, B.M., Gent, I.P. (eds.) Proceedings of IJCAI’05—Constraint Modelling Challenge 2005, pp. 9–13. Edimburgh (2005)

3. Bentley, J.: Programming Pearls. Addison-Wesley, Reading (1986)

4. Booth, K.S.: PQ-tree algorithms. Ph.D. thesis, University of California Berkeley (1975)

5. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)