Results 41 to 50 of about 148 (126)
THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
Forum of Mathematics, Pi, 2013 The (real) Grothendieck constant ${K}_{G} $ is the infimum over those $K\in (0, \infty )$ such that for every $m, n\in \mathbb{N} $ and every $m\times n$ real matrix $({a}_{ij} )$ we have $$\begin{eqnarray*}\displaystyle \max _{\{ x_{i}\} _{i= 1}^{m} , \{
MARK BRAVERMAN +3 more
doaj +1 more source
EURO Journal on Computational Optimization, 2018 Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues +2 more
doaj +1 more source
Uncontrolled inexact information within bundle methods
EURO Journal on Computational Optimization, 2017 We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick +2 more
doaj +1 more source
Improved algorithms for the multicut and multiflow problems in rooted trees
Maximum integral multiflows, Minimum multicuts, Totally balanced matrices, Greedy matrices, Rooted trees, 90C27, 90C10,
A. Tamir
core +1 more source
Efficient solution methods for covering tree problems
location, covering, tree covering, 90B80, 90C27, 90C35,
T. Boffey
core +1 more source
EURO Journal on Computational Optimization, 2019 In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles.
François Clautiaux +3 more
doaj +1 more source
Evaluating performance of image segmentation criteria and techniques
EURO Journal on Computational Optimization, 2013 The image segmentation problem is to delineate, or segment, a salient feature in an image. As such, this is a bipartition problem with the goal of separating the foreground from the background. An NP-hard optimization problem, the Normalized Cut problem,
DoritS. Hochbaum +2 more
doaj +1 more source
Core group placement: allocation and provisioning of heterogeneous resources
EURO Journal on Computational Optimization, 2019 We present a theoretical and empirical study on a recently introduced combinatorial optimization problem, namely core group placement problem. The problem arises from real-world business requirements as part of resource allocation in cloud management. In
Serdar Kadıoğlu
doaj +1 more source
A comparison of algorithm RS with algorithm OPTSOL70
Location, Set-Covering, Heuristics, 90C10, 90C27,
Jesús Pastor, Marc Almiñana
core +1 more source