Sciweavers

19130 search results - page 123 / 3826
» Modelling multi-path problems
Sort
View
ASIACRYPT
2008
Springer
15 years 8 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
15 years 8 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
IJCAI
2007
15 years 7 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
ICALP
2007
Springer
16 years 16 days ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal