Search Results - Mathematical optimization. Approximation theory. Integer programming. Linear programming.

An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming by Pham, Hoang Giang, Ta, Thuy Anh, Mai, Tien

“… These problems are known to be NP-hard to approximate within any constant factor, and existing solution approaches typically rely on mixed-integer linear programming or second-order cone programming reformulations…”
Get full text

The integer approximation error in mixed-integer optimal control by Sager, Sebastian, Bock, Hans Georg, Diehl, Moritz

“…We extend recent work on nonlinear optimal control problems with integer restrictions on some of the control functions…”
Get full text

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach by Luathep, Paramet, Sumalee, Agachai, Lam, William H.K., Li, Zhi-Chun, Lo, Hong K.

“…► Mixed network design problem (MNDP) can be formulated as a mixed-integer linear programming problem (MILP…”
Get full text

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation by Ploussard, Quentin

“…) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables…”
Get full text

A Robust Optimization Approach to Inventory Theory by Bertsimas, Dimitris, Thiele, Aurelie

“…We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time…”
Get full text

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems by Bökler, Fritz, Parragh, Sophie N, Sinnl, Markus, Tricoire, Fabien

“…–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices…”
Get full text

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations by Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kleinert, Thomas

“… One approach to tackle this difficulty is to use bivariate piecewise linear approximations for each variable product, which can be represented via mixed-integer linear programming (MIP) formulations…”
Get full text

Alternative regularizations for Outer-Approximation algorithms for convex MINLP by Bernal, David E., Peng, Zedong, Kronqvist, Jan, Grossmann, Ignacio E.

“… functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems…”
Get full text

Robust Optimization by Ben-Tal, Aharon, El Ghaoui, Laurent, Nemirovski, Arkadi

“…Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle…”
Get full text

Topology optimization via sequential integer programming and Canonical relaxation algorithm by Liang, Yuan, Cheng, Gengdong

“…The mathematical essence of structural topology optimization is large-scale nonlinear integer programming…”
Get full text

Partially distributed outer approximation by Murray, Alexander, Faulwasser, Timm, Hagenmeyer, Veit, Villanueva, Mario E, Houska, Boris

“…This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality…”
Get full text

Empirical decision model learning by Lombardi, Michele, Milano, Michela, Bartolini, Andrea

“…One of the biggest challenges in the design of real-world decision support systems is coming up with a good combinatorial optimization model…”
Get full text

Global optimization of bilinear programs with a multiparametric disaggregation technique by Kolodziej, Scott, Castro, Pedro M., Grossmann, Ignacio E.

“… ) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global…”
Get full text

Multiobjective Mixed-Integer Quadratic Models: A Study on Mathematical Programming and Evolutionary Computation by Shir, Ofer M., Emmerich, Michael

“… To do so, this article compares a mathematical programming approach with an evolutionary method for set-oriented Pareto front approximation of bi-objective quadratic MI optimization…”
Get full text

Perspective reformulations of mixed integer nonlinear programs with indicator variables by Günlük, Oktay, Linderoth, Jeff

“…We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables…”
Get full text

Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones by Bernal Neira, David E., Grossmann, Ignacio E.

“… We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP) problems through both the big-M and hull reformulations…”
Get full text

On mixed-integer optimal control with constrained total variation of the integer control by Sager, Sebastian, Zeile, Clemens

“…The combinatorial integral approximation (CIA) decomposition suggests solving mixed-integer optimal control problems by solving one continuous nonlinear control problem and one mixed-integer linear program (MILP…”
Get full text

Optimization Model for Backup Resource Allocation in Middleboxes With Importance by He, Fujun, Sato, Takehiro, Oki, Eiji

“… We formulate the proposed backup resource allocation model as a mixed integer linear programming problem…”
Get full text

Weapon-target assignment problem: exact and approximate solution algorithms by Andersen, Alexandre Colaers, Pavlikov, Konstantin, Toffolo, Túlio A. M.

“…), such that the expected value of survived targets is minimized. The WTA problem is a nonlinear combinatorial optimization problem known to be NP-hard…”
Get full text

Feature subset selection for logistic regression via mixed integer optimization by Sato, Toshiki, Takano, Yuichi, Miyashiro, Ryuhei, Yoshise, Akiko

“… Specifically, we pose the problem as a mixed integer linear optimization problem, which can be solved with standard mixed integer optimization software, by making a piecewise linear approximation…”
Get full text