- Published 1987 in Computers & OR
DOI:10.1016/0305-0548(87)90009-8

In Bodin [l], an approach was given for stratifying ordered data containing N strata into a fewer number of strata (say K strata). This approach was to transform the problem to a directed acyclic network containing N + 1 nodes and to solve for the shortest path containing exactly K arcs in this directed acyclic network. The cost of an arc from node i to… CONTINUE READING

### Presentations referencing similar topics