This paper focuses on combinatorial feasibility and optimization problems that arise in the context of parameter identification of discrete dynamical systems. Given a candidate parametric model for a physical system and a set of experimental observations, the objective of parameter...

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $${i \in \{1, 2\}}$$ can be split into a bounded number k i of equally-sized chunks that can be routed on different paths. We show that in contrast to the...

This article is a survey about recent developments in the area of test sets of families of linear integer programs. Test sets are finite subsets of the integer lattice that allow to improve any given feasible non-optimal point of an integer program by one element in the set. There are various...

The reconstruction of biochemical and genetic networks from experimental data is an important challenge in biology and medical basic research. We formalize this problem mathematically and present an exact algorithm for its solution. Our procedure yields either a complete list of all alternative...

This paper deals with irreducible augmentation vectors associated with three combinatorial optimization problems: the TSP, the ATSP, and the SOP. We study families of irreducible vectors of exponential size, derived from alternating cycles, where optimizing a linear function over each of these...