Schulz Andreas S.

Andreas S. Schulz

Information about the author Andreas S. Schulz will soon be added to the site.
Found 12 papers in total
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
2008
Motivated by the need to deal with imprecise data in real-world optimization problems,...
Fast, fair, and efficient flows in networks
Fast, fair, and efficient flows in networks
2007
We study the problem of minimizing the maximum latency of flows in networks with...
System-optimal routing of traffic flows with user constraints in networks with congestion
System-optimal routing of traffic flows with user constraints in networks with congestion
2005
The design of route guidance systems faces a well-known dilemma. The approach that...
Selfish routing in capacitated networks
Selfish routing in capacitated networks
2004
According to Wardrop's first principle, agents in a congested network choose their...
Single-machine scheduling with precedence constraints
Single-machine scheduling with precedence constraints
2005
We discuss the problem of sequencing precedence-constrained jobs on a single machine...
On-line scheduling to minimize average completion time revisited
On-line scheduling to minimize average completion time revisited
2004
We consider the scheduling problem of minimizing the average-weighted completion time...
The power of α-points in preemptive single machine scheduling
The power of α-points in preemptive single machine scheduling
2002
We consider the NP-hard preemptive single-machine scheduling problem to minimize the...
The complexity of generic primal algorithms for solving general integer programs
The complexity of generic primal algorithms for solving general integer programs
2002
Primal methods constitute a common approach to solving (combinatorial) optimization...
Solving project scheduling problems by minimum cut computations
Solving project scheduling problems by minimum cut computations
2003
In project scheduling a set of precedence-constrained jobs has to be scheduled so as...
On project scheduling with irregular starting time costs
On project scheduling with irregular starting time costs
2001
Maniezzo and Mingozzi study a project scheduling problem with irregular starting time...
Base polytopes of series–parallel posets: Linear description and optimization
Base polytopes of series–parallel posets: Linear description and optimization
1998
We define the base polytope B(P,g) of a partially ordered set P and a supermodular...
The permutahedron of series-parallel posets
The permutahedron of series-parallel posets
1995
The permutahedron Perm(P) of a poset P is defined as the convex hull of those...
Papers per page: