Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems [PDF]
Engineering optimization (Print), 2019 Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation of the Pareto front challenging.
R. Burachik, C. Kaya, M. Rizvi
semanticscholar +1 more source
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
Solving wind farm layout optimization with mixed integer programs and constraint programs
EURO Journal on Computational Optimization, 2014 The wind farm layout optimization problem is concerned with the optimal location of turbines within a fixed geographical area to maximize profit under stochastic wind conditions. Previously, it has been modeled as a maximum diversity (or p-dispersion-sum)
PeterY. Zhang +3 more
doaj
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
EURO Journal on Computational Optimization, 2017 This paper elaborates compact MIP formulations for a discrete unit commitment problem with minimum stop and ramping constraints. The variables can be defined in two different ways.
Nicolas Dupin
doaj
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
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj
Core group placement: allocation and provisioning of heterogeneous resources
EURO Journal on Computational Optimization, 2019 We present a theoretical and empirical study on a recently introduced combinatorial optimization problem, namely core group placement problem. The problem arises from real-world business requirements as part of resource allocation in cloud management. In
Serdar Kadıoğlu
doaj
Unbounded convex sets for non-convex mixed-integer quadratic programming [PDF]
, 2014 This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming.
Burer, Samuel, Letchford, Adam
core