Zobrazeno 1 - 10
of 27
pro vyhledávání: '"de Meijer, Frank"'
In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We give two formulations of the QMSTP as mixed-integer semidefinite programs exploiting the al
Externí odkaz:
http://arxiv.org/abs/2410.04997
Autor:
Gijswijt, Dion, de Meijer, Frank
In this paper we study the Cayley graph $\mathrm{Cay}(S_n,T)$ of the symmetric group $S_n$ generated by a set of transpositions $T$. We show that for $n\geq 5$ the Cayley graph is normal. As a corollary, we show that its automorphism group is a direc
Externí odkaz:
http://arxiv.org/abs/2401.17860
Autor:
de Meijer, Frank, Sotirov, Renata
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show similar results
Externí odkaz:
http://arxiv.org/abs/2306.09865
The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed number of disjoint subsets of given sizes such that the sum of weights of edges joining different sets is minimized. This paper investigates the quality of do
Externí odkaz:
http://arxiv.org/abs/2205.06788
Autor:
de Meijer, Frank, Sotirov, Renata
In this paper we study the well-known Chv\'atal-Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs). We prove several results regarding the hierarchy of relaxations obtained by iterating this procedure. We also study differen
Externí odkaz:
http://arxiv.org/abs/2201.10224
Autor:
de Meijer, Frank, Sotirov, Renata
We study the Quadratic Cycle Cover Problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and use facial r
Externí odkaz:
http://arxiv.org/abs/2009.03616
Autor:
de Meijer, Frank, Sotirov, Renata
The quadratic cycle cover problem is the problem of finding a set of node-disjoint cycles visiting all the nodes such that the total sum of interaction costs between consecutive arcs is minimized. In this paper we study the linearization problem for
Externí odkaz:
http://arxiv.org/abs/1904.02914
Publikováno v:
In Computers and Operations Research March 2023 151
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.