Scientific Program Cluster Details

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only


Please login, if you want to personalize your selection of clusters.

Cluster: Mixed-integer nonlinear programming

Monday


10:30 - 12:00, room: MA 005

Chair: Ignacio E. Grossmann
Global mixed-integer nonlinear optimization I

Grossmann Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs [...]
Bogataj A multilevel approach to global optimization of MINLP problems [...]
Westerlund A reformulation framework for global optimization [...]

 

13:15 - 14:45, room: MA 005

Chair: Ignacio E. Grossmann
Global mixed-integer nonlinear optimization II

Knudsen Mixed integer optimization of the late-life performance of shale-gas wells [...]
Guillén-Gosálbez Solving mixed-integer linear-fractional programming problems via an exact MILP reformulation [...]
Castro Multiparametric disaggregation as a new paradigm for global optimization of mixed-integer polynomial programs [...]

 

15:15 - 16:45, room: MA 005

Chair: Stefan Vigerske
Tight relaxations

Lehmann On the efficient construction of disjunctive cutting planes for mixed-integer quadratic optimization problems [...]
Michaels The convex hull of vectors of functions [...]
Gleixner Rapid optimality-based bound tightening [...]

 

 

Tuesday


10:30 - 12:00, room: MA 005

Chair: Leo Liberti and Pietro Belotti
Efficient solvers for mixed integer nonlinear optimization problems

Vigerske Solving MINLPs with SCIP [...]
Belotti Separation of valid inequalities for multilinear functions [...]
Dong On box constrained quadratic programming with binary indicators [...]

 

13:15 - 14:45, room: MA 005

Chair: Sarah Drewes
Advances in MINLP

Terlaky Conic representation of the convex hull of disjunctions of convex sets and conic cuts for mixed integer second order cone optimization [...]
Drewes Cover inequalities and outer-approximation for mixed-01 SOCPs [...]
Morsi Solving MINLPs on loosely coupled networks [...]

 

15:15 - 16:45, room: MA 005

Chair: Jeff Linderoth
Convex relaxations for nonconvex optimization problems

Anstreicher Second-order-cone constraints for extended trust-region subproblems [...]
Linderoth Solving mixed integer polynomial optimization problems with MINOTAUR [...]
Lee Global optimization of indefinite quadratics [...]

 

 

Wednesday


10:30 - 12:00, room: MA 042

Chair: Anita Schöbel
Topics in mixed-integer nonlinear programming I

Galli Reformulating mixed-integer quadratically constrained quadratic programs [...]
Niu On combination of DCA branch-and-bound and DC-Cut for solving mixed-01 linear programs [...]
Schöbel A geometric branch and bound approach for nonlinear mixed-integer optimization [...]

 

13:15 - 14:45, room: MA 041

Chair: Noam Goldberg
Structured MINLP and applications

Lastusilta Chromatographic separation using GAMS extrinsic functions [...]
Goldberg Cover inequalities for nearly monotone quadratic MINLPs [...]
Margulies Hilbert's Nullstellensatz and the partition problem: An infeasibility algorithm via the partition matrix and the partition polynomial [...]

 

13:15 - 14:45, room: MA 042

Chair: Michael Engelhart
Topics in mixed-integer nonlinear programming II

Calinescu Optimal resource allocation in survey designs [...]
Engelhart A new test-scenario for analysis and training of human decision making with a tailored decomposition approach [...]

 

15:15 - 16:45, room: MA 041

Chair: Jeff Linderoth
Quadratic integer programming

Buchheim Nonconvex underestimators for integer quadratic optimization [...]
Trieu Convex piecewise quadratic integer programming [...]
Jeon Convex quadratic programming with variable bounds [...]

 

15:15 - 16:45, room: MA 042

Chair: Duan Li
Topics in mixed-integer nonlinear programming III

Li MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: A semidefinite program approach [...]
Sharma A duality based approach for a class of bilevel programming problems [...]

 

 

Thursday


10:30 - 12:00, room: MA 041

Chair: Jeff Linderoth
Techniques for convex MINLPs

Bonami On disjunctive cuts for mixed integer convex programs [...]
Mahajan Algorithms for solving convex MINLPs with MINOTAUR [...]
Miller Valid inequalities for a nonseparable quadratic set [...]

 

10:30 - 12:00, room: MA 042

Chair: Giacomo Nannicini
MINLP theory and algorithms

Traversi Separable underestimators for quadratic combinatorial optimization [...]
Coniglio Spatial branch-and-bound for nonconvex Euclidean norm constrained mathematical programs [...]

 

13:15 - 14:45, room: MA 041

Chair: Adam Nicholas Letchford and Samuel Burer
Convex approaches for quadratic integer programs

Letchford A new separation algorithm for the Boolean quadric and cut polytopes [...]
Fischer The asymmetric quadratic traveling salesman problem [...]
Mitchell Quadratic programs with complementarity constraints [...]

 

15:15 - 16:45, room: MA 001

Chair: Jon Lee
Mixed-integer nonlinear programming

Onn Integer programming in polynomial time via Graver bases [...]
Sotirov SDP relaxations for the graph partition problem [...]
Hemmecke N-fold integer programming in cubic time [...]

 

 

Friday


10:30 - 12:00, room: MA 041

Chair: Rüdiger Schultz
Applications of MINLP I

Stangl Feasibility testing for transportation orders in real-life gas networks [...]
Margot The traveling salesman problem with neighborhoods: MINLP solution [...]
Schelbert How to route a pipe - Discrete approaches for physically correct routing [...]

 

13:15 - 14:45, room: MA 041

Chair: Rüdiger Schultz
Applications of MINLP II

Huang Primal heuristics for nonconvex MINLPs modelling optimal operation of water distribution networks [...]
Held Challenges and requirements for MINLPs in industrial applications [...]

 

15:15 - 16:45, room: MA 041

Chair: Leo Liberti
Modelling, reformulation and solution of MINLPs

de Santis A method for MINLP problems with simple constraints [...]
Liberti On feasibility-based bounds tightening [...]
D'Ambrosio Optimistic modeling of non-linear optimization problems by mixed-integer linear programming [...]

 

 

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only
  The majority of financial loan companies provide the service of getting Payday Loans North Carolina for U.S. citizens. But at the same time, it acts only with sexual arousal. Viagra has a number of advantages in comparison with injections in the sexual organ or other procedures aimed at treatment of impotency.