• Aucun résultat trouvé

Beating the SDP bound for the floor layout problem: A simple combinatorial idea

N/A
N/A
Protected

Academic year: 2021

Partager "Beating the SDP bound for the floor layout problem: A simple combinatorial idea"

Copied!
25
0
0

Texte intégral

Loading

Figure

Table 3. Running time (in seconds) for the combinatorial bounding scheme (CB) and the SDP formulation from Takouda et al

Références

Documents relatifs

differently, if an employee felt that telephone monitoring was something that had few redeeming qualities, and it was an integral part of the work setting, then

Using the described technique with preservation of the extensor mechanism and reconstruction using a tumor prosthesis, ROM of the knee and local recurrence rate are comparable to

Weiss, “A general class of lower bounds in parameter estimation,” IEEE Transactions on Information Theory, vol. Tabrikian, “General classes of performance lower bounds for

Ilias, Immersions minimales, premiere valeur propre du Lapla- cien et volume conforme, Mathematische Annalen, 275(1986), 257-267; Une ine- galit´e du type ”Reilly” pour

Their linearity properties were recently studied by Drakakis, Requena, and McGuire, who conjectured that the absolute values of the Fourier coefficients of an Exponential Welch

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Its main result is an asymptotically deterministic lower bound for the PE of the sum of a low compressibility approximation to the Stokes operator and a small scaled random

This result by Reilly is a generalization, to Riemannian mani- folds of class (R, 0) (R > 0), of the well known theorem by Lichnerowicz [18 ] and Obata [21], which says that