CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
3 research outputs found
Randomized Approximation and Online Algorithms for Assignment Problems
Author
Bender Marco
Publication venue
Publication date
23/04/2015
Field of study
Get PDF
Georg-August-University Göttingen
Maximum Generalized Assignment with Convex Costs
Author
A Antoniadis
C Chekuri
+12 more
DB Shmoys
DG Cattrysse
DW Pentico
K Pruhs
L Fleischer
MR Garey
MX Goemans
N Alon
RK Ahuja
S Albers
S Barman
Z Nutov
Publication venue
'Springer Science and Business Media LLC'
Publication date
Field of study
No full text
Crossref
Maximum Generalized Assignment with Convex Costs
Author
A Antoniadis
C Chekuri
+12 more
DB Shmoys
DG Cattrysse
DW Pentico
K Pruhs
L Fleischer
MR Garey
MX Goemans
N Alon
RK Ahuja
S Albers
S Barman
Z Nutov
Publication venue
'Springer Science and Business Media LLC'
Publication date
Field of study
No full text
Crossref