Mixed-integer programming formulation of a data-driven solver in computational elasticity [PDF]
Optimization Letters, 2018 This paper presents a mixed-integer quadratic programming formulation of an existing data-driven approach to computational elasticity. This formulation is suitable for application of a standard mixed-integer programming solver, which finds a global ...
Y. Kanno
semanticscholar +1 more source
Multiple solutions of mixed variable optimization by multistart hooke and jeeves filter method [PDF]
, 2014 In this study, we propose a multistart method based on an extended version of the Hooke and Jeeves (HJ) algorithm for computing mul- tiple solutions of mixed variable optimization problems.
Costa, M. Fernanda P. +3 more
core +1 more source
An integrated optimisation platform for sustainable resource and infrastructure planning [PDF]
, 2018 It is crucial for sustainable planning to consider broad environmental and social dimensions and systemic implications of new infrastructure to build more resilient societies, reduce poverty, improve human well-being, mitigate climate change and address ...
Koppelaar, RHEM +4 more
core +1 more source
Learning to Branch in Mixed Integer Programming
AAAI Conference on Artificial Intelligence, 2016 The design of strategies for branching in Mixed Integer Programming (MIP) is guided by cycles of parameter tuning and offline experimentation on an extremely heterogeneous testbed, using the average performance.
Elias Boutros Khalil +4 more
semanticscholar +1 more source
Approximation of corner polyhedra with families of intersection cuts
, 2017 We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up ...
A Basu +12 more
core +1 more source
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization [PDF]
Mathematical programming, 2019 In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with non-Lipschitzian value functions and ...
Shixuan Zhang, X. Sun
semanticscholar +1 more source
Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy [PDF]
, 2017 The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints ...
Baena, Daniel +2 more
core +1 more source
Uncapacitated Lot-Sizing with Stock Upper Bounds, Stock Fixed Costs, Stock Overloads and Backlogging: A Tight Formulation [PDF]
, 2015 For an n-period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O(n^2) variables and constraints, also
Wolsey, Laurence
core
Convex approximations for a class of mixed-integer recourse models [PDF]
We consider mixed-integer recourse (MIR) models with a single recourse constraint.We relate the secondstage value function of such problems to the expected simple integer recourse (SIR) shortage function.
Vlerk, Maarten H. van der
core +1 more source
McCormick envelopes in mixed-integer PDE-constrained optimization [PDF]
Mathematical programmingMcCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear ...
S. Leyffer, Paul Manns
semanticscholar +1 more source