Results 1 to 10 of about 45,785 (91)

On finitely generated closures in the theory of cutting planes [PDF]

, 2012
Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points belonging to $P$ but
Averkov, Gennadiy
core   +2 more sources

Solving Mixed--integer Control Problems by Sum Up Rounding With Guaranteed Integer Gap [PDF]

, 2007
Probleme der Optimalen Steuerung, die zeitabhaengige diskrete Entscheidungen beinhalten, haben in letzter Zeit zunehmend Beachtung gefunden, da sie in praktischen Anwendungen mit hohem Potential fuer Optimierung auftreten.
Bock, Hans Georg, Diehl, Moritz, Sager, Sebastian   +2 more
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

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

, 2006
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
A.I. Barvinok, D.A. Cox, E. de Klerk, H.W. Lenstra Jr., J. Renegar, J. Renegar, J. Renegar, J. Renegar, J.A. De Loera, J.A. De Loera, J.A. De Loera, J.P. Jones, Jesús A. De Loera, M.R. Garey, Matthias Köppe, Raymond Hemmecke, Robert Weismantel, Y.V. Matiyasevich   +17 more
core   +2 more sources

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., Fernandes, Edite Manuela da G. P., Fernandes, Florbela P., Rocha, Ana Maria A. C.   +3 more
core   +1 more source

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  

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, A. Federgruen, A. Federgruen, A.J. Miller, A.S. Manne, Andrew J. Miller, E. Katok, G. Belvaux, G. Belvaux, G.D. Eppen, G.R. Bitran, G.R. Bitran, H. Marchand, H. Marchand, H. Stadtler, H. Tempelmeier, H.M. Wagner, I. Barany, I. Barany, J. Krarup, J.-P.P. Richard, J.-P.P. Richard, J.M. Thizy, K. Akartunalı, Kerem Akartunalı, L. Buschkühl, L.A. Wolsey, L.A. Wolsey, M. Constantino, M. Florian, M. Florian, M. Loparic, M. Van Vyve, N.C. Simpson, O. Günlük, P.J. Billington, R. Jans, R. Levi, R.L. Rardin, S. Anily, S. Küçükyavuz, W.I. Zangwill, W.W. Trigeiro, Y. Pochet, Y. Pochet, Y. Pochet, Y. Pochet, Z. Degraeve   +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., Balas E., Kent Andersen, Lovász L., Quentin Louveaux, Robert Weismantel, Rockafellar R. T.   +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

Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

EURO Journal on Computational Optimization, 2018
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction.
DimitriJ. Papageorgiou, Francisco Trespalacios   +1 more
doaj