Frederik Stork - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2005

On the generation of circuits and minimal forbidden setsFrederik Stork, Marc Uetz. mp, 102(1):185-203, 2005. [doi]

On the generation of circuits and minimal forbidden setsFrederik Stork, Marc Uetz. mp, 102(1):205, 2005. [doi]

2004

Scheduling with AND/OR Precedence ConstraintsRolf H. Möhring, Martin Skutella, Frederik Stork. SICOMP, 33(2):393-415, 2004. [doi]

2003

Solving Project Scheduling Problems by Minimum Cut ComputationsRolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz. mansci, 49(3):330-350, 2003. [doi]

Enumeration of Circuits and Minimal Forbidden SetsFrederik Stork, Marc Uetz. endm, 13:108-111, 2003. [doi]

2001

A Computational Study on Bounding the Makespan Distribution in Stochastic Project NetworksArfst Ludwig, Rolf H. Möhring, Frederik Stork. anor, 102(1-4):49-64, 2001. [doi]

On project scheduling with irregular starting time costsRolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz. orl, 28(4):149-154, 2001. [doi]

2000

Linear preselective policies for stochastic project schedulingRolf H. Möhring, Frederik Stork. mmor, 52(3):501-515, 2000. [doi]

Forcing relations for AND/OR precedence constraintsRolf H. Möhring, Martin Skutella, Frederik Stork. soda 2000: 235-236 [doi]

1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut ProblemsRolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz. esa 1999: 139-150 [doi]

Sign in or sign up to see more results.

runs on WebDSL