Results 41 to 50 of about 737 (80)
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
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
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
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
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
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
A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]
, 2010 AMS Subj. Classification: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems
Milanović, Marija
core
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
Approximating the Minimum Equivalent Digraph
, 2002 The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard.
Balaji Raghavachari +7 more
core +1 more source