Finding total unimodularity in optimization problems solved by linear programs
From MaRDI portal
Publication:627545
DOI10.1007/s00453-009-9310-7zbMath1231.90185arXivcs/0602016MaRDI 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
90B35: Deterministic scheduling theory in operations research
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Bicriteria multi-machine scheduling with equal processing times subject to release dates, Variants of Multi-resource Scheduling Problems with Equal Processing Times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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