Mixed-integer programming techniques for the connected max-k-cut problem
Mathematical Programming Computation, 2020 We consider an extended version of the classical Max-k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
Christopher Hojny +3 more
semanticscholar +1 more source
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
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
An analysis of mixed integer linear sets based on lattice point free convex sets [PDF]
, 2009 Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form $S:=\{x : \pi_0 \leq \pi^T x \leq \pi_0+1 \}$ called split sets.
Andersen K. +6 more
core +2 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