The following pages link to Daniel Bienstock (Q163023):
Displaying 29 items.
- Some Generalized Max-Flow Min-Cut Problems in the Plane (Q3978618) (← links)
- A Note on Finding a Strict Saddlepoint (Q3983928) (← links)
- New results on rectilinear crossing numbers and plane embeddings (Q4020698) (← links)
- (Q4035355) (← links)
- Bounds for rectilinear crossing numbers (Q4201390) (← links)
- Blocking Small Cuts in a Network, and Related Problems (Q4202207) (← links)
- A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands (Q4286934) (← links)
- A degree sequence problem related to network design (Q4303623) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- Subset Algebra Lift Operators for 0-1 Integer Programming (Q4651995) (← links)
- (Q4845370) (← links)
- (Q4952591) (← links)
- Stochastic Defense Against Complex Grid Attacks (Q4969436) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q5101407) (← links)
- Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty (Q5211894) (← links)
- Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability (Q5211907) (← links)
- A Lot-Sizing Problem on Trees, Related to Network Design (Q5287989) (← links)
- Polynomial Solvability of Variants of the Trust-Region Subproblem (Q5383987) (← links)
- Capacitated Network Design—Polyhedral Structure and Computation (Q5690264) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- Strong inequalities for capacitated survivable network design problems. (Q5926334) (← links)
- Principled deep neural network training through linear programming (Q6054389) (← links)
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level (Q6163957) (← links)
- Risk-Aware Security-Constrained Unit Commitment: Taming the Curse of Real-Time Volatility and Consumer Exposure (Q6514615) (← links)
- Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF (Q6525976) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
