Sciweavers

817 search results - page 128 / 164
» Exact solutions to linear programming problems
Sort
View
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 9 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
LICS
2003
IEEE
14 years 26 days ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ISPAN
2002
IEEE
14 years 16 days ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
TON
2010
118views more  TON 2010»
13 years 6 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
MP
2002
110views more  MP 2002»
13 years 7 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski