A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also sh...
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonl...