Frederik Stork

According to our database, Frederik Stork authored at least 9 papers between 1999 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

On the generation of circuits and minimal forbidden sets.

Frederik Stork, Marc Uetz

Math. Program., 2005

2004

Scheduling with AND/OR Precedence Constraints.

Rolf H. Möhring, Martin Skutella, Frederik Stork

SIAM J. Comput., 2004

2003

Solving Project Scheduling Problems by Minimum Cut Computations.

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz

Manag. Sci., 2003

Enumeration of Circuits and Minimal Forbidden Sets.

Frederik Stork, Marc Uetz

Electron. Notes Discret. Math., 2003

2001

On project scheduling with irregular starting time costs.

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz

Oper. Res. Lett., 2001

A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks.

Arfst Ludwig, Rolf H. Möhring, Frederik Stork

Ann. Oper. Res., 2001

2000

Linear preselective policies for stochastic project scheduling.

Rolf H. Möhring, Frederik Stork

Math. Methods Oper. Res., 2000

Forcing relations for AND/OR precedence constraints.

Rolf H. Möhring, Martin Skutella, Frederik Stork

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz

Proceedings of the Algorithms, 1999