Robust resource allocations in temporal networks
From MaRDI portal
Publication:715076
DOI10.1007/S10107-011-0478-7zbMATH Open1262.90031OpenAlexW1999560794MaRDI QIDQ715076FDOQ715076
Wolfram Wiesemann, Daniel Kuhn, Berç Rustem
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.2803
Recommendations
- Some dynamic time-optimality problems on networks with allocation of several resource types
- Stochastic task networks -- trading performance for stability
- Robust flows over time: models and complexity results
- Resource allocation for robust project scheduling
- Some problems of optimal allocation of scarce resources on a network graph of interdependent activities
Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- A survey of scheduling with controllable processing times
- Title not available (Why is that?)
- Robust Optimization of Large-Scale Systems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Uncertain convex programs: randomized solutions and confidence levels
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Robust Optimization Perspective on Stochastic Programming
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Rangen: A random network generator for activity-on-the-node networks
- Introduction to global optimization.
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Robust Combinatorial Optimization with Exponential Scenarios
- A class of stochastic programs with decision dependent uncertainty
- Robust Optimization for Empty Repositioning Problems
- A network flow computation for project cost curves
- Convex majorization with an application to the length of critical paths
- Critical-Path Planning and Scheduling: Mathematical Basis
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- Bounds on Expected Project Tardiness
- Application of a Technique for Research and Development Program Evaluation
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Multi-resource allocation in stochastic project scheduling
- Tractable approximations to robust conic optimization problems
- On criticality and sensitivity in activity networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust capacity expansion of network flows
- A computational study on bounding the makespan distribution in stochastic project networks
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The stochastic time–cost tradeoff problem: A robust optimization approach
- Digital Circuit Optimization via Geometric Programming
- Two-Stage Robust Network Design with Exponential Scenarios
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
Cited In (15)
- Primal-dual hybrid gradient method for distributionally robust optimization problems
- Robust unit commitment with \(n-1\) security criteria
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Multipolar robust optimization
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization
- Piecewise static policies for two-stage adjustable robust linear optimization
- Optimal crashing of an activity network with disruptions
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- Temporal network optimization subject to connectivity constraints
- Simplifying activity networks under generalized precedence relations to extended CPM networks
- Robust Quadratic Programming with Mixed-Integer Uncertainty
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
Uses Software
This page was built for publication: Robust resource allocations in temporal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715076)
