Sciweavers

MP
1998
68views more  MP 1998»
13 years 11 months ago
Weak k-majorization and polyhedra
Geir Dahl, François Margot
MP
1998
136views more  MP 1998»
13 years 11 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
MP
1998
109views more  MP 1998»
13 years 11 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
MP
1998
63views more  MP 1998»
13 years 11 months ago
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Ya. I. Alber, Alfredo N. Iusem, Mikhail V. Solodov
MP
1998
105views more  MP 1998»
13 years 11 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal