- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9338
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Deciding the feasibility of a booking in the European gas market is coNP-hard ; day:30 ; month:6 ; year:2022 ; pages:1-28
Annals of operations research ; (30.6.2022), 1-28
- Creator
-
Thürauf, Johannes
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10479-022-04732-1
- URN
-
urn:nbn:de:101:1-2022082109200798668331
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:26 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
- Thürauf, Johannes
- SpringerLink (Online service)
Other Objects (12)
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deciding to distrust
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deciding to distrust
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems