The following pages link to Shabbir Ahmed (Q322600):
Displayed 50 items.
- Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty (Q322602) (← links)
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- Exact augmented Lagrangian duality for mixed integer linear programming (Q507329) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- Coherent risk measures in inventory problems (Q879300) (← links)
- Strengthened bounds for the probability of \(k\)-out-of-\(n\) events (Q897611) (← links)
- Sample average approximation of expected value constrained stochastic programs (Q957332) (← links)
- Item:Q322600 (redirect page) (← links)
- Sample average approximation method for chance constrained programming: Theory and applications (Q1035926) (← links)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- Supply chain design under uncertainty using sample average approximation and dual decomposition (Q1042158) (← links)
- Dynamic capacity acquisition and assignment under uncertainty (Q1417787) (← links)
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty (Q1422871) (← links)
- On robust optimization of two-stage systems (Q1424290) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- The inverse optimal value problem (Q1769073) (← links)
- Corrigendum to: ``A scenario decomposition algorithm for 0--1 stochastic programs'' (Q1785641) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Global optimization of 0-1 hyperbolic programs (Q1810871) (← links)
- Product disaggregation in global optimization and relaxations of rational programs (Q1863895) (← links)
- The sample average approximation method applied to stochastic routing problems: a computational study (Q1866135) (← links)
- A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
- Totally unimodular stochastic programs (Q1949257) (← links)
- Distributionally robust simple integer recourse (Q1989721) (← links)
- Robust strategic bidding in auction-based markets (Q1991246) (← links)
- Distributionally robust facility location problem under decision-dependent stochastic demand (Q2030606) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
- Optimized Bonferroni approximations of distributionally robust joint chance constraints (Q2118072) (← links)
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
- Semi-continuous network flow problems (Q2248765) (← links)
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing (Q2273651) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- A stochastic programming approach for planning horizons of infinite horizon capacity planning problems (Q2379527) (← links)
- Stochastic dual dynamic integer programming (Q2414913) (← links)
- Convex relaxations of chance constrained optimization problems (Q2439484) (← links)
- A scenario decomposition algorithm for 0-1 stochastic programs (Q2450729) (← links)