Results 1 to 10 of about 385 (87)
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
Properties of solutions of optimization problems for set functions
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 7, Page 399-408, 2001., 2001 A definition of a special class of optimization problems with set functions is given. The existence of optimal solutions and first‐order optimality conditions are proved. This case of optimal problems can be transformed to standard mixed problems of mathematical programming in Euclidean space.
Slawomir Dorosiewicz
wiley +1 more source
A MIP framework for non-convex uniform price day-ahead electricity auctions [PDF]
, 2015 It is well-known that a market equilibrium with uniform prices often does not exist in non-convex day-ahead electricity auctions. We consider the case of the non-convex, uniform-price Pan-European day-ahead electricity market "PCR" (Price Coupling of ...
Madani, Mehdi, Van Vyve, Mathieu
core +2 more sources
Least quantile regression via modern optimization [PDF]
, 2014 We address the Least Quantile of Squares (LQS) (and in particular the Least Median of Squares) regression problem using modern optimization methods. We propose a Mixed Integer Optimization (MIO) formulation of the LQS problem which allows us to find a ...
Bertsimas, Dimitris, Mazumder, Rahul
core +2 more sources
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
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 +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
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
Robust flows with adaptive mitigation
EURO Journal on Computational Optimization, 2021 We consider an adjustable robust optimization problem arising in the area of supply chains: given sets of suppliers and demand nodes, we wish to find a flow that is robust with respect to failures of the suppliers.
Heiner Ackermann +2 more
doaj
The generalized minimum spanning tree polytope and related polytopes [PDF]
, 2001 The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source