Help
RSS
API
Feed
Maltego
Contact
Domain > biqmac.aau.at
×
Welcome!
Right click nodes and scroll the mouse to navigate the graph.
×
More information on this domain is in
AlienVault OTX
Is this malicious?
Yes
No
DNS Resolutions
Date
IP Address
2024-09-23
143.205.180.135
(
ClassC
)
Port 443
HTTP/1.1 200 OKAccept-Ranges: bytesContent-Type: text/htmlDate: Mon, 28 Aug 2023 23:13:18 GMTEtag: 213e-5c4f1db726eb3-gzipLast-Modified: Thu, 17 Jun 2021 08:18:51 GMTServer: Apache/2.4.10 (Debian) PHP !DOCTYPE html PUBLIC -//W3C//DTD XHTML 1.0 Strict//EN http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd>html> head> title>Biq Mac Solver - BInary Quadratic and MAx Cut Solver/title> meta namekeywords contentbiq mac,max cut, max-cut, mc, binary quadratic, 0-1, boolean optimization, semidefinite, sdp, semidefinite programming, branch and bound, optimization, rendl, rinaldi, wiegele, klagenfurt, iasi, rom> script typetext/javascript srcform_valitation.js>!--validator function -->/script> script typetext/javascript> var var_1 new Array(); var_10 new Array(mail,e,no email address given,); var_11 new Array(graphname,e,no name of the instance given,); var_12 new Array(graphfile,e,no file given,); var_13 new Array(name,e,no name given,); var_14 new Array(source,e,no source/originator/donator given,); /script> /head> body classnormaltext> h1> font colorblue>Biq Mac/font> Solver - font colorblue>Bi/font>nary font colorblue>q/font>uadratic and font colorblue>Ma/font>x font colorblue>c/font>ut Solver /h1> p> This site offers you two services: ul> li>solving unconstrained binary quadratic programs and/li> li>computing a maximum cut of edge-weighted graphs./li> /ul> It is the final outcome of a joint project between a href http://www.iasi.cnr.it/iasi/personnel/rinaldi.html>Giovanni Rinaldi/a>, a hrefhttp://www.iasi.cnr.it>IASI-CNR, Rome/a> and a hrefhttp://www.aau.at/~rendl>Franz Rendl/a> and a hrefhttp://www.aau.at/~anwiegel>Angelika Wiegele/a>, a hrefhttp://www.aau.at/mathematik>Department of Mathematics, Alpen-Adria-Universität Klagenfurt/a>. /p> p> You can choose between two options: ul> li>using an exact algorithm, i.e., an SDP based Branch & Bound algorithm or/li> li>computing upper and lower bounds only using the ConicBundle./li> /ul> The algorithm used for the exact solution method is an SDP based Branch & Bound algorithm, described in a hrefrrw_plain.pdf>R
View on OTX
|
View on ThreatMiner
Please enable JavaScript to view the
comments powered by Disqus.
Data with thanks to
AlienVault OTX
,
VirusTotal
,
Malwr
and
others
. [
Sitemap
]