7 search results - page 1 / 2 » 4or 2005 |
4OR
2005
13 years 4 months ago
2005
4OR
2005
13 years 4 months ago
2005
4OR
2005
13 years 4 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
4OR
2005
13 years 4 months ago
2005
Abstract In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the conte...
4OR
2005
13 years 4 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...