-
-
Semidefinite Relaxations for Parallel Machine Scheduling
-
Alix Munier, Maurice Queyranne, and Schulz,
Andreas S.
Approximation Bounds for a General Class of
Precedence Constrained Parallel Machine Scheduling
Problems
-
-
Interval Reductions and Extensions of Orders:
Bijections to Chains in Lattices
-
-
Implementing Weighted b-Matching Algorithms:
Towards a Flexible Software Design
-
-
Approximation in stochastic scheduling: The power of
LP-based priority policies
-
-
Resource constrained project scheduling with time
windows: A branching scheme based on dynamic release
dates
-
-
A computational study on bounding the makespan
distribution
in stochastic project networks
-
-
Scheduling Series-Parallel Orders Subject to
0/1-Communication Delays
-
-
Linear preselective policies for stochastic project
scheduling
-
Frederik Stork
A branch and bound algorithm for minimizing expected
makespan in stochastic project networks with resource
constraints
-
-
Edge-Dominating Trails in AT-free Graphs
-
-
On the Chvátal Rank of Polytopes in the 0/1 Cube
-
-
An Oracle-Polynomial Time Augmentation Algorithm for
Integer Proramming
-
-
Bounds on the Chvátal Rank of Polytopes in
the 0/1-Cube
-
-
Efficient Algorithms for the Minimum-Cost Embedding
of Reliable Virtual Private Networks into
Telecommunication Networks
-
-
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
-
-
Specifying Characteristics of Digital Filters with
FilterPro
