The following pages link to Michael Poss (Q296585):
Displaying 50 items.
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Cautious label ranking with label-wise decomposition (Q319901) (← links)
- The robust vehicle routing problem with time windows (Q340242) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- Optimizing power generation in the presence of micro-grids (Q724120) (← links)
- (Q1038108) (redirect page) (← links)
- An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- \(k\)-adaptive routing for the robust network loading problem (Q1742208) (← links)
- Path generation for affine flow thinning (Q1742256) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
- Models and algorithms for network design problems (Q1936663) (← links)
- Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438) (← links)
- Optimizing subscriber migrations for a telecommunication operator in uncertain context (Q2076939) (← links)
- Linearized formulations for failure aware barter exchange (Q2128774) (← links)
- Robust inventory theory with perishable products (Q2158637) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Approximating robust bin packing with budgeted uncertainty (Q2285083) (← links)
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
- Maximum probabilistic all-or-nothing paths (Q2286936) (← links)
- Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach (Q2300647) (← links)
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
- Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
- A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing (Q3091496) (← links)
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows (Q3167629) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
- Generalized elastic flow rerouting scheme (Q4642428) (← links)
- Robust constrained shortest path problems under budgeted uncertainty (Q4642442) (← links)
- Solving the bifurcated and nonbifurcated robust network loading problem with <i>k</i>‐adaptive routing (Q4687215) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Time‐dependent shortest paths with discounted waits (Q5241428) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity (Q5740209) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5918896) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- An introduction to variational quantum algorithms for combinatorial optimization problems (Q6054009) (← links)
