#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tobias Achterberg
- Math. Program. Comput.
- 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), which is free for academic and non-commercial use and can be… (More)

- Tobias Achterberg, Thorsten Koch, Alexander Martin
- Oper. Res. Lett.
- 2005

Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s state-of-the-art strong branching and pseudocost branching branching strategies… (More)

- Tobias Achterberg, Timo Berthold
- Discrete Optimization
- 2007

The Feasibility Pump of Fischetti, Glover, Lodi, and Bertacco [8, 7] has proved to be a very successful heuristic for finding feasible solutions of mixed integer programs. The quality of the solutions in terms of the objective value, however, tends to be poor. This paper proposes a slight modification of the algorithm in order to find better solutions.… (More)

- Tobias Achterberg, Thorsten Koch, Alexander Martin
- Oper. Res. Lett.
- 2006

This paper reports on the fourth version of the Mixed Integer Programming Library. Since MIPLIB is to provide a concise set of challenging problems, it became necessary to purge instances that became too easy. We present an overview of the 27 new problems and statistical data for all 60 instances.

Constraint Programs and Mixed Integer Programs are closely related optimization problems originating from different scientific areas. Today’s state-of-the-art algorithms of both fields have several strategies in common, in particular the branch-and-bound process to recursively divide the problem into smaller subproblems. On the other hand, the main… (More)

- Tobias Achterberg
- Discrete Optimization
- 2007

Conflict analysis for infeasible subproblems is one of the key ingredients in modern SAT solvers. In contrast, it is common practice for today’s mixed integer programming solvers to discard infeasible subproblems and the information they reveal. In this paper, we try to remedy this situation by generalizing SAT infeasibility analysis to mixed integer… (More)

- Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
- CPAIOR
- 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 framework SCIP, which also integrates techniques from SAT… (More)

- Thorsten Koch, Tobias Achterberg, +13 authors Kati Wolter
- Math. Program. Comput.
- 2011

This paper reports on the fifth version of the Mixed Integer Programming Library. The miplib 2010 is the first miplib release that has been assembled by a large group from academia and from industry, all of whom work in integer programming. There was mutual consent that the concept of the library had to be expanded in order to fulfill the needs of the… (More)

- Tobias Achterberg, Christian Raack
- Math. Program. Comput.
- 2010

Given a general mixed integer program, we automatically detect block structures in the constraint matrix together with the coupling by capacity constraints arising from multi-commodity flow formulations. We identify the underlying graph and generate cutting planes based on cuts in the detected network. Our implementation adds a separator to the… (More)