Dynamic Sparsification for Quadratic Assignment Problems

John, Maximilian; Karrenbauer, Andreas

doi:10.1007/978-3-030-22629-9_17

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dynamic Sparsification for Quadratic Assignment Problems

MPS-Authors

/persons/resource/persons127717

John, Maximilian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer, Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

John, M., & Karrenbauer, A. (2019). Dynamic Sparsification for Quadratic Assignment Problems. In M. Khachay, Y. Kochetov, & P. Pardalos (Eds.), Mathematical Optimization Theory and Operations Research (pp. 232-264). Berlin: Springer. doi:10.1007/978-3-030-22629-9_17.

Cite as: https://hdl.handle.net/21.11116/0000-0005-1DA8-E

Abstract

There is no abstract available