The following pages link to Pierre Bonami (Q363560):
Displaying 40 items.
- Robust delay-constrained routing in telecommunications (Q363561) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Cut generation through binarization (Q896284) (← links)
- A note on the MIR closure (Q924876) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Learning a classification of mixed-integer quadratic programming problems (Q1626794) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Cutting planes from wide split disjunctions (Q2401148) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- (Q2861546) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Experiments with Two-Row Cuts from Degenerate Tableaux (Q2899149) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- (Q3061958) (← links)
- (Q3109952) (← links)
- On the Solution of a Graph Partitioning Problem under Capacity Constraints (Q3167633) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- (Q4633937) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- On branching rules for convex mixed-integer nonlinear optimization (Q5178746) (← links)
- Cut Generation through Binarization (Q5418994) (← links)
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing (Q5429260) (← links)
- Preface (Q5917850) (← links)
