| ||||||||||||||||||||||||||||||||||||||||||||
[CDP10] On the use of graphs in discrete tomographyRevue Internationale avec comité de lecture : Journal Annals of Operations Research, vol. 175(1), pp. 287-307, 2010, (doi:10.1007/s10479-009-0649-6)
motcle:
Résumé:
This tutorial paper is a new version of a paper published in 4'OR in 2008. We consider the basic image reconstruction problem which
stems from discrete tomography. We derive a graph theoretical model and we explore
some variations and extensions of this model. This allows us to establish connections with
scheduling and timetabling applications. The complexity status of these problems is studied
and we exhibit some polynomially solvable cases. We show how various classical techniques
of operations research like matching, 2-SAT, network flows are applied to derive some of
these results.
Commentaires:
Version révisée d'un article publié dans
4'OR, A Quarterly J. of Operations Research, vol. 6(2), pp. 101-123, 2008
Equipe:
oc
Collaboration:
LAMSADE
BibTeX
|
||||||||||||||||||||||||||||||||||||||||||||