Skip to main navigation
Skip to search
Skip to main content
University of Twente Research Information Home
Home
Profiles
Research units
Projects
Research output
Datasets
Activities
Prizes
Press/Media
Search by expertise, name or affiliation
The computational complexity of the minimum weight processor assignment problem
Daniël Paulusma (Speaker)
Discrete Mathematics and Mathematical Programming
Activity
:
Talk or presentation
›
Oral presentation
Description
Plaats van uitgifte: Keio University, Japan
Period
21 Jan 2004
Event title
International Workshop on Combinatorics
Event type
Conference
Location
Keio University, Japan
Show on map
Keywords
METIS-219401
X