Search research articles
Contact Us
Filters
Showing results (1-10 of 4) with videos related to
Page
of 1
Sort By:
Mathematical Programming
|
September 1, 2020
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
Elisabeth Gaar, Franz Rendl
Networks (New York, NY)
|
March 26, 2024
Exact solution approaches for the discrete <i>α</i>-neighbor <i>p</i>-center problem
Elisabeth Gaar, Markus Sinnl
Mathematical Methods of Operations Research (Heidelberg, Germany)
|
April 11, 2022
An SDP-based approach for computing the stability number of a graph
Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele
Mathematical Programming
|
July 29, 2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić, et al.
Page
of 1
Search research articles
Search
Showing results (1-10 of 4) with videos related to
Sort By:
Page
of 1
Mathematical Programming
|
September 1, 2020
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
Elisabeth Gaar, Franz Rendl
Networks (New York, NY)
|
March 26, 2024
Exact solution approaches for the discrete <i>α</i>-neighbor <i>p</i>-center problem
Elisabeth Gaar, Markus Sinnl
Mathematical Methods of Operations Research (Heidelberg, Germany)
|
April 11, 2022
An SDP-based approach for computing the stability number of a graph
Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele
Mathematical Programming
|
July 29, 2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić, et al.
Page
of 1