Results 1 
5 of
5
SCIP: solving constraint integer programs
, 2009
"... 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), wh ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
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 noncommercial 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 nonlinear 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 stateoftheart techniques for proving the validity of properties on circuits containing arithmetic.
Constraint Integer Programming: a New Approach to integrate CP and MIP
, 2008
"... This article introduces constraint integer programming (CIP), which is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. CIP is a generalization of MIP that supports the notion of general constraints as in CP. This approach is supported by the CIP ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
This article introduces constraint integer programming (CIP), which is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. CIP is a generalization of MIP that supports the notion of general constraints as in CP. This approach is supported by the CIP framework SCIP, which also integrates techniques from SAT solving. SCIP is available in source code and free for noncommercial use. We demonstrate the usefulness of CIP on two tasks. First, we apply the constraint integer programming approach to pure mixed integer programs. Computational experiments show that SCIP is almost competitive to current stateoftheart commercial MIP solvers. Second, we employ the CIP framework to solve chip design verification problems, which involve some highly nonlinear constraint types that are very hard to handle by pure MIP solvers. The CIP approach is very effective here: it can apply the full sophisticated MIP machinery to the linear part of the problem, while dealing with the nonlinear constraints by employing constraint programming techniques.
SCIP  a framework to integrate Constraint and Mixed Integer Programming
, 2005
"... Constraint Programs and Mixed Integer Programs are closely related optimization problems originating from different scientific areas. Today’s stateoftheart algorithms of both fields have several strategies in common, in particular the branchandbound process to recursively divide the problem in ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
(Show Context)
Constraint Programs and Mixed Integer Programs are closely related optimization problems originating from different scientific areas. Today’s stateoftheart algorithms of both fields have several strategies in common, in particular the branchandbound process to recursively divide the problem into smaller subproblems. On the other hand, the main techniques to process each subproblem are different, and it was observed that they have complementary strengths. We present the programming framework Scip that integrates techniques from both fields in order to exploit the strengths of both, Constraint Programming and Mixed Integer Programming. In contrast to other proposals of recent years to combine both fields, Scip does not focus on easy implementation and rapid prototyping, but is tailored towards expert users in need of full, indepth control and high performance.
Improved Filtering for Weighted Circuit Constraints
"... We study the weighted circuit constraint in the context of constraint programming. It appears as a substructure in many practical applications, particularly routing problems. We propose a domain filtering algorithm for the weighted circuit constraint that is based on the 1tree relaxation of Held a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We study the weighted circuit constraint in the context of constraint programming. It appears as a substructure in many practical applications, particularly routing problems. We propose a domain filtering algorithm for the weighted circuit constraint that is based on the 1tree relaxation of Held and Karp. In addition, we study domain filtering based on an additive bounding procedure that combines the 1tree relaxation with the assignment problem relaxation. Experimental results on Traveling Salesman Problem instances demonstrate that our filtering algorithms can dramatically reduce the problem size. In particular, the search tree size and solving time can be reduced by several orders of magnitude, compared to existing constraint programming approaches. Moreover, for mediumsize problem instances, our method is competitive with the stateoftheart specialpurpose TSP solver Concorde.
Hybrid Modeling
"... The modeling practices of constraint programming (CP), artificial intelligence, and operations research must be reconciled and integrated if the computational benefits of combining their solution methods are to be realized in practice. This chapter focuses on CP and mixed integer/linear programming ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
The modeling practices of constraint programming (CP), artificial intelligence, and operations research must be reconciled and integrated if the computational benefits of combining their solution methods are to be realized in practice. This chapter focuses on CP and mixed integer/linear programming (MILP), in which modeling systems are most highly developed. It presents practical guidelines and supporting theory for the two types of modeling. It then suggests how an integrated modeling framework can be designed that retains, and even enhances, the modeling power of CP while allowing the full computational resources of both fields to be applied and combined. A series of examples are used to compare modeling practices in CP, MILP, and an integrated framework.