The following pages link to Suvrajeet Sen (Q166230):
Displaying 50 items.
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program (Q688928) (← links)
- A heuristic procedure for stochastic integer programs with complete recourse (Q819082) (← links)
- Dynamic oligopolistic games under uncertainty: A stochastic programming approach (Q959722) (← links)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
- Enhancements of two-stage stochastic decomposition (Q1010300) (← links)
- (Q1077883) (redirect page) (← links)
- A class of algorithms for large scale nonlinear minimax optimization (Q1077884) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- Electric utility expansion planning in the presence of existing capacity: A nondifferentiable, convex programming approach (Q1088898) (← links)
- A quasi-Newton differential dynamic programming algorithm for discrete- time optimal control (Q1092853) (← links)
- Linear programming based analysis of marginal cost pricing in electric utility capacity expansion (Q1166409) (← links)
- Statistical verification of optimality conditions for stochastic programs with recourse (Q1178441) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Statistical approximations for stochastic linear programming problems (Q1289301) (← links)
- Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
- Finite master programs in regularized stochastic decomposition (Q1341566) (← links)
- Duality and statistical tests of optimality for two stage stochastic programs (Q1363429) (← links)
- Two-stage non-cooperative games with risk-averse players (Q1680967) (← links)
- A primal-dual subgradient method for time staged capacity expansion planning (Q1820669) (← links)
- Epigraphical nesting: A unifying theory for the convergence of algorithms (Q1893312) (← links)
- Statistical approximations for recourse constrained stochastic programs (Q1896451) (← links)
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
- Predictive stochastic programming (Q2127363) (← links)
- Towards a sustainable power grid: stochastic hierarchical planning for high renewable integration (Q2140361) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Connections among decision field theory models of cognition (Q2438610) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
- Multistage stochastic convex programs: duality and its implications (Q2507410) (← links)
- Stochastic decomposition. A statistical method for large scale stochastic linear programming (Q2564096) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- (Q2712828) (← links)
- Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs (Q2901080) (← links)
- Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction (Q2957466) (← links)
- Stochastic Decomposition and Extensions (Q3001270) (← links)
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems (Q3114905) (← links)
- (Q3139188) (← links)
- The capital supply curve in capacity expansion models: Some economic and algorithmic aspects (Q3323659) (← links)
- Intertemporal Allocation of Capital Costs in Electric Utility Capacity Expansion Planning Under Uncertainty (Q3340615) (← links)
- (Q3372266) (← links)
- A Stochastic Programming Approach to Power Portfolio Optimization (Q3391961) (← links)
- (Q3619096) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions (Q3703585) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
