Finding Total Unimodularity in Optimization Problems Solved by Linear Programs-Reference-Cited by-同舟云学术

Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

Published:2006 Issue: Volume: Page:315-326
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Dürr Christoph,Hurand Mathilde

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11841036_30.pdf

Reference10 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)

2. Albers, S., Büttner, M.: Integrated prefetching and caching in single and parallel disk systems. Information and Computation (198), 24–39 (2005)

3. Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM (47), 969–986 (2000)

4. Baptiste, P., Schieber, B.: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. Journal of Scheduling 6(4), 395–404 (2003)

5. Brucker, P., Kravchenko, S.: Scheduling jobs with equal processing times and time windows on identical parallel machines. Osnabrücker Schriften zur Mathematik H 257, Universität Osnabrück. Fachbereich Mathematik/Informatik. Journal of Scheduling (to appear, 2005)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Open Problems in Throughput Scheduling;Algorithms – ESA 2012;2012

2. A decomposition scheme for single stage scheduling problems;Journal of Scheduling;2010-02-13

3. Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput;Parallel Processing and Applied Mathematics;2010

4. Scheduling Jobs with Equal Processing Times;IFAC Proceedings Volumes;2009