A computational analysis of lower bounds for big bucket production planning problems [PDF]
, 2012 In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources.
A. Atamtürk +47 more
core +3 more sources
On the size of lattice simplices with a single interior lattice point
, 2012 Let $\mathcal{T}^d(1)$ be the set of all $d$-dimensional simplices $T$ in $\real^d$ with integer vertices and a single integer point in the interior of $T$.
Averkov, Gennadiy
core +1 more source
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +2 more sources
An exact solution method for binary equilibrium problems with compensation and the power market uplift problem [PDF]
, 2015 We propose a novel method to find Nash equilibria in games with binary decision variables by including compensation payments and incentive-compatibility constraints from non-cooperative game theory directly into an optimization framework in lieu of using
Huppmann, Daniel, Siddiqui, Sauleh
core +2 more sources
Transversal numbers over subsets of linear spaces [PDF]
, 2009 Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at most $h ...
Averkov, Gennadiy, Weismantel, Robert
core
Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems [PDF]
, 2016 Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems.
Bauso, D., Başar, T., Zhu, Q.
core +3 more sources
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
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
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