EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
90-XX Operations research, mathematical programming
90Cxx Mathematical programming
90C60 Abstract computational complexity for mathematical programming problems

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 3 of 3

Parametric integer programming

Paul Feautrier (1988)

RAIRO - Operations Research - Recherche Opérationnelle

Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times

Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)

RAIRO - Operations Research - Recherche Opérationnelle

Polynomially solvable traveling salesman problems

R. H. Warren (1991)

Applicationes Mathematicae

Currently displaying 1 – 3 of 3

Page 1