Minimising the number of gap-zeros in binary matrices

DOI10.1016/J.EJOR.2013.01.028zbMATH Open1317.90252DBLPjournals/eor/ChakhlevitchGS13OpenAlexW2064013224WikidataQ59901011 ScholiaQ59901011MaRDI QIDQ2355802FDOQ2355802

Authors: Konstantin Chakhlevitch, C. A. Glass, N. V. Shakhlevich 

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/79240/1/ChakhlevitchGlassShakhlevich.pdf

Recommendations

• Heuristic methods to consecutive block minimization
• Approximation of the Consecutive Ones Matrix Augmentation Problem
• Polynomial-time local-improvement algorithm for consecutive block minimization
• Iterated local search for consecutive block minimization
• Optimal patchings for consecutive ones matrices

zbMATH Keywords

heuristicscombinatorial optimisationschedulingconsecutive ones propertybinary matrices

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Title not available (Why is that?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Title not available (Why is that?)
• File organization
• A Simple Test for the Consecutive Ones Property
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Title not available (Why is that?)
• Set covering with almost consecutive ones property
• A note on the consecutive ones submatrix problem.
• Batch machine production with perishability time windows and limited batch size
• Polynomial Complete Consecutive Information Retrieval Problems
• The consecutive ones submatrix problem for sparse matrices
• On Physical Mapping and the consecutive ones property for sparse matrices
• The weighted consecutive ones problem for a fixed number of rows or columns.
• Approximation of the Consecutive Ones Matrix Augmentation Problem
• Physical mapping of chromosomes: A combinatorial problem in molecular biology
• Title not available (Why is that?)

Cited In (5)

• The maximum matrix contraction problem
• Heuristic methods to consecutive block minimization
• Iterated local search for consecutive block minimization
• Eliminating switching components in binary matrices by 0-1 flips and column permutations
• Title not available (Why is that?)

This page was built for publication: Minimising the number of gap-zeros in binary matrices

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