Journal ArticleDOI
SCIP: solving constraint integer programs
Reads0
Chats0
TLDR
An overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs is given and experimental results show that the approach outperforms current state-of-the-art techniques for proving the validity of properties on circuits containing arithmetic.Abstract:
Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code. This paper gives an overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs. To illustrate the performance and flexibility of SCIP, we apply it to two different problem classes. First, we consider mixed integer programming and show by computational experiments that SCIP is almost competitive to specialized commercial MIP solvers, even though SCIP supports the more general constraint integer programming paradigm. We develop new ingredients that improve current MIP solving technology. As a second application, we employ SCIP to solve chip design verification problems as they arise in the logic design of integrated circuits. This application goes far beyond traditional MIP solving, as it includes several highly non-linear constraints, which can be handled nicely within the constraint integer programming framework. We show anecdotally how the different solving techniques from MIP, CP, and SAT work together inside SCIP to deal with such constraint classes. Finally, experimental results show that our approach outperforms current state-of-the-art techniques for proving the validity of properties on circuits containing arithmetic.read more
Citations
More filters
Journal ArticleDOI
The MetaCyc database of metabolic pathways and enzymes and the BioCyc collection of pathway/genome databases
Ron Caspi,Richard Billington,Luciana Ferrer,Hartmut Foerster,Carol A. Fulcher,Ingrid M. Keseler,Anamika Kothari,Markus Krummenacker,Mario Latendresse,Lukas A. Mueller,Quang Ong,Suzanne M. Paley,Pallavi Subhraveti,Daniel Weaver,Peter D. Karp +14 more
TL;DR: The BioCyc PGDBs generated by SRI are offered for adoption by any interested party for the ongoing integration of metabolic and genome-related information about an organism.
Proceedings ArticleDOI
Open Set Domain Adaptation
Pau Panareda Busto,Juergen Gall +1 more
TL;DR: This work learns a mapping from the source to the target domain by jointly solving an assignment problem that labels those target instances that potentially belong to the categories of interest present in the source dataset.
Journal ArticleDOI
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
TL;DR: The purpose of this paper is to show how the extensible structure of ANTIGONE realizes the authors' previously-proposed mixed- integer quadratically-constrained quadratic program and mixed-integer signomial optimization computational frameworks.
Journal ArticleDOI
Scope for industrial applications of production scheduling models and solution methods
Iiro Harjunkoski,Christos T. Maravelias,Peter Bongers,Pedro M. Castro,Sebastian Engell,Ignacio E. Grossmann,John N. Hooker,Carlos A. Méndez,Guido Sand,John M. Wassick +9 more
TL;DR: The aim of the paper is to focus on the industrial aspects of scheduling and discuss the main characteristics, including strengths and weaknesses of the presented approaches, as well as some lessons learned from industry.
The SCIP Optimization Suite 7.0
Gerald Gamrath,Daniel Anderson,Ksenia Bestuzheva,Wei-Kun Chen,Leon Eifler,Maxime Gasse,Patrick Gemander,Ambros M. Gleixner,Leona Gottwald,Katrin Halbig,Gregor Hendel,Christopher Hojny,Thorsten Koch,Pierre Le Bodic,Stephen J. Maher,Frederic Matter,Matthias Miltenberger,Erik Muhmer,Benjamin Müller,Marc E. Pfetsch,Franziska Schlösser,Felipe Serrano,Yuji Shinano,Christine Maher Fouad Tawfik,Stefan Vigerske,Fabian Wegscheider,Dieter Weninger,Jakob Witzig +27 more
TL;DR: New features and enhanced algorithms made available in version 5.0 of the SCIP Optimization Suite, in particular for the LP solver SoPlex, the Steiner tree solver SCIP-Jack, the MISDP solverSCIP-SDP, and the parallelization framework UG are described.
References
More filters
Journal ArticleDOI
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Book
Linear Programming and Extensions
TL;DR: This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.
Journal ArticleDOI
Benchmarking optimization software with performance profiles
Elizabeth D. Dolan,Jorge J. Moré +1 more
TL;DR: It is shown that performance profiles combine the best features of other tools for performance evaluation to create a single tool for benchmarking and comparing optimization software.
Book ChapterDOI
An Extensible SAT-solver
Niklas Een,Niklas Sörensson +1 more
TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.