The Swath Segment Selection Problem (SSSP)

This page collects benchmark instances and best known results.

The problem

A set of shards (i,j) is given, with a reward function r(i,j), an ascending memory consumption, a descending memory consumption and a capacity function.

Find a subset of shards S of maximum reward such that

Test instances

Test set employed in R. Cordone, F. Gandellini and G. Righini, Solving the swath segment selection problem through Lagrangean relaxation. Computers and Operations Research, 35:854-862, 2008.

• small instances (from 10 to 100 rows and columns)
• large instances (from 200 to 500 rows and columns)

Pagina aggiornata il