#### Filter Results:

- Full text PDF available (35)

#### Publication Year

2000

2017

- This year (2)
- Last 5 years (22)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Timo Berthold, Stefan Heinz, Stefan Vigerske, SOLVE MIQCPS, Timo Berthold, Stefan Vigerske
- 2009

This paper discusses how to build a solver for mixed integer quadratically constrained programs (MIQCPs) by extending a framework for constraint integer programming (CIP). The advantage of this approach is that we can utilize the full power of advanced MIP and CP technologies. In particular, this addresses the linear relaxation and the discrete components… (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)

- Alexandra Burkard, Caroline Dähn, +6 authors Joris Braspenning
- Xenobiotica; the fate of foreign compounds in…
- 2012

1. We have developed a novel technique which causes primary human hepatocytes to proliferate by transducing them with genes that upregulate their proliferation. 2. Upcyte(®) hepatocytes did not form colonies in soft agar and are not immortalised anchorage-independent cells. Confluent cultures expressed liver-specific proteins, produced urea and stored… (More)

- Timo Berthold, Ambros M. Gleixner, +5 authors Stefan Vigerske
- 2013

We provide a computational study of the performance of a state-of-theart solver for nonconvex mixed-integer quadratically constrained programs (MIQCPs). Since successful general-purpose solvers for large problem classes necessarily comprise a variety of algorithmic techniques, we focus especially on the impact of the individual solver components. The solver… (More)

- Stefan Heinz, Martin Sachenbacher
- CPAIOR
- 2009

Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state. In the case of nondeterministic systems, the difficulty arises that an input pattern can generate several possible outcomes. Some of these outcomes allow to distinguish between different hypotheses about the system state, while others do not. In… (More)

- Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz
- CPAIOR
- 2010

We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of practical relevance. Jobs have to be scheduled on (renewable) resources subject to precedence constraints such that the resource capacities are never exceeded and the latest completion time of… (More)

- Tobias Harks, Stefan Heinz, Marc E. Pfetsch
- Theory of Computing Systems
- 2006

We study online multicommodity routing problems in networks, in which commodities have to be routed sequentially. The flow of each commodity can be split on several paths. Arcs are equipped with load dependent price functions defining routing costs, which have to be minimized. We discuss a greedy online algorithm that routes each commodity by minimizing a… (More)

- Stefan Heinz, J. Christopher Beck
- CPAIOR
- 2012

Despite the success of constraint programming (CP) for scheduling, the much wider penetration of mixed integer programming (MIP) technology into business applications means that many practical scheduling problems are being addressed with MIP, at least as an initial approach. Furthermore, there has been impressive and well-documented improvements in the… (More)

- Tobias Achterberg, Stefan Heinz, Thorsten Koch
- CPAIOR
- 2008

In the recent years there has been tremendous progress in the development of algorithms to find optimal solutions for integer programs. In many applications it is, however, desirable (or even necessary) to generate all feasible solutions. Examples arise in the areas of hardware and software verification and discrete geometry. In this paper, we investigate… (More)

- Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
- 2014 IEEE International Parallel & Distributed…
- 2014

Contemporary supercomputers can easily provide years of CPU time per wall-clock hour. One challenge of today's software development is how to harness this vast computing power in order to solve really hard mixed-integer programming instances. In 2010, two out of six open MIPLIB2003 instances could be solved by ParaSCIP in more than ten consecutive runs,… (More)