We tackle a combinatorial problem that consists of finding the optimal configuration of a
binary matrix. The configuration is determined by the ordering of the rows in the matrix and …

The complexity of the Bandpass problem is re-investigated. Specifically, we show that the
problem with any fixed bandpass number B≥ 2 is NP-hard. Next, a row stacking algorithm is …

The Band Collocation Problem appears in the context of problems for optimizing
telecommunication networks with the aim of solving some concerns related to the original …

Abstract The bandpass-2 problem (Bandpass-2, for short) is a generalization of the
maximum traveling salesman problem (Max TSP, for short). Of particular interest is the …

A new combinatorial optimization problem, the Bandpass problem, was defined in Bell and
Babayev (2004)[4]. Recently, this problem was investigated in detail in Babayev et …

The general Bandpass problem is NP-hard and was claimed to be NP-hard when the
number of columns is three. Previously we designed a polynomial time row-stacking …

In this paper we present a heuristic algorithm for the The Band Collocation Problem (BCP)
which may have some applications in the field of telecommunication. First, we give the …

In this paper, we consider a new recent combinatorial optimization problem called The Band
Collocation Problem (BCP) which has a potential application in telecommunication …

In order to reduce costs in the telecommunication sector, many mathematical models have
been developed. Over time, these models either fall out out of use or are revised according …

The Bandpass problem has applications to provide a cost reduction in design and operating
telecommunication network. Given a binary matrix Am× n and a positive integer B called the …