The bandpass problem: combinatorial optimization and library of problems
Articles > Article · 2008
Authors: Djangir A. BABAYEV, George I. BELL, Urfat NURİYEV
Journal of Combinatorial Optimization, Journal Indexed in SCI Expanded, International, WoS, 2008, vol 18, pp 151-172
DOI: 10.1007/s10878-008-9143-3
Summary
A combinatorial optimization problem, called the Bandpass Problem, is introduced. Given a rectangular matrix A of binary elements {0,1} and a positive integer B called the Bandpass Number, a set of B consecutive non-zero elements in any column is called a Bandpass. No two bandpasses in the same column can have common rows.