Results 31 to 40 of about 790 (89)
EURO Journal on Computational Optimization, 2021 A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive ...
Mirjam Dür, Franz Rendl
doaj
Automatic boomerang attacks search on Rijndael
Journal of Mathematical CryptologyBoomerang attacks were introduced in 1999 by Wagner (The boomerang attack. In: Knudsen LR, editor. FSE’99. vol. 1636 of LNCS. Heidelberg: Springer; 1999. p.
Rouquette Loïc +2 more
doaj +1 more source
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
Advances in Industrial and Manufacturing Engineering, 2021 The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum.
Ravi Vishwakarma, P.L. Powar
doaj
Covering compact metric spaces greedily
, 2018 A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem.
Rolfes, Jan Hendrik, Vallentin, Frank
core +1 more source
The new FIFA rules are hard: Complexity aspects of sports competitions [PDF]
, 1999 Consider a soccer competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win ...
Kern, W., Paulusma, D.
core +1 more source
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
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj
On the theta number of powers of cycle graphs [PDF]
, 2011 We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is computable in ...
Bachoc, Christine +2 more
core +3 more sources
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
EURO Journal on Computational Optimization, 2018 In the field of robust optimization, uncertain data are modeled by uncertainty sets which contain all relevant outcomes of the uncertain problem parameters. The complexity of the related robust problem depends strongly on the shape of the chosen set. Two
Jannis Kurtz
doaj