- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2924
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Partial Lasserre relaxation for sparse Max-Cut ; day:17 ; month:8 ; year:2022 ; pages:1-22
Optimization and engineering ; (17.8.2022), 1-22
- Creator
-
Campos, Juan S.
Misener, Ruth
Parpas, Panos
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11081-022-09763-y
- URN
-
urn:nbn:de:101:1-2022110418411776011282
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Campos, Juan S.
- Misener, Ruth
- Parpas, Panos
- SpringerLink (Online service)
Other Objects (12)
Faster exact solution of sparse MaxCut and QUBO problems
Discovering sparse interpretable dynamics from partial observations
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling
Partial Relaxation: A Computationally Efficient Direction-of-Arrival Estimation Framework
Branch and cut for an SDP relaxation of large scale minimum bisection problems
Branch and cut for a semidefinite relaxation of large scale minimum bisection problems
On sparse sensor placement for parameter identification problems with partial differential equations
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Locally sparse and robust partial least squares in scalar-on-function regression
Multiset sparse partial least squares path modeling for high dimensional omics data analysis
Cut!
Faster exact solution of sparse MaxCut and QUBO problems
Discovering sparse interpretable dynamics from partial observations
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling
Partial Relaxation: A Computationally Efficient Direction-of-Arrival Estimation Framework
Branch and cut for an SDP relaxation of large scale minimum bisection problems
Branch and cut for a semidefinite relaxation of large scale minimum bisection problems
On sparse sensor placement for parameter identification problems with partial differential equations
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Locally sparse and robust partial least squares in scalar-on-function regression
Multiset sparse partial least squares path modeling for high dimensional omics data analysis
Cut!
Faster exact solution of sparse MaxCut and QUBO problems
Discovering sparse interpretable dynamics from partial observations
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
Peak calling by Sparse Enrichment Analysis for CUT&RUN chromatin profiling
Partial Relaxation: A Computationally Efficient Direction-of-Arrival Estimation Framework
Branch and cut for an SDP relaxation of large scale minimum bisection problems
Branch and cut for a semidefinite relaxation of large scale minimum bisection problems
On sparse sensor placement for parameter identification problems with partial differential equations
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Locally sparse and robust partial least squares in scalar-on-function regression
Multiset sparse partial least squares path modeling for high dimensional omics data analysis