This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear...

This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear...

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...

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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${i \in \{1, 2\}}$$</EquationSource> </InlineEquation> can be split into a bounded number k <Subscript> i </Subscript> of equally-sized chunks that can be routed on different paths. We show that in contrast to the...</subscript></equationsource></inlineequation>

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...