ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B
Hrga, Timotej ; Povh, Janez, 1973-
We present a computational study of SDP-based bounds for Max-Cut that use a subset of hypermetric inequalities as cutting planes to strengthen the basic relaxation. Solving these relaxations is ...computationally challenging due to the potentially large number of violated constraints. To overcome these difficulties, we describe a heuristic separation algorithm for hypermetric inequalities and propose to use the augmented Lagrangian method as a bounding routine. Computational experiments show that the resulting relaxations provide very tight bounds for the Max-Cut.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
