- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1862-4480
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On the exact separation of cover inequalities of maximum-depth ; day:1 ; month:5 ; year:2021 ; pages:1-21
Optimization letters ; (1.5.2021), 1-21
- Creator
-
Catanzaro, Daniele
Coniglio, Stefano
Furini, Fabio
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11590-021-01741-0
- URN
-
urn:nbn:de:101:1-2021090519524421457527
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 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
- Catanzaro, Daniele
- Coniglio, Stefano
- Furini, Fabio
- SpringerLink (Online service)
Other Objects (12)
Exact solutions in log-concave maximum likelihood estimation
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact and approximate maximum inner product search with LEMP
Maximum depth extensions for Hydrozoa, Tunicata and Ctenophora
Dynamic integral inequalities on time scales with ‘maxima’
Nonlinear integral inequalities on time scales with ‘maxima’
Exact maximum-likelihood method to detect patterns in real networks
Maximum Principles for Inhomogeneous Elliptic Inequalities on Complete Riemannian Manifolds
Best Constants for Adams’ Inequalities with the Exact Growth Condition in ℝ n
A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Exact solutions in log-concave maximum likelihood estimation
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact and approximate maximum inner product search with LEMP
Maximum depth extensions for Hydrozoa, Tunicata and Ctenophora
Dynamic integral inequalities on time scales with ‘maxima’
Nonlinear integral inequalities on time scales with ‘maxima’
Exact maximum-likelihood method to detect patterns in real networks
Maximum Principles for Inhomogeneous Elliptic Inequalities on Complete Riemannian Manifolds
Best Constants for Adams’ Inequalities with the Exact Growth Condition in ℝ n
A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Exact solutions in log-concave maximum likelihood estimation
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact and approximate maximum inner product search with LEMP
Maximum depth extensions for Hydrozoa, Tunicata and Ctenophora
Dynamic integral inequalities on time scales with ‘maxima’
Nonlinear integral inequalities on time scales with ‘maxima’
Exact maximum-likelihood method to detect patterns in real networks
Maximum Principles for Inhomogeneous Elliptic Inequalities on Complete Riemannian Manifolds
Best Constants for Adams’ Inequalities with the Exact Growth Condition in ℝ n
A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history