Finding total unimodularity in optimization problems solved by linear programs

DOI10.1007/s00453-009-9310-7zbMath1231.90185arXivcs/0602016OpenAlexW2569504991MaRDI QIDQ627545

Mathilde Hurand, Christoph Dürr

Publication date: 2 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0602016

zbMATH Keywords

linear programmingschedulingcachingtotally unimodular matrices

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Variants of Multi-resource Scheduling Problems with Equal Processing Times ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates

Cites Work

• Scheduling jobs with equal processing times and time windows on identical parallel machines
• A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
• Integrated prefetching and caching in single and parallel disk systems
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• On Representatives of Subsets
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Minimizing stall time in single and parallel disk systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding total unimodularity in optimization problems solved by linear programs