Matching with sizes (or scheduling with processing set restrictions) (Q5892177): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Eric J. McDermid / rank
Normal rank
 
Property / author
 
Property / author: Eric J. McDermid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174395318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching with sizes (or scheduling with processing set restrictions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning papers to referees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-matchings for bipartite graphs and load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-maximal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some things couples always wanted to know about stable matchings (but were afraid to ask) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keeping partners together: Algorithmic results for the hospitals/residents problem with couples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable assignment with couples: parameterized complexity and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete stable matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank

Latest revision as of 19:53, 10 July 2024

scientific article; zbMATH DE number 6484211
Language Label Description Also known as
English
Matching with sizes (or scheduling with processing set restrictions)
scientific article; zbMATH DE number 6484211

    Statements

    Matching with sizes (or scheduling with processing set restrictions) (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    couples
    0 references
    hospitals/residents problem
    0 references
    scheduling
    0 references
    processing set restrictions
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    0 references