Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.
Year: 2004
Type: conference-paper
Institution: University of Tennessee at Knoxville
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W247937228
