Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndreas S. Schulz
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[i5]Felix Happach, Andreas S. Schulz:
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover. CoRR abs/2001.07011 (2020)
2010 – 2019
- 2019
- [c38]Andreas S. Schulz, Rajan Udwani:
Robust Appointment Scheduling with Heterogeneous Costs. APPROX-RANDOM 2019: 25:1-25:17 - [c37]Felix Happach
, Andreas S. Schulz:
Precedence-Constrained Scheduling and Min-Sum Set Cover. WAOA 2019: 170-187 - 2018
- [j40]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust monotone submodular function maximization. Math. Program. 172(1-2): 505-537 (2018) - [i4]Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz:
An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games. CoRR abs/1810.12806 (2018) - 2016
- [c36]Andreas S. Schulz, José Verschae:
Min-Sum Scheduling Under Precedence Constraints. ESA 2016: 74:1-74:13 - [c35]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. IPCO 2016: 312-324 - 2015
- [p1]Andreas S. Schulz:
Selfish Routing and Proportional Resource Allocation. Gems of Combinatorial Optimization and Graph Algorithms 2015: 95-102 - [e3]Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner:
Gems of Combinatorial Optimization and Graph Algorithms. Springer 2015, ISBN 978-3-319-24970-4 [contents] - [i3]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. CoRR abs/1507.06616 (2015) - 2014
- [c34]Shashi Mittal, Andreas S. Schulz, Sebastian Stiller:
Robust Appointment Scheduling. APPROX-RANDOM 2014: 356-370 - [e2]Andreas S. Schulz, Dorothea Wagner:
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8737, Springer 2014, ISBN 978-3-662-44776-5 [contents] - 2013
- [j39]Andreas S. Schulz, Nelson A. Uhan:
Approximating the least core value and least core of cooperative games with supermodular costs. Discret. Optim. 10(2): 163-180 (2013) - [j38]Shashi Mittal, Andreas S. Schulz:
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. Oper. Res. 61(2): 386-397 (2013) - [j37]Juliane Dunkel, Andreas S. Schulz:
The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope. Math. Oper. Res. 38(1): 63-91 (2013) - [j36]Shashi Mittal, Andreas S. Schulz:
An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141(1-2): 103-120 (2013) - [c33]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
The Price of Anarchy of the Proportional Allocation Mechanism Revisited. WINE 2013: 109-120 - 2012
- [j35]Carol A. Meyers, Andreas S. Schulz:
The complexity of welfare maximization in congestion games. Networks 59(2): 252-260 (2012) - 2011
- [j34]Andreas S. Schulz, Nelson A. Uhan:
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling. Math. Oper. Res. 36(1): 14-23 (2011) - [j33]Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz:
On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39(5): 301-304 (2011) - [j32]Sebastian Pokutta, Andreas S. Schulz:
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. Oper. Res. Lett. 39(6): 457-460 (2011) - [c32]Andreas S. Schulz, Claudio Telha:
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. ESA 2011: 628-639 - [c31]Juliane Dunkel, Andreas S. Schulz:
The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope. OR 2011: 587-592 - 2010
- [j31]Andreas S. Schulz, Nelson A. Uhan:
Sharing Supermodular Costs. Oper. Res. 58(4-Part-2): 1051-1056 (2010) - [j30]Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan:
Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5): 390-395 (2010) - [c30]Sebastian Pokutta, Andreas S. Schulz:
On the Rank of Cutting-Plane Proof Systems. IPCO 2010: 450-463
2000 – 2009
- 2009
- [j29]Carol A. Meyers, Andreas S. Schulz:
Integer equal flows. Oper. Res. Lett. 37(4): 245-249 (2009) - [j28]Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz:
Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410(17): 1589-1598 (2009) - [c29]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Integer Programming: Optimization and Evaluation Are Equivalent. WADS 2009: 519-529 - [i2]Andreas S. Schulz, Nelson A. Uhan:
Sharing Supermodular Costs. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j27]James B. Orlin, Andreas S. Schulz, Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. Discret. Optim. 5(2): 550-561 (2008) - [j26]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ. Behav. 64(2): 457-469 (2008) - [j25]Juliane Dunkel, Andreas S. Schulz:
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. Math. Oper. Res. 33(4): 851-868 (2008) - [c28]Shashi Mittal, Andreas S. Schulz:
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. APPROX-RANDOM 2008: 179-192 - [c27]Andreas S. Schulz:
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming. Bonn Workshop of Combinatorial Optimization 2008: 399-428 - [c26]Andreas S. Schulz:
Stochastic Online Scheduling Revisited. COCOA 2008: 448-457 - 2007
- [j24]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
Fast, Fair, and Efficient Flows in Networks. Oper. Res. 55(2): 215-225 (2007) - [c25]Andreas S. Schulz, Nelson A. Uhan:
Encouraging Cooperation in Sharing Supermodular Costs. APPROX-RANDOM 2007: 271-285 - 2006
- [j23]Andreas S. Schulz, Nicolás E. Stier Moses:
Efficiency and fairness of system-optimal routing with user constraints. Networks 48(4): 223-234 (2006) - [j22]Maurice Queyranne, Andreas S. Schulz:
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. SIAM J. Comput. 35(5): 1241-1253 (2006) - [c24]Juliane Dunkel, Andreas S. Schulz:
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. WINE 2006: 62-73 - 2005
- [j21]Olaf Jahn, Rolf H. Möhring, Andreas S. Schulz, Nicolás E. Stier Moses:
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Oper. Res. 53(4): 600-616 (2005) - [j20]José R. Correa, Andreas S. Schulz:
Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 30(4): 1005-1021 (2005) - [c23]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
On the Inefficiency of Equilibria in Congestion Games. IPCO 2005: 167-181 - [c22]Nicole Immorlica, Erran L. Li, Vahab S. Mirrokni, Andreas S. Schulz:
Coordination Mechanisms for Selfish Scheduling. WINE 2005: 55-69 - [i1]Andreas S. Schulz:
New Old Algorithms for Stochastic Scheduling. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j19]Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz:
Introduction. Annals OR 129(1-4): 17-19 (2004) - [j18]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
Selfish Routing in Capacitated Networks. Math. Oper. Res. 29(4): 961-976 (2004) - [j17]Nicole Megow, Andreas S. Schulz:
On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32(5): 485-490 (2004) - [j16]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33(5): 1201-1214 (2004) - [c21]José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. IPCO 2004: 59-73 - [c20]José R. Correa, Andreas S. Schulz:
Single Machine Scheduling with Precedence Constraints: Extended Abstract. IPCO 2004: 283-297 - [c19]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Approximate local search in combinatorial optimization. SODA 2004: 587-596 - 2003
- [j15]Friedrich Eisenbrand, Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Combinatorica 23(2): 245-261 (2003) - [j14]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Solving Project Scheduling Problems by Minimum Cut Computations. Manag. Sci. 49(3): 330-350 (2003) - [c18]Andreas S. Schulz, Nicolás E. Stier Moses:
On the performance of user equilibria in traffic networks. SODA 2003: 86-87 - [c17]Nicole Megow, Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA 2003: 227-234 - 2002
- [j13]Andreas S. Schulz, Robert Weismantel:
The Complexity of Generic Primal Algorithms for Solving General Integer Programs. Math. Oper. Res. 27(4): 681-692 (2002) - [j12]Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang:
Single Machine Scheduling with Release Dates. SIAM J. Discret. Math. 15(2): 165-192 (2002) - [j11]Andreas S. Schulz, Martin Skutella:
Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discret. Math. 15(4): 450-469 (2002) - [j10]Rudolf Müller, Andreas S. Schulz:
Transitive Packing: A Unifying Concept in Combinatorial Optimization. SIAM J. Optim. 13(2): 335-367 (2002) - [e1]William J. Cook, Andreas S. Schulz:
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings. Lecture Notes in Computer Science 2337, Springer 2002, ISBN 3-540-43676-6 [contents] - 2001
- [j9]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
On project scheduling with irregular starting time costs. Oper. Res. Lett. 28(4): 149-154 (2001) - 2000
- [c16]James B. Orlin, Andreas S. Schulz, Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). STOC 2000: 565-572
1990 – 1999
- 1999
- [j8]Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube. Discret. Appl. Math. 98(1-2): 21-27 (1999) - [j7]Rolf H. Möhring, Andreas S. Schulz, Marc Uetz:
Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46(6): 924-942 (1999) - [c15]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. ESA 1999: 139-150 - [c14]Friedrich Eisenbrand, Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. IPCO 1999: 137-150 - [c13]Rolf H. Möhring, Andreas S. Schulz, Marc Uetz:
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. RANDOM-APPROX 1999: 144-155 - [c12]Andreas S. Schulz, Robert Weismantel:
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. SODA 1999: 967-968 - 1998
- [j6]Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein:
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 (1998) - [j5]Rainer Schrader, Andreas S. Schulz, Georg Wambach:
Base polytopes of series-parallel posets: Linear description and optimization. Math. Program. 82: 159-173 (1998) - [j4]Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
Switchbox Routing in VLSI Design: Closing the Complexity Gap. Theor. Comput. Sci. 203(1): 31-49 (1998) - [c11]Alix Munier, Maurice Queyranne, Andreas S. Schulz:
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. IPCO 1998: 367-382 - 1997
- [j3]Annelie von Arnim, Andreas S. Schulz:
Facets of the Generalized Permutahedron of a Poset. Discret. Appl. Math. 72(1-2): 179-192 (1997) - [j2]Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein:
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22(3): 513-544 (1997) - [c10]Andreas S. Schulz, Martin Skutella:
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. ESA 1997: 416-429 - [c9]Andreas S. Schulz, Martin Skutella:
Random-Based Scheduling: New Approximations and LP Lower Bounds. RANDOM 1997: 119-133 - 1996
- [c8]Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz:
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). ESA 1996: 76-90 - [c7]Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein:
Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657 - [c6]Andreas S. Schulz:
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. IPCO 1996: 301-315 - [c5]Rudolf Müller, Andreas S. Schulz:
Transitive Packing. IPCO 1996: 430-444 - [c4]Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
Switchbox Routing in VLSI Design: Closing the Complexity Gap. WG 1996: 196-210 - 1995
- [j1]Andreas S. Schulz:
The Permutahedron of Series-parallel Posets. Discret. Appl. Math. 57(1): 85-90 (1995) - [c3]Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler:
0/1-Integer Programming: Optimization and Augmentation are Equivalent. ESA 1995: 473-483 - [c2]Rudolf Müller, Andreas S. Schulz:
The Interval Order Polytope of a Digraph. IPCO 1995: 50-64 - [c1]Maurice Queyranne, Andreas S. Schulz:
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. IPCO 1995: 307-320
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-07-01 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
