TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 17.01.2013

isti-logo

Page Content

to Navigation

On Polynomial Kernels for Sparse Integer Linear Programs

Dr. Stefan Kratsch (TU Berlin)

The talk will cover some recent results on preprocessing for sparse Integer Linear Programs. This is motivated by the high relevance of preprocessing for ILP-solvers like CPLEX contrasted with the little existing theoretical knowledge regarding provable upper and lower bounds.

Date
Speaker
Location
Language
17.01.2013 16:00
Stefan Kratsch
TEL 512
german/english

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe