Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
The types of police inquiries performed these days are incredibly diverse. Often data processing architectures are not suited to cope with this diversity since most of the case dat...
Jonas Poelmans, Paul Elzinga, Stijn Viaene, Guido ...
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...