The following pages link to Bienstock, Daniel (Q163023):
Displayed 50 items.
- (Q431026) (redirect page) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Computing robust basestock levels (Q951115) (← links)
- (Q1103630) (redirect page) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Broadcasting with random faults (Q1111578) (← links)
- On the complexity of testing for odd holes and induced odd paths (Q1175980) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths (Q1193442) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Potential function methods for approximately solving linear programming problems: theory and practice. (Q1422252) (← links)
- (Q1804361) (redirect page) (← links)
- Computational experience with a difficult mixed-integer multicommodity flow problem (Q1804363) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q1814787) (← links)
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem (Q1849528) (← links)
- ATM network design: Traffic models and optimization-based heuristics (Q1859106) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Intersection cuts for polynomial optimization (Q2293083) (← links)
- Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty (Q2931144) (← links)
- The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments (Q3083290) (← links)
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets (Q3192097) (← links)
- Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation (Q3391975) (← links)
- Electrical Transmission System Cascades and Vulnerability (Q3467662) (← links)
- Average distance in graphs with removed elements (Q3470488) (← links)
- On a Network Design Problem That Is Intractable on Trees (Q3486349) (← links)
- On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks (Q3490035) (← links)
- Linear-Time Test for Small Face Covers in any Fixed Surface (Q3495650) (← links)
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems (Q3569804) (← links)
- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems (Q3569806) (← links)
- Asymptotic Analysis of Some Network Reliability Models (Q3780733) (← links)
- An algorithm for reliability analysis of planar graphs (Q3786257) (← links)
- On the Complexity of Covering Vertices by Faces in a Planar Graph (Q3790663) (← links)
- Some Lattice-Theoretic Tools for Network Reliability Analysis (Q3796949) (← links)
- (Q3824325) (← links)
- Optimal enclosing regions in planar graphs (Q3832585) (← links)
- An Extremal Problem on Sparse 0-1 Matrices (Q3971234) (← links)
- Monotonicity in graph searching (Q3974370) (← links)