Abstract. The maximum cut problem for a quintic del Pezzo surface Bl4(P2) asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this article we show that the answer is twelve. More generally, we obtain bounds for the maximum cut problem for the minuscule varieties Xa,b,c: = Blb+c(Pc−1)a−1 studied by Mukai and Castravet-Tevelev and show that these bounds are asymptotically sharp for infinite families. We prove our results by constructing embeddings of the classes of (−1)-divisors on these varieties which are optimal for the semidefinite relaxation of the maximum cut problem on graphs proposed by Goemans and Williamson. These results give a new optimal...
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. Fo...
The exact solution of the NP-hard Maximum Cut Problem is important in many applications across, e.g....
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
We study a mixed-integer set $S:={(x,t)∈{0,1}^n \times \mathbf{R}:f(x)≥t}$ arising in the submodular...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
This work was partially supported by EEC Contract SC1-CT-91-0620. In this paper we describe a cuttin...
To study how balanced or unbalanced a maximal intersecting family F ⊆ ([n]r) is we consider the rati...
Abstract. The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial ...
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequa...
AbstractTo study how balanced or unbalanced a maximal intersecting family F⊆([n]r) is we consider th...
We present a method for finding exact solutions of Max-Cut, the prob-lem of finding a cut of maximum...
To study how balanced or unbalanced a maximal intersecting family F subset of ((vertical bar n verti...
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. Fo...
The exact solution of the NP-hard Maximum Cut Problem is important in many applications across, e.g....
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...
The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. I...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
We study a mixed-integer set $S:={(x,t)∈{0,1}^n \times \mathbf{R}:f(x)≥t}$ arising in the submodular...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
This work was partially supported by EEC Contract SC1-CT-91-0620. In this paper we describe a cuttin...
To study how balanced or unbalanced a maximal intersecting family F ⊆ ([n]r) is we consider the rati...
Abstract. The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial ...
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequa...
AbstractTo study how balanced or unbalanced a maximal intersecting family F⊆([n]r) is we consider th...
We present a method for finding exact solutions of Max-Cut, the prob-lem of finding a cut of maximum...
To study how balanced or unbalanced a maximal intersecting family F subset of ((vertical bar n verti...
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. Fo...
The exact solution of the NP-hard Maximum Cut Problem is important in many applications across, e.g....
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...