The following pages link to Jeff Linderoth (Q237857):
Displayed 46 items.
- Orbital branching (Q623461) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- Decomposition algorithms for stochastic programming on a computational grid (Q1866131) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Optimization-based dispatching policies for open-pit mining (Q2129198) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching (Q2830766) (← links)
- A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems (Q2884506) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs (Q2899087) (← links)
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing (Q2901077) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
- (Q3109952) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- (Q3372252) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- A Computational Study of Search Strategies for Mixed Integer Programming (Q4427374) (← links)
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators (Q4910814) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- Mixed-integer nonlinear optimization (Q5419635) (← links)
- Orbital Branching (Q5429261) (← links)
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver (Q5959286) (← links)
- New classes of facets for complementarity knapsack problems (Q6166884) (← links)
- A Set-Covering Approach to Customized Coverage Instrumentation (Q6202328) (← links)
- Integer packing sets form a well-quasi-ordering (Q6330063) (← links)
- Piecewise Polyhedral Formulations for a Multilinear Term (Q6332197) (← links)
- Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints (Q6406710) (← links)
- An Integer Programming Approach To Subspace Clustering With Missing Data (Q6452764) (← links)