The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Visualization has proved an e ective tool in the understanding of large data sets in computational science and engineering. There is growing interest today in the development of p...
Ken Brodlie, A. Poon, Helen Wright, L. Brankin, G....
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...