Finding total unimodularity in optimization problems solved by linear programs (Q627545): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated prefetching and caching in single and parallel disk systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing stall time in single and parallel disk systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank

Latest revision as of 19:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Finding total unimodularity in optimization problems solved by linear programs
scientific article

    Statements

    Identifiers