Background: Bin packing is an Nphard optimization problem of packing items of given sizes into minimum number of capacitylimited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of...

Let be a hypergraph, has the Helly property if any intersecting family has a non-empty intersection. In this article we give a polynomial algorithm to recognize if any partial sub-hypergraph of a hypergraph has the Helly property

This Special Issues of the Business Systems Research Journal (SI of BSR), co-published by the Slovenian Society INFORMATIKA – Section of Operations Research (SSI-SOR), is focused on approaches which explore novel solutions or novel approaches in operations research, specifically in the area of...