Campus Event Calendar
Event Entry
What and Who
A Branch&Cut Algorithm using BDDs
Markus Behle
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 18 November 2004
13:00
-- Not specified --
45
016
Saarbrücken
Abstract
Given a mixed 0/1 integer program we want to decide whether it is feasible
or not. A first step to reach this goal is to decide feasibility for 0/1
integer programs. In this talk we compare SAT with ILP and try to learn
from SAT techniques. In addition to that we show how to use BDDs to
generate new types of cutting planes.
Computational results show that this is a promissing combination.
or not. A first step to reach this goal is to decide feasibility for 0/1
integer programs. In this talk we compare SAT with ILP and try to learn
from SAT techniques. In addition to that we show how to use BDDs to
generate new types of cutting planes.
Computational results show that this is a promissing combination.
Contact
--email hidden
passcode not visible
logged in users only
Bahareh Kadkhodazadeh, 11/15/2004 10:18
Bahareh Kadkhodazadeh, 10/14/2004 12:06 -- Created document.
Bahareh Kadkhodazadeh, 10/14/2004 12:06 -- Created document.