Andreas S. Schulz - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained SchedulingAndreas S. Schulz, Nelson A. Uhan. mor, 36(1):14-23, 2011. [doi]

Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant DemandsAndreas S. Schulz, Claudio Telha. esa 2011: 628-639 [doi]

2010

Minimizing the sum of weighted completion times in a concurrent open shopMonaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan. orl, 38(5):390-395, 2010. [doi]

On the Rank of Cutting-Plane Proof SystemsSebastian Pokutta, Andreas S. Schulz. ipco 2010: 450-463 [doi]

Sharing Supermodular CostsAndreas S. Schulz, Nelson A. Uhan. ior, 58(4-Part-2):1051-1056, 2010. [doi]

2009

Coordination mechanisms for selfish schedulingNicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz. TCS, 410(17):1589-1598, 2009. [doi]

Integer equal flowsCarol A. Meyers, Andreas S. Schulz. orl, 37(4):245-249, 2009. [doi]

Integer Programming: Optimization and Evaluation Are EquivalentJames B. Orlin, Abraham P. Punnen, Andreas S. Schulz. wads 2009: 519-529 [doi]

2008

2007

Fast, Fair, and Efficient Flows in NetworksJosÃ© R. Correa, Andreas S. Schulz, NicolÃ¡s E. Stier Moses. ior, 55(2):215-225, 2007. [doi]

Encouraging Cooperation in Sharing Supermodular CostsAndreas S. Schulz, Nelson A. Uhan. approx 2007: 271-285 [doi]

2006

On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect GamesJuliane Dunkel, Andreas S. Schulz. wine 2006: 62-73 [doi]

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling ProblemsMaurice Queyranne, Andreas S. Schulz. siamcomp, 35(5):1241-1253, 2006. [doi]

Efficiency and fairness of system-optimal routing with user constraintsAndreas S. Schulz, Nicolás E. Stier Moses. networks, 48(4):223-234, 2006. [doi]

2005

2004

IntroductionPhilippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz. anor, 129(1-4):17-19, 2004. [doi]

Single Machine Scheduling with Precedence Constraints: Extended AbstractJosé R. Correa, Andreas S. Schulz. ipco 2004: 283-297 [doi]

Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended AbstractJosé R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses. ipco 2004: 59-73 [doi]

Selfish Routing in Capacitated NetworksJosé R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses. mor, 29(4):961-976, 2004. [doi]

On-line scheduling to minimize average completion time revisitedNicole Megow, Andreas S. Schulz. orl, 32(5):485-490, 2004. [doi]

Approximate local search in combinatorial optimizationJames B. Orlin, Abraham P. Punnen, Andreas S. Schulz. soda 2004: 587-596 [doi]

Approximate Local Search in Combinatorial OptimizationJames B. Orlin, Abraham P. Punnen, Andreas S. Schulz. siamcomp, 33(5):1201-1214, 2004. [doi]

2003

2002

Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, ProceedingsWilliam Cook, Andreas S. Schulz, editors, Volume 2337 of Lecture Notes in Computer Science, Springer, 2002.

Single Machine Scheduling with Release DatesMichel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang. siamdm, 15(2):165-192, 2002. [doi]

Transitive Packing: A Unifying Concept in Combinatorial OptimizationRudolf Müller, Andreas S. Schulz. siamjo, 13(2):335-367, 2002. [doi]

Scheduling Unrelated Machines by Randomized RoundingAndreas S. Schulz, Martin Skutella. siamdm, 15(4):450-469, 2002. [doi]

The Complexity of Generic Primal Algorithms for Solving General Integer ProgramsAndreas S. Schulz, Robert Weismantel. mor, 27(4):681-692, 2002. [doi]

2001

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

epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract)James B. Orlin, Andreas S. Schulz, Sudipta Sengupta. stoc 2000: 565-572 [doi]

1999

On the Chvátal Rank of Polytopes in the 0/1 CubeAlexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz. DAM, 98(1-2):21-27, 1999. [doi]

Bounds on the Chvátal Rank of Polytopes in the 0/1-CubeFriedrich Eisenbrand, Andreas S. Schulz. ipco 1999: 137-150 [doi]

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]

Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority PoliciesRolf H. Möhring, Andreas S. Schulz, Marc Uetz. random 1999: 144-155

Approximation in stochastic scheduling: the power of LP-based priority policiesRolf H. Möhring, Andreas S. Schulz, Marc Uetz. JACM, 46(6):924-942, 1999. [doi]

An Oracle-Polynomial Time Augmentation Algorithm for Integer ProgrammingAndreas S. Schulz, Robert Weismantel. soda 1999: 967-968 [doi]

1998

1997

Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum CriteriaAndreas S. Schulz, Martin Skutella. esa 1997: 416-429

Random-Based Scheduling: New Approximations and LP Lower BoundsAndreas S. Schulz, Martin Skutella. random 1997: 119-133

Facets of the Generalized Permutahedron of a PosetAnnelie von Arnim, Andreas S. Schulz. DAM, 72(1-2):179-192, 1997. [doi]

1996

1995

The Interval Order Polytope of a DigraphRudolf Müller, Andreas S. Schulz. ipco 1995: 50-64

Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary SpeedsMaurice Queyranne, Andreas S. Schulz. ipco 1995: 307-320

The Permutahedron of Series-parallel PosetsAndreas S. Schulz. DAM, 57(1):85-90, 1995. [doi]

0/1-Integer Programming: Optimization and Augmentation are EquivalentAndreas S. Schulz, Robert Weismantel, Günter M. Ziegler. esa 1995: 473-483