Title	Pseudo-Boolean Optimization
Creator	Le Berre, Daniel
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-28T17:44
Description	Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfaction problems. Because of the very efficient SAT solvers available, many of those optimization problems can be solved by reusing those solvers as black boxes. In this talk, we will provide some insights about the reason of the success of the black box approaches, some of their limitations, and raise open problems to design more efficient Boolean optimizers.
Extent	29.0
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Université d'Artois
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-31
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377705
URI	http://hdl.handle.net/2429/69367
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos