---
_id: '62981'
abstract:
- lang: eng
text: "Otus is a high-performance computing cluster that was launched in 2025 and
is operated by the Paderborn Center for Parallel Computing (PC2) at Paderborn
University in Germany. The system is part of the National High Performance Computing
(NHR) initiative. Otus complements the previous supercomputer Noctua 2, offering
approximately twice the computing power while retaining the three node types that
were characteristic of Noctua 2: 1) CPU compute nodes with different memory capacities,
2) high-end GPU nodes, and 3) HPC-grade FPGA nodes. On the Top500 list, which
ranks the 500 most powerful supercomputers in the world, Otus is in position 164
with the CPU partition and in position 255 with the GPU partition (June 2025).
On the Green500 list, ranking the 500 most energy-efficient supercomputers in
the world, Otus is in position 5 with the GPU partition (June 2025).\r\n\r\n\r\nThis
article provides a comprehensive overview of the system in terms of its hardware,
software, system integration, and its overall integration into the data center
building to ensure energy-efficient operation. The article aims to provide unique
insights for scientists using the system and for other centers operating HPC clusters.
The article will be continuously updated to reflect the latest system setup and
measurements. "
author:
- first_name: Sadaf
full_name: Ehtesabi, Sadaf
id: '116116'
last_name: Ehtesabi
- first_name: Manoar
full_name: Hossain, Manoar
id: '114619'
last_name: Hossain
orcid: https://orcid.org/0000-0002-0737-7981
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Andreas
full_name: Krawinkel, Andreas
id: '15275'
last_name: Krawinkel
- first_name: Lukas
full_name: Ostermann, Lukas
id: '69976'
last_name: Ostermann
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Stefan
full_name: Rohde, Stefan
id: '34009'
last_name: Rohde
- first_name: Robert
full_name: Schade, Robert
id: '75963'
last_name: Schade
orcid: 0000-0002-6268-5397
- first_name: Michael
full_name: Schwarz, Michael
id: '5312'
last_name: Schwarz
- first_name: Jens
full_name: Simon, Jens
id: '15273'
last_name: Simon
- first_name: Nils
full_name: Winnwa, Nils
id: '61189'
last_name: Winnwa
- first_name: Alex
full_name: Wiens, Alex
id: '23522'
last_name: Wiens
orcid: 0000-0003-1764-9773
- first_name: Xin
full_name: Wu, Xin
id: '77439'
last_name: Wu
citation:
ama: Ehtesabi S, Hossain M, Kenter T, et al. Otus Supercomputer. Vol 1. Paderborn
Center for Parallel Computing (PC2); 2025. doi:10.48550/ARXIV.2512.07401
apa: Ehtesabi, S., Hossain, M., Kenter, T., Krawinkel, A., Ostermann, L., Plessl,
C., Riebler, H., Rohde, S., Schade, R., Schwarz, M., Simon, J., Winnwa, N., Wiens,
A., & Wu, X. (2025). Otus Supercomputer (Vol. 1). Paderborn Center
for Parallel Computing (PC2). https://doi.org/10.48550/ARXIV.2512.07401
bibtex: '@book{Ehtesabi_Hossain_Kenter_Krawinkel_Ostermann_Plessl_Riebler_Rohde_Schade_Schwarz_et
al._2025, place={Paderborn}, series={PC2 Technical Report Series}, title={Otus
Supercomputer}, volume={1}, DOI={10.48550/ARXIV.2512.07401},
publisher={Paderborn Center for Parallel Computing (PC2)}, author={Ehtesabi, Sadaf
and Hossain, Manoar and Kenter, Tobias and Krawinkel, Andreas and Ostermann, Lukas
and Plessl, Christian and Riebler, Heinrich and Rohde, Stefan and Schade, Robert
and Schwarz, Michael and et al.}, year={2025}, collection={PC2 Technical Report
Series} }'
chicago: 'Ehtesabi, Sadaf, Manoar Hossain, Tobias Kenter, Andreas Krawinkel, Lukas
Ostermann, Christian Plessl, Heinrich Riebler, et al. Otus Supercomputer.
Vol. 1. PC2 Technical Report Series. Paderborn: Paderborn Center for Parallel
Computing (PC2), 2025. https://doi.org/10.48550/ARXIV.2512.07401.'
ieee: 'S. Ehtesabi et al., Otus Supercomputer, vol. 1. Paderborn:
Paderborn Center for Parallel Computing (PC2), 2025.'
mla: Ehtesabi, Sadaf, et al. Otus Supercomputer. Paderborn Center for Parallel
Computing (PC2), 2025, doi:10.48550/ARXIV.2512.07401.
short: S. Ehtesabi, M. Hossain, T. Kenter, A. Krawinkel, L. Ostermann, C. Plessl,
H. Riebler, S. Rohde, R. Schade, M. Schwarz, J. Simon, N. Winnwa, A. Wiens, X.
Wu, Otus Supercomputer, Paderborn Center for Parallel Computing (PC2), Paderborn,
2025.
date_created: 2025-12-09T09:11:04Z
date_updated: 2026-03-25T11:50:31Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
doi: 10.48550/ARXIV.2512.07401
file:
- access_level: open_access
content_type: application/pdf
creator: deffel
date_created: 2025-12-09T09:19:12Z
date_updated: 2026-03-25T11:50:30Z
file_id: '62982'
file_name: 2512.07401v1.pdf
file_size: 4535595
relation: main_file
file_date_updated: 2026-03-25T11:50:30Z
has_accepted_license: '1'
intvolume: ' 1'
keyword:
- Otus
- Supercomputer
- FPGA
- PC2
- Paderborn Center for Parallel Computing
- Noctua 2
- HPC
language:
- iso: eng
oa: '1'
page: '33'
place: Paderborn
publication_status: published
publisher: Paderborn Center for Parallel Computing (PC2)
report_number: PC2TR-2025-1
series_title: PC2 Technical Report Series
status: public
title: Otus Supercomputer
type: report
user_id: '23522'
volume: 1
year: '2025'
...
---
_id: '53663'
abstract:
- lang: eng
text: 'Noctua 2 is a supercomputer operated at the Paderborn Center for Parallel
Computing (PC2) at Paderborn University in Germany. Noctua 2 was inaugurated in
2022 and is an Atos BullSequana XH2000 system. It consists mainly of three node
types: 1) CPU Compute nodes with AMD EPYC processors in different main memory
configurations, 2) GPU nodes with NVIDIA A100 GPUs, and 3) FPGA nodes with Xilinx
Alveo U280 and Intel Stratix 10 FPGA cards. While CPUs and GPUs are known off-the-shelf
components in HPC systems, the operation of a large number of FPGA cards from
different vendors and a dedicated FPGA-to-FPGA network are unique characteristics
of Noctua 2. This paper describes in detail the overall setup of Noctua 2 and
gives insights into the operation of the cluster from a hardware, software and
facility perspective.'
article_type: original
author:
- first_name: Carsten
full_name: Bauer, Carsten
id: '90082'
last_name: Bauer
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Lukas
full_name: Mazur, Lukas
id: '90492'
last_name: Mazur
orcid: ' 0000-0001-6304-7082'
- first_name: Marius
full_name: Meyer, Marius
id: '40778'
last_name: Meyer
- first_name: Holger
full_name: Nitsche, Holger
id: '15272'
last_name: Nitsche
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Robert
full_name: Schade, Robert
id: '75963'
last_name: Schade
orcid: 0000-0002-6268-5397
- first_name: Michael
full_name: Schwarz, Michael
id: '5312'
last_name: Schwarz
- first_name: Nils
full_name: Winnwa, Nils
id: '61189'
last_name: Winnwa
- first_name: Alex
full_name: Wiens, Alex
id: '23522'
last_name: Wiens
orcid: 0000-0003-1764-9773
- first_name: Xin
full_name: Wu, Xin
id: '77439'
last_name: Wu
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Jens
full_name: Simon, Jens
id: '15273'
last_name: Simon
citation:
ama: Bauer C, Kenter T, Lass M, et al. Noctua 2 Supercomputer. Journal of large-scale
research facilities. 2024;9. doi:10.17815/jlsrf-8-187
apa: Bauer, C., Kenter, T., Lass, M., Mazur, L., Meyer, M., Nitsche, H., Riebler,
H., Schade, R., Schwarz, M., Winnwa, N., Wiens, A., Wu, X., Plessl, C., &
Simon, J. (2024). Noctua 2 Supercomputer. Journal of Large-Scale Research Facilities,
9. https://doi.org/10.17815/jlsrf-8-187
bibtex: '@article{Bauer_Kenter_Lass_Mazur_Meyer_Nitsche_Riebler_Schade_Schwarz_Winnwa_et
al._2024, title={Noctua 2 Supercomputer}, volume={9}, DOI={10.17815/jlsrf-8-187 }, journal={Journal of large-scale research facilities},
author={Bauer, Carsten and Kenter, Tobias and Lass, Michael and Mazur, Lukas and
Meyer, Marius and Nitsche, Holger and Riebler, Heinrich and Schade, Robert and
Schwarz, Michael and Winnwa, Nils and et al.}, year={2024} }'
chicago: Bauer, Carsten, Tobias Kenter, Michael Lass, Lukas Mazur, Marius Meyer,
Holger Nitsche, Heinrich Riebler, et al. “Noctua 2 Supercomputer.” Journal
of Large-Scale Research Facilities 9 (2024). https://doi.org/10.17815/jlsrf-8-187 .
ieee: 'C. Bauer et al., “Noctua 2 Supercomputer,” Journal of large-scale
research facilities, vol. 9, 2024, doi: 10.17815/jlsrf-8-187 .'
mla: Bauer, Carsten, et al. “Noctua 2 Supercomputer.” Journal of Large-Scale
Research Facilities, vol. 9, 2024, doi:10.17815/jlsrf-8-187 .
short: C. Bauer, T. Kenter, M. Lass, L. Mazur, M. Meyer, H. Nitsche, H. Riebler,
R. Schade, M. Schwarz, N. Winnwa, A. Wiens, X. Wu, C. Plessl, J. Simon, Journal
of Large-Scale Research Facilities 9 (2024).
date_created: 2024-04-26T07:39:41Z
date_updated: 2024-04-26T08:44:30Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
doi: '10.17815/jlsrf-8-187 '
file:
- access_level: open_access
content_type: application/pdf
creator: deffel
date_created: 2024-04-26T07:30:20Z
date_updated: 2024-04-26T08:35:17Z
file_id: '53664'
file_name: Noctua2_Supercomputer.pdf
file_size: 3825480
relation: main_file
file_date_updated: 2024-04-26T08:35:17Z
has_accepted_license: '1'
intvolume: ' 9'
keyword:
- Noctua 2
- Supercomputer
- FPGA
- PC2
- Paderborn Center for Parallel Computing
language:
- iso: eng
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Journal of large-scale research facilities
publication_status: published
status: public
title: Noctua 2 Supercomputer
type: journal_article
user_id: '8961'
volume: 9
year: '2024'
...
---
_id: '24551'
abstract:
- lang: eng
text: "Access to precise meteorological data is crucial to be able to plan and install
renewable energy systems \r\nsuch as solar power plants and wind farms. In case
of solar energy, knowledge of local irradiance and air temperature \r\nvalues
is very important. For this, various methods can be used such as installing local
weather stations or using \r\nmeteorological data from different organizations
such as Meteonorm or official Deutscher Wetterdienst (DWD). An \r\nalternative
is to use satellite reanalysis datasets provided by organizations like the National
Aeronautics and Space \r\nAdministration (NASA) and European Centre for Medium-Range
Weather Forecasts (ECMWF). In this paper the \r\n“Modern-Era Retrospective analysis
for Research and Applications” dataset version 2 (MERRA-2) will be presented,
\r\nand its performance will be evaluated by comparing it to locally measured
datasets provided by Meteonorm and DWD. \r\nThe analysis shows very high correlation
between MERRA-2 and local measurements (correlation coefficients of 0.99) \r\nfor
monthly global irradiance and air temperature values. The results prove the suitability
of MERRA-2 data for \r\napplications requiring long historical data. Moreover,
availability of MERRA-2 for the whole world with an acceptable \r\nresolution
makes it a very valuable dataset."
author:
- first_name: Arash
full_name: Khatibi, Arash
id: '43538'
last_name: Khatibi
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
citation:
ama: 'Khatibi A, Krauter S. Comparison and Validation of Irradiance Data: Satellite
Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather Service (DWD).
In: Proceedings of the 38th European Photovoltaic Solar Energy Conference and
Exhibition (EUPVSEC 2021). ; 2021:1141-1147. doi:10.4229/EUPVSEC20212021-5BV.4.11'
apa: 'Khatibi, A., & Krauter, S. (2021). Comparison and Validation of Irradiance
Data: Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather
Service (DWD). Proceedings of the 38th European Photovoltaic Solar Energy Conference
and Exhibition (EUPVSEC 2021), 1141–1147. https://doi.org/10.4229/EUPVSEC20212021-5BV.4.11'
bibtex: '@inproceedings{Khatibi_Krauter_2021, title={Comparison and Validation of
Irradiance Data: Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German
Weather Service (DWD)}, DOI={10.4229/EUPVSEC20212021-5BV.4.11},
booktitle={Proceedings of the 38th European Photovoltaic Solar Energy Conference
and Exhibition (EUPVSEC 2021)}, author={Khatibi, Arash and Krauter, Stefan}, year={2021},
pages={1141–1147} }'
chicago: 'Khatibi, Arash, and Stefan Krauter. “Comparison and Validation of Irradiance
Data: Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather
Service (DWD).” In Proceedings of the 38th European Photovoltaic Solar Energy
Conference and Exhibition (EUPVSEC 2021), 1141–47, 2021. https://doi.org/10.4229/EUPVSEC20212021-5BV.4.11.'
ieee: 'A. Khatibi and S. Krauter, “Comparison and Validation of Irradiance Data:
Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather Service
(DWD),” in Proceedings of the 38th European Photovoltaic Solar Energy Conference
and Exhibition (EUPVSEC 2021), 2021, pp. 1141–1147, doi: 10.4229/EUPVSEC20212021-5BV.4.11.'
mla: 'Khatibi, Arash, and Stefan Krauter. “Comparison and Validation of Irradiance
Data: Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather
Service (DWD).” Proceedings of the 38th European Photovoltaic Solar Energy
Conference and Exhibition (EUPVSEC 2021), 2021, pp. 1141–47, doi:10.4229/EUPVSEC20212021-5BV.4.11.'
short: 'A. Khatibi, S. Krauter, in: Proceedings of the 38th European Photovoltaic
Solar Energy Conference and Exhibition (EUPVSEC 2021), 2021, pp. 1141–1147.'
conference:
end_date: 2021-09-10
name: 38th European Photovoltaic Solar Energy Conference and Exhibition (EUPVSEC
2021)
start_date: 2021-09-06
date_created: 2021-09-16T10:20:41Z
date_updated: 2022-01-06T13:29:51Z
ddc:
- '550'
department:
- _id: '53'
doi: 10.4229/EUPVSEC20212021-5BV.4.11
file:
- access_level: closed
content_type: application/pdf
creator: krauter
date_created: 2022-01-06T13:26:47Z
date_updated: 2022-01-06T13:26:47Z
file_id: '29176'
file_name: Khatibi Krauter - MERRA 2 vs Meteonorm - EUPVSEC 2021.pdf
file_size: 2475972
relation: main_file
success: 1
file_date_updated: 2022-01-06T13:26:47Z
has_accepted_license: '1'
keyword:
- Energy potential estimation
- Photovoltaic
- Solar radiation
- Temperature measurement
- Satellite data
- Meteonorm
- MERRA-2
- DWD
language:
- iso: eng
page: 1141 - 1147
publication: Proceedings of the 38th European Photovoltaic Solar Energy Conference
and Exhibition (EUPVSEC 2021)
publication_identifier:
isbn:
- 3-936338-78-7
publication_status: published
quality_controlled: '1'
status: public
title: 'Comparison and Validation of Irradiance Data: Satellite Meteorological Dataset
MERRA-2 vs. Meteonorm and German Weather Service (DWD)'
type: conference
user_id: '28836'
year: '2021'
...
---
_id: '21265'
abstract:
- lang: eng
text: Fast-growing energy demand of the world makes the researchers focus
on finding new energy sources or optimizing already-developed approaches. For
an efficient use of solar and wind energy in an energy system, correct design
and sizing of a power system is of high importance and improving or optimizing
the process of data obtaining for this purpose leads to higher performance and
lower cost per unit of energy. It is essential to have the most precise possible
estimation of solar and wind energy potential and other local weather parameters
in order to fully feed the demand and avoid extra costs. There are various methods
for obtaining local data, such as local measurements, official organizational
data, satellite obtained, and reanalysis data. In this paper, the Modern-Era Retrospective
analysis for Research and Applications dataset version 2 (MERRA-2) dataset provided
by NASA is introduced and its performance is evaluated by comparison to various
locally measured datasets offered by meteorological institutions such as Meteonorm
and Deutscher Wetterdienst (DWD, or Germany’s National Meteorological Service)
around the world. After comparison, correlation coefficients from 0.95 to 0.99
are observed for monthly global horizontal irradiance values. In the case of air
temperature, correlation coefficients of 0.99 and for wind speed from 0.81 to
0.99 are observed. High correlation with ground measurements and relatively low
errors are confirmed, especially for irradiance and temperature values, that makes
MERRA-2 a valuable dataset, considering its world coverage and availability.
article_number: '882'
article_type: original
author:
- first_name: Arash
full_name: Khatibi, Arash
id: '43538'
last_name: Khatibi
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
citation:
ama: Khatibi A, Krauter S. Validation and Performance of Satellite Meteorological
Dataset MERRA-2 for Solar and Wind Applications. Energies. 2021;14(4).
doi:10.3390/en14040882
apa: Khatibi, A., & Krauter, S. (2021). Validation and Performance of Satellite
Meteorological Dataset MERRA-2 for Solar and Wind Applications. Energies,
14(4), Article 882. https://doi.org/10.3390/en14040882
bibtex: '@article{Khatibi_Krauter_2021, title={Validation and Performance of Satellite
Meteorological Dataset MERRA-2 for Solar and Wind Applications}, volume={14},
DOI={10.3390/en14040882}, number={4882},
journal={Energies}, publisher={MDPI}, author={Khatibi, Arash and Krauter, Stefan},
year={2021} }'
chicago: Khatibi, Arash, and Stefan Krauter. “Validation and Performance of Satellite
Meteorological Dataset MERRA-2 for Solar and Wind Applications.” Energies
14, no. 4 (2021). https://doi.org/10.3390/en14040882.
ieee: 'A. Khatibi and S. Krauter, “Validation and Performance of Satellite Meteorological
Dataset MERRA-2 for Solar and Wind Applications,” Energies, vol. 14, no.
4, Art. no. 882, 2021, doi: 10.3390/en14040882.'
mla: Khatibi, Arash, and Stefan Krauter. “Validation and Performance of Satellite
Meteorological Dataset MERRA-2 for Solar and Wind Applications.” Energies,
vol. 14, no. 4, 882, MDPI, 2021, doi:10.3390/en14040882.
short: A. Khatibi, S. Krauter, Energies 14 (2021).
date_created: 2021-02-23T10:18:05Z
date_updated: 2022-01-06T13:37:34Z
ddc:
- '620'
department:
- _id: '53'
doi: 10.3390/en14040882
file:
- access_level: closed
content_type: application/pdf
creator: krauter
date_created: 2022-01-06T13:33:09Z
date_updated: 2022-01-06T13:33:09Z
file_id: '29177'
file_name: energies-14-00882 Khatibi Krauter MERRA 2.pdf
file_size: 3837152
relation: main_file
success: 1
file_date_updated: 2022-01-06T13:33:09Z
has_accepted_license: '1'
intvolume: ' 14'
issue: '4'
keyword:
- Solar irradiance
- MERRA 2
- Meteonorm
- DWD
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/1996-1073/14/4/882/htm
oa: '1'
publication: Energies
publication_identifier:
issn:
- 1996-1073
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Validation and Performance of Satellite Meteorological Dataset MERRA-2 for
Solar and Wind Applications
type: journal_article
user_id: '28836'
volume: 14
year: '2021'
...
---
_id: '27551'
author:
- first_name: Janis
full_name: Ludwig, Janis
id: '45788'
last_name: Ludwig
orcid: 0009-0001-1348-496X
- first_name: Carsten
full_name: Kykal, Carsten
last_name: Kykal
- first_name: Hans-Joachim
full_name: Schmid, Hans-Joachim
id: '464'
last_name: Schmid
orcid: 000-0001-8590-1921
citation:
ama: 'Ludwig J, Kykal C, Schmid H-J. Assessing spreading and removal of virus laden
aerosols in different settings using an aerosol method (oral presentation). In:
The Aerosol Society, ed. Book of Abstracts for the 2021 European Aerosol Conference.
; 2021.'
apa: Ludwig, J., Kykal, C., & Schmid, H.-J. (2021). Assessing spreading and
removal of virus laden aerosols in different settings using an aerosol method
(oral presentation). In The Aerosol Society (Ed.), Book of abstracts for the
2021 European Aerosol Conference.
bibtex: '@inproceedings{Ludwig_Kykal_Schmid_2021, title={Assessing spreading and
removal of virus laden aerosols in different settings using an aerosol method
(oral presentation)}, booktitle={Book of abstracts for the 2021 European Aerosol
Conference}, author={Ludwig, Janis and Kykal, Carsten and Schmid, Hans-Joachim},
editor={The Aerosol Society}, year={2021} }'
chicago: Ludwig, Janis, Carsten Kykal, and Hans-Joachim Schmid. “Assessing Spreading
and Removal of Virus Laden Aerosols in Different Settings Using an Aerosol Method
(Oral Presentation).” In Book of Abstracts for the 2021 European Aerosol Conference,
edited by The Aerosol Society, 2021.
ieee: J. Ludwig, C. Kykal, and H.-J. Schmid, “Assessing spreading and removal of
virus laden aerosols in different settings using an aerosol method (oral presentation),”
in Book of abstracts for the 2021 European Aerosol Conference, 2021.
mla: Ludwig, Janis, et al. “Assessing Spreading and Removal of Virus Laden Aerosols
in Different Settings Using an Aerosol Method (Oral Presentation).” Book of
Abstracts for the 2021 European Aerosol Conference, edited by The Aerosol
Society, 2021.
short: 'J. Ludwig, C. Kykal, H.-J. Schmid, in: The Aerosol Society (Ed.), Book of
Abstracts for the 2021 European Aerosol Conference, 2021.'
conference:
end_date: 2021-09-03
name: European Aerosol Conference
start_date: 2021-08-30
corporate_editor:
- The Aerosol Society
date_created: 2021-11-18T10:53:35Z
date_updated: 2025-09-18T08:45:49Z
ddc:
- '660'
department:
- _id: '150'
- _id: '9'
file:
- access_level: closed
content_type: application/pdf
creator: jludwig
date_created: 2021-11-18T10:52:58Z
date_updated: 2021-11-18T10:52:58Z
file_id: '27552'
file_name: abstract_EAC2021_UPB.pdf
file_size: 160577
relation: main_file
success: 1
file_date_updated: 2021-11-18T10:52:58Z
has_accepted_license: '1'
keyword:
- aerosol spreading
- SARS-CoV-2
- indoor air filtration
language:
- iso: eng
publication: Book of abstracts for the 2021 European Aerosol Conference
status: public
title: Assessing spreading and removal of virus laden aerosols in different settings
using an aerosol method (oral presentation)
type: conference_abstract
user_id: '45788'
year: '2021'
...
---
_id: '8161'
abstract:
- lang: eng
text: The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing
separations in computational complexity theory (modulo standard conjectures such
as PH does not collapse). Here, we study whether two quantum generalizations of
PH can similarly prove separations in the quantum setting. The first generalization,
QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the
former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem.
For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid
Method for efficiently solving semidefinite programs. These results yield two
implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled
proofs, a complexity class whose characterization has proven difficult. First,
if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to
make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting
Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e.,
alternating quantifiers do not help in the presence of "unentanglement"), QMA(2)
is strictly contained in NEXP.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Miklos
full_name: Santha, Miklos
last_name: Santha
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
- first_name: Aarthi
full_name: Sundaram, Aarthi
last_name: Sundaram
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis
P, Worrell J, eds. 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16.
doi:10.4230/LIPIcs.MFCS.2018.58'
apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018).
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).
In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p.
58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
bibtex: '@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Quantum Generalizations of the Polynomial Hierarchy with Applications to
QMA(2)}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.58},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi
and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James},
year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin
Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications
to QMA(2).” In 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James
Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.58.'
ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2),” in 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool,
UK, 2018, vol. 117, p. 58:1-58:16, doi: 10.4230/LIPIcs.MFCS.2018.58.'
mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy
with Applications to QMA(2).” 43rd International Symposium on Mathematical
Foundations of Computer Science (MFCS 2018), edited by Igor Potapov et al.,
vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16,
doi:10.4230/LIPIcs.MFCS.2018.58.
short: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov,
P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany, 2018, p. 58:1-58:16.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:29:44Z
date_updated: 2023-02-28T11:01:03Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.58
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1805.11139'
intvolume: ' 117'
keyword:
- Complexity Theory
- Quantum Computing
- Polynomial Hierarchy
- Semidefinite Programming
- QMA(2)
- Quantum Complexity
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640
oa: '1'
page: 58:1-58:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '8160'
abstract:
- lang: eng
text: An important task in quantum physics is the estimation of local quantities
for ground states of local Hamiltonians. Recently, Ambainis defined the complexity
class P^QMA[log], and motivated its study by showing that the physical task of
estimating the expectation value of a local observable against the ground state
of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the
study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness
result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We
show that simulating even a single qubit measurement on ground states of 5-local
Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We
formalize the complexity theoretic study of estimating two-point correlation functions
against ground states, and show that this task is similarly P^QMA[log]-complete.
P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally
by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung
to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP
from Kitaev and Watrous. A central theme of this work is the subtlety involved
in the study of oracle classes in which the oracle solves a promise problem. In
this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness
proof for estimating spectral gaps of local Hamiltonians. By introducing a "query
validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness
for estimating spectral gaps under polynomial-time Turing reductions.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum
Systems. In: Wilde M, ed. 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017). Vol 73. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17.
doi:10.4230/LIPIcs.TQC.2017.2'
apa: Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements
on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
bibtex: '@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating
Local Measurements on Quantum Systems}, volume={73}, DOI={10.4230/LIPIcs.TQC.2017.2},
booktitle={12th Conference on the Theory of Quantum Computation, Communication
and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark},
year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local
Measurements on Quantum Systems.” In 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017), edited by Mark Wilde,
73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.TQC.2017.2.'
ieee: 'S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements
on Quantum Systems,” in 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), Paris, France, 2018, vol. 73, p.
2:1-2:17, doi: 10.4230/LIPIcs.TQC.2017.2.'
mla: Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements
on Quantum Systems.” 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), edited by Mark Wilde, vol. 73,
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:10.4230/LIPIcs.TQC.2017.2.
short: 'S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory
of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.'
conference:
location: Paris, France
name: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography
(TQC 2017)
date_created: 2019-03-01T11:25:27Z
date_updated: 2023-02-28T11:00:48Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.TQC.2017.2
editor:
- first_name: Mark
full_name: Wilde, Mark
last_name: Wilde
external_id:
arxiv:
- '1606.05626'
intvolume: ' 73'
keyword:
- Complexity theory
- Quantum Merlin Arthur (QMA)
- local Hamiltonian
- local measurement
- spectral gap
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577
oa: '1'
page: 2:1-2:17
place: Dagstuhl, Germany
publication: 12th Conference on the Theory of Quantum Computation, Communication and
Cryptography (TQC 2017)
publication_identifier:
unknown:
- 978-3-95977-034-7
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Complexity of Simulating Local Measurements on Quantum Systems
type: conference
user_id: '71541'
volume: 73
year: '2018'
...
---
_id: '8159'
abstract:
- lang: eng
text: The Boolean constraint satisfaction problem 3-SAT is arguably the canonical
NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial
time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically
motivated generalization of k-SAT to the quantum setting, defining the problem
"quantum k-SAT". He showed that quantum 2-SAT is also solvable in polynomial time
on a classical computer, in particular in deterministic time O(n^4), assuming
unit-cost arithmetic over a field extension of the rational numbers, where n is
number of variables. In this paper, we present an algorithm for quantum 2-SAT
which runs in linear time, i.e. deterministic time O(n+m) for n and m the number
of variables and clauses, respectively. Our approach exploits the transfer matrix
techniques of Laumann et al. [QIC, 2010] used in the study of phase transitions
for random quantum 2-SAT, and bears similarities with both the linear time 2-SAT
algorithms of Even, Itai, and Shamir (based on backtracking) [SICOMP, 1976] and
Aspvall, Plass, and Tarjan (based on strongly connected components) [IPL, 1979].
author:
- first_name: Niel
full_name: de Beaudrap, Niel
last_name: de Beaudrap
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: 'de Beaudrap N, Gharibian S. A Linear Time Algorithm for Quantum 2-SAT. In:
Raz R, ed. Proceedings of the 31st Conference on Computational Complexity (CCC
2016). Vol 50. Leibniz International Proceedings in Informatics (LIPIcs).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2016:27:1-17:21. doi:10.4230/LIPIcs.CCC.2016.27'
apa: de Beaudrap, N., & Gharibian, S. (2016). A Linear Time Algorithm for Quantum
2-SAT. In R. Raz (Ed.), Proceedings of the 31st Conference on Computational
Complexity (CCC 2016) (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.27
bibtex: '@inproceedings{de Beaudrap_Gharibian_2016, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={A Linear Time Algorithm
for Quantum 2-SAT}, volume={50}, DOI={10.4230/LIPIcs.CCC.2016.27},
booktitle={Proceedings of the 31st Conference on Computational Complexity (CCC
2016)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={de
Beaudrap, Niel and Gharibian, Sevag}, editor={Raz, Ran}, year={2016}, pages={27:1–17:21},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Beaudrap, Niel de, and Sevag Gharibian. “A Linear Time Algorithm for Quantum
2-SAT.” In Proceedings of the 31st Conference on Computational Complexity (CCC
2016), edited by Ran Raz, 50:27:1-17:21. Leibniz International Proceedings
in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2016. https://doi.org/10.4230/LIPIcs.CCC.2016.27.'
ieee: 'N. de Beaudrap and S. Gharibian, “A Linear Time Algorithm for Quantum 2-SAT,”
in Proceedings of the 31st Conference on Computational Complexity (CCC 2016),
Tokyo, Japan, 2016, vol. 50, p. 27:1–17:21, doi: 10.4230/LIPIcs.CCC.2016.27.'
mla: de Beaudrap, Niel, and Sevag Gharibian. “A Linear Time Algorithm for Quantum
2-SAT.” Proceedings of the 31st Conference on Computational Complexity (CCC
2016), edited by Ran Raz, vol. 50, Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik, 2016, p. 27:1-17:21, doi:10.4230/LIPIcs.CCC.2016.27.
short: 'N. de Beaudrap, S. Gharibian, in: R. Raz (Ed.), Proceedings of the 31st
Conference on Computational Complexity (CCC 2016), Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, Dagstuhl, Germany, 2016, p. 27:1–17:21.'
conference:
location: Tokyo, Japan
name: 31st Conference on Computational Complexity (CCC 2016)
date_created: 2019-03-01T11:19:54Z
date_updated: 2023-02-28T11:01:53Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.CCC.2016.27
editor:
- first_name: Ran
full_name: Raz, Ran
last_name: Raz
extern: '1'
external_id:
arxiv:
- '1508.07338'
intvolume: ' 50'
keyword:
- quantum 2-SAT
- transfer matrix
- strongly connected components
- limited backtracking
- local Hamiltonian
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/volltexte/2016/5836/
oa: '1'
page: 27:1-17:21
place: Dagstuhl, Germany
publication: Proceedings of the 31st Conference on Computational Complexity (CCC 2016)
publication_identifier:
isbn:
- 978-3-95977-008-8
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: A Linear Time Algorithm for Quantum 2-SAT
type: conference
user_id: '71541'
volume: 50
year: '2016'
...
---
_id: '48889'
abstract:
- lang: eng
text: Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization
problems. With this paper we contribute to the understanding of the success of
2-opt based local search algorithms for solving the traveling salesperson problem
(TSP). Although 2-opt is widely used in practice, it is hard to understand its
success from a theoretical perspective. We take a statistical approach and examine
the features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based
Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.
Annals of Mathematics and Artificial Intelligence. 2013;69(2):151–182.
doi:10.1007/s10472-013-9341-2
apa: Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann,
F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem. Annals of Mathematics and Artificial
Intelligence, 69(2), 151–182. https://doi.org/10.1007/s10472-013-9341-2
bibtex: '@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A
Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling
Salesperson Problem}, volume={69}, DOI={10.1007/s10472-013-9341-2},
number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann,
Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob
and Neumann, Frank}, year={2013}, pages={151–182} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek,
and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem.” Annals of Mathematics and Artificial
Intelligence 69, no. 2 (2013): 151–182. https://doi.org/10.1007/s10472-013-9341-2.'
ieee: 'O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann,
“A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem,” Annals of Mathematics and Artificial Intelligence,
vol. 69, no. 2, pp. 151–182, 2013, doi: 10.1007/s10472-013-9341-2.'
mla: Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm
Performance for the Traveling Salesperson Problem.” Annals of Mathematics and
Artificial Intelligence, vol. 69, no. 2, 2013, pp. 151–182, doi:10.1007/s10472-013-9341-2.
short: O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals
of Mathematics and Artificial Intelligence 69 (2013) 151–182.
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:50:41Z
department:
- _id: '819'
doi: 10.1007/s10472-013-9341-2
intvolume: ' 69'
issue: '2'
keyword:
- 2-opt
- 90B06
- Classification
- Feature selection
- MARS
- TSP
language:
- iso: eng
page: 151–182
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
issn:
- 1012-2443
status: public
title: A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem
type: journal_article
user_id: '102979'
volume: 69
year: '2013'
...
---
_id: '48890'
abstract:
- lang: eng
text: With this paper we contribute to the understanding of the success of 2-opt
based local search algorithms for solving the traveling salesman problem TSP.
Although 2-opt is widely used in practice, it is hard to understand its success
from a theoretical perspective. We take a statistical approach and examine the
features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search
and the Traveling Salesman Problem: A Feature-Based Characterization of Problem
Hardness. In: Revised Selected Papers of the 6th International Conference on
Learning and Intelligent Optimization - Volume 7219. LION 6. Springer-Verlag;
2012:115–129.'
apa: 'Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., & Neumann,
F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness. Revised Selected Papers of the 6th International Conference
on Learning and Intelligent Optimization - Volume 7219, 115–129.'
bibtex: '@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin,
Heidelberg}, series={LION 6}, title={Local Search and the Traveling Salesman Problem:
A Feature-Based Characterization of Problem Hardness}, booktitle={Revised Selected
Papers of the 6th International Conference on Learning and Intelligent Optimization
- Volume 7219}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Bischl,
Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank},
year={2012}, pages={115–129}, collection={LION 6} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner,
and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness.” In Revised Selected Papers of the 6th
International Conference on Learning and Intelligent Optimization - Volume 7219,
115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.'
ieee: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann,
“Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness,” in Revised Selected Papers of the 6th International Conference
on Learning and Intelligent Optimization - Volume 7219, 2012, pp. 115–129.'
mla: 'Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A
Feature-Based Characterization of Problem Hardness.” Revised Selected Papers
of the 6th International Conference on Learning and Intelligent Optimization -
Volume 7219, Springer-Verlag, 2012, pp. 115–129.'
short: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann,
in: Revised Selected Papers of the 6th International Conference on Learning and
Intelligent Optimization - Volume 7219, Springer-Verlag, Berlin, Heidelberg, 2012,
pp. 115–129.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:48:58Z
department:
- _id: '819'
extern: '1'
keyword:
- 2-opt
- Classification
- Feature Selection
- MARS
- TSP
language:
- iso: eng
page: 115–129
place: Berlin, Heidelberg
publication: Revised Selected Papers of the 6th International Conference on Learning
and Intelligent Optimization - Volume 7219
publication_identifier:
isbn:
- 978-3-642-34412-1
publisher: Springer-Verlag
series_title: LION 6
status: public
title: 'Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness'
type: conference
user_id: '102979'
year: '2012'
...