Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andreas S. Schulz
@article{DBLP:journals/corr/abs-2311-03909,
author = {Lukas Brandl and
Andreas S. Schulz},
title = {Primal Separation and Approximation for the \{0, 1/2\}-closure},
journal = {CoRR},
volume = {abs/2311.03909},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.03909},
doi = {10.48550/ARXIV.2311.03909},
eprinttype = {arXiv},
eprint = {2311.03909},
timestamp = {Tue, 14 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-03909.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-17569,
author = {Andreas S. Schulz and
Claudio Telha},
title = {On the complexity of a maintenance problem for hierarchical systems},
journal = {CoRR},
volume = {abs/2312.17569},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.17569},
doi = {10.48550/ARXIV.2312.17569},
eprinttype = {arXiv},
eprint = {2312.17569},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-17569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GiannakopoulosN22,
author = {Yiannis Giannakopoulos and
Georgy Noarov and
Andreas S. Schulz},
title = {Computing Approximate Equilibria in Weighted Congestion Games via
Best-Responses},
journal = {Math. Oper. Res.},
volume = {47},
number = {1},
pages = {643--664},
year = {2022},
url = {https://doi.org/10.1287/moor.2021.1144},
doi = {10.1287/MOOR.2021.1144},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GiannakopoulosN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruggerS22,
author = {Matthias Brugger and
Andreas S. Schulz},
title = {On the complexity of recognizing integrality and total dual integrality
of the \{0, 1/2\}-closure},
journal = {Oper. Res. Lett.},
volume = {50},
number = {1},
pages = {16--19},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2021.11.009},
doi = {10.1016/J.ORL.2021.11.009},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/BruggerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/FrieseckeSV22,
author = {Gero Friesecke and
Andreas S. Schulz and
Daniela V{\"{o}}gler},
title = {Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal
Optimal Transport Problems},
journal = {{SIAM} J. Sci. Comput.},
volume = {44},
number = {1},
pages = {1632},
year = {2022},
url = {https://doi.org/10.1137/21m140732x},
doi = {10.1137/21M140732X},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/FrieseckeSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/MartinMPS21,
author = {Layla Martin and
Stefan Minner and
Diogo Po{\c{c}}as and
Andreas S. Schulz},
title = {The Competitive Pickup and Delivery Orienteering Problem for Balancing
Car-Sharing Systems},
journal = {Transp. Sci.},
volume = {55},
number = {6},
pages = {1232--1259},
year = {2021},
url = {https://doi.org/10.1287/trsc.2021.1041},
doi = {10.1287/TRSC.2021.1041},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/MartinMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-12624,
author = {Gero Friesecke and
Andreas S. Schulz and
Daniela V{\"{o}}gler},
title = {Genetic column generation: Fast computation of high-dimensional multi-marginal
optimal transport problems},
journal = {CoRR},
volume = {abs/2103.12624},
year = {2021},
url = {https://arxiv.org/abs/2103.12624},
eprinttype = {arXiv},
eprint = {2103.12624},
timestamp = {Tue, 06 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-12624.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-14486,
author = {Matthias Brugger and
Andreas S. Schulz},
title = {On the Complexity of Recognizing Integrality and Total Dual Integrality
of the \{0, 1/2\}-Closure},
journal = {CoRR},
volume = {abs/2104.14486},
year = {2021},
url = {https://arxiv.org/abs/2104.14486},
eprinttype = {arXiv},
eprint = {2104.14486},
timestamp = {Tue, 04 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-14486.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-07011,
author = {Felix Happach and
Andreas S. Schulz},
title = {Approximation Algorithms and {LP} Relaxations for Scheduling Problems
Related to Min-Sum Set Cover},
journal = {CoRR},
volume = {abs/2001.07011},
year = {2020},
url = {https://arxiv.org/abs/2001.07011},
eprinttype = {arXiv},
eprint = {2001.07011},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-07011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09045,
author = {Andreas S. Schulz and
Claudio Telha},
title = {Integer factorization and Riemann's hypothesis: Why two-item joint
replenishment is hard},
journal = {CoRR},
volume = {abs/2007.09045},
year = {2020},
url = {https://arxiv.org/abs/2007.09045},
eprinttype = {arXiv},
eprint = {2007.09045},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SchulzU19,
author = {Andreas S. Schulz and
Rajan Udwani},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Robust Appointment Scheduling with Heterogeneous Costs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.25},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.25},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/SchulzU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HappachS19,
author = {Felix Happach and
Andreas S. Schulz},
editor = {Evripidis Bampis and
Nicole Megow},
title = {Precedence-Constrained Scheduling and Min-Sum Set Cover},
booktitle = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
pages = {170--187},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-39479-0\_12},
doi = {10.1007/978-3-030-39479-0\_12},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HappachS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinSU18,
author = {James B. Orlin and
Andreas S. Schulz and
Rajan Udwani},
title = {Robust monotone submodular function maximization},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {505--537},
year = {2018},
url = {https://doi.org/10.1007/s10107-018-1320-2},
doi = {10.1007/S10107-018-1320-2},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/OrlinSU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-12806,
author = {Yiannis Giannakopoulos and
Georgy Noarov and
Andreas S. Schulz},
title = {An Improved Algorithm for Computing Approximate Equilibria in Weighted
Congestion Games},
journal = {CoRR},
volume = {abs/1810.12806},
year = {2018},
url = {http://arxiv.org/abs/1810.12806},
eprinttype = {arXiv},
eprint = {1810.12806},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-12806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SchulzV16,
author = {Andreas S. Schulz and
Jos{\'{e}} Verschae},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Min-Sum Scheduling Under Precedence Constraints},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {74:1--74:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.74},
doi = {10.4230/LIPICS.ESA.2016.74},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/SchulzV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/OrlinSU16,
author = {James B. Orlin and
Andreas S. Schulz and
Rajan Udwani},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Robust Monotone Submodular Function Maximization},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {312--324},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_26},
doi = {10.1007/978-3-319-33461-5\_26},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/OrlinSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/15/Schulz15,
author = {Andreas S. Schulz},
editor = {Andreas S. Schulz and
Martin Skutella and
Sebastian Stiller and
Dorothea Wagner},
title = {Selfish Routing and Proportional Resource Allocation},
booktitle = {Gems of Combinatorial Optimization and Graph Algorithms},
pages = {95--102},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24971-1\_9},
doi = {10.1007/978-3-319-24971-1\_9},
timestamp = {Tue, 16 May 2017 14:01:43 +0200},
biburl = {https://dblp.org/rec/books/sp/15/Schulz15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/SSW2015,
editor = {Andreas S. Schulz and
Martin Skutella and
Sebastian Stiller and
Dorothea Wagner},
title = {Gems of Combinatorial Optimization and Graph Algorithms},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24971-1},
doi = {10.1007/978-3-319-24971-1},
isbn = {978-3-319-24970-4},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/SSW2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OrlinSU15,
author = {James B. Orlin and
Andreas S. Schulz and
Rajan Udwani},
title = {Robust Monotone Submodular Function Maximization},
journal = {CoRR},
volume = {abs/1507.06616},
year = {2015},
url = {http://arxiv.org/abs/1507.06616},
eprinttype = {arXiv},
eprint = {1507.06616},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OrlinSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MittalSS14,
author = {Shashi Mittal and
Andreas S. Schulz and
Sebastian Stiller},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Robust Appointment Scheduling},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {356--370},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.356},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.356},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MittalSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2014,
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2},
doi = {10.1007/978-3-662-44777-2},
isbn = {978-3-662-44776-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/SchulzU13,
author = {Andreas S. Schulz and
Nelson A. Uhan},
title = {Approximating the least core value and least core of cooperative games
with supermodular costs},
journal = {Discret. Optim.},
volume = {10},
number = {2},
pages = {163--180},
year = {2013},
url = {https://doi.org/10.1016/j.disopt.2013.02.002},
doi = {10.1016/J.DISOPT.2013.02.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/SchulzU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/MittalS13,
author = {Shashi Mittal and
Andreas S. Schulz},
title = {A General Framework for Designing Approximation Schemes for Combinatorial
Optimization Problems with Many Objectives Combined into One},
journal = {Oper. Res.},
volume = {61},
number = {2},
pages = {386--397},
year = {2013},
url = {https://doi.org/10.1287/opre.1120.1093},
doi = {10.1287/OPRE.1120.1093},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/MittalS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DunkelS13,
author = {Juliane Dunkel and
Andreas S. Schulz},
title = {The Gomory-Chv{\'{a}}tal Closure of a Nonrational Polytope Is
a Rational Polytope},
journal = {Math. Oper. Res.},
volume = {38},
number = {1},
pages = {63--91},
year = {2013},
url = {https://doi.org/10.1287/moor.1120.0565},
doi = {10.1287/MOOR.1120.0565},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DunkelS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MittalS13,
author = {Shashi Mittal and
Andreas S. Schulz},
title = {An {FPTAS} for optimizing a class of low-rank functions over a polytope},
journal = {Math. Program.},
volume = {141},
number = {1-2},
pages = {103--120},
year = {2013},
url = {https://doi.org/10.1007/s10107-011-0511-x},
doi = {10.1007/S10107-011-0511-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MittalS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CorreaSM13,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
editor = {Yiling Chen and
Nicole Immorlica},
title = {The Price of Anarchy of the Proportional Allocation Mechanism Revisited},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {109--120},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_10},
doi = {10.1007/978-3-642-45046-4\_10},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/CorreaSM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MeyersS12,
author = {Carol A. Meyers and
Andreas S. Schulz},
title = {The complexity of welfare maximization in congestion games},
journal = {Networks},
volume = {59},
number = {2},
pages = {252--260},
year = {2012},
url = {https://doi.org/10.1002/net.20439},
doi = {10.1002/NET.20439},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MeyersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SchulzU11,
author = {Andreas S. Schulz and
Nelson A. Uhan},
title = {Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances
of Single-Machine Precedence-Constrained Scheduling},
journal = {Math. Oper. Res.},
volume = {36},
number = {1},
pages = {14--23},
year = {2011},
url = {https://doi.org/10.1287/moor.1100.0479},
doi = {10.1287/MOOR.1100.0479},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SchulzU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordPS11,
author = {Adam N. Letchford and
Sebastian Pokutta and
Andreas S. Schulz},
title = {On the membership problem for the \{0, 1/2\}-closure},
journal = {Oper. Res. Lett.},
volume = {39},
number = {5},
pages = {301--304},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.07.003},
doi = {10.1016/J.ORL.2011.07.003},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PokuttaS11a,
author = {Sebastian Pokutta and
Andreas S. Schulz},
title = {Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chv{\'{a}}tal
rank},
journal = {Oper. Res. Lett.},
volume = {39},
number = {6},
pages = {457--460},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.09.004},
doi = {10.1016/J.ORL.2011.09.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PokuttaS11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SchulzT11,
author = {Andreas S. Schulz and
Claudio Telha},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms and Hardness Results for the Joint Replenishment
Problem with Constant Demands},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {628--639},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_53},
doi = {10.1007/978-3-642-23719-5\_53},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SchulzT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/DunkelS11,
author = {Juliane Dunkel and
Andreas S. Schulz},
editor = {Diethard Klatte and
Hans{-}Jakob L{\"{u}}thi and
Karl Schmedders},
title = {The Gomory-Chv{\'{a}}tal Closure of a Non-Rational Polytope is
a Rational Polytope},
booktitle = {Operations Research Proceedings 2011, Selected Papers of the International
Conference on Operations Research {(OR} 2011), August 30 - September
2, 2011, Zurich, Switzerland},
pages = {587--592},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29210-1\_93},
doi = {10.1007/978-3-642-29210-1\_93},
timestamp = {Fri, 19 May 2017 01:25:22 +0200},
biburl = {https://dblp.org/rec/conf/or/DunkelS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SchulzU10,
author = {Andreas S. Schulz and
Nelson A. Uhan},
title = {Sharing Supermodular Costs},
journal = {Oper. Res.},
volume = {58},
number = {4-Part-2},
pages = {1051--1056},
year = {2010},
url = {https://doi.org/10.1287/opre.1100.0841},
doi = {10.1287/OPRE.1100.0841},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SchulzU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MastrolilliQSSU10,
author = {Monaldo Mastrolilli and
Maurice Queyranne and
Andreas S. Schulz and
Ola Svensson and
Nelson A. Uhan},
title = {Minimizing the sum of weighted completion times in a concurrent open
shop},
journal = {Oper. Res. Lett.},
volume = {38},
number = {5},
pages = {390--395},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.04.011},
doi = {10.1016/J.ORL.2010.04.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/MastrolilliQSSU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/PokuttaS10,
author = {Sebastian Pokutta and
Andreas S. Schulz},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {On the Rank of Cutting-Plane Proof Systems},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {450--463},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_34},
doi = {10.1007/978-3-642-13036-6\_34},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/PokuttaS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MeyersS09,
author = {Carol A. Meyers and
Andreas S. Schulz},
title = {Integer equal flows},
journal = {Oper. Res. Lett.},
volume = {37},
number = {4},
pages = {245--249},
year = {2009},
url = {https://doi.org/10.1016/j.orl.2009.03.006},
doi = {10.1016/J.ORL.2009.03.006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MeyersS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ImmorlicaLMS09,
author = {Nicole Immorlica and
Li (Erran) Li and
Vahab S. Mirrokni and
Andreas S. Schulz},
title = {Coordination mechanisms for selfish scheduling},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1589--1598},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.032},
doi = {10.1016/J.TCS.2008.12.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ImmorlicaLMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/OrlinPS09,
author = {James B. Orlin and
Abraham P. Punnen and
Andreas S. Schulz},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Integer Programming: Optimization and Evaluation Are Equivalent},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {519--529},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_45},
doi = {10.1007/978-3-642-03367-4\_45},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/OrlinPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SchulzU09,
author = {Andreas S. Schulz and
Nelson A. Uhan},
editor = {Cynthia Barnhart and
Uwe Clausen and
Ulrich Lauther and
Rolf H. M{\"{o}}hring},
title = {Sharing Supermodular Costs},
booktitle = {Models and Algorithms for Optimization in Logistics, 21.06. - 26.06.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09261},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2170/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SchulzU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/OrlinSS08,
author = {James B. Orlin and
Andreas S. Schulz and
Sudipta Sengupta},
title = {epsilon-optimization schemes and L-bit precision: Alternative perspectives
for solving combinatorial optimization problems},
journal = {Discret. Optim.},
volume = {5},
number = {2},
pages = {550--561},
year = {2008},
url = {https://doi.org/10.1016/j.disopt.2007.08.004},
doi = {10.1016/J.DISOPT.2007.08.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/OrlinSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/CorreaSM08,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {A geometric approach to the price of anarchy in nonatomic congestion
games},
journal = {Games Econ. Behav.},
volume = {64},
number = {2},
pages = {457--469},
year = {2008},
url = {https://doi.org/10.1016/j.geb.2008.01.001},
doi = {10.1016/J.GEB.2008.01.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/geb/CorreaSM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DunkelS08,
author = {Juliane Dunkel and
Andreas S. Schulz},
title = {On the Complexity of Pure-Strategy Nash Equilibria in Congestion and
Local-Effect Games},
journal = {Math. Oper. Res.},
volume = {33},
number = {4},
pages = {851--868},
year = {2008},
url = {https://doi.org/10.1287/moor.1080.0322},
doi = {10.1287/MOOR.1080.0322},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DunkelS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MittalS08,
author = {Shashi Mittal and
Andreas S. Schulz},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {A General Framework for Designing Approximation Schemes for Combinatorial
Optimization Problems with Many Objectives Combined into One},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {179--192},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_15},
doi = {10.1007/978-3-540-85363-3\_15},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MittalS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bonnco/Schulz08,
author = {Andreas S. Schulz},
editor = {William J. Cook and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Jens Vygen},
title = {On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming},
booktitle = {Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial
Optimization, November 3-7, 2008, Bonn, Germany},
pages = {399--428},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-76796-1\_19},
doi = {10.1007/978-3-540-76796-1\_19},
timestamp = {Tue, 06 Aug 2019 16:18:36 +0200},
biburl = {https://dblp.org/rec/conf/bonnco/Schulz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/Schulz08,
author = {Andreas S. Schulz},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Stochastic Online Scheduling Revisited},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {448--457},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_42},
doi = {10.1007/978-3-540-85097-7\_42},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/Schulz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/CorreaSM07,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {Fast, Fair, and Efficient Flows in Networks},
journal = {Oper. Res.},
volume = {55},
number = {2},
pages = {215--225},
year = {2007},
url = {https://doi.org/10.1287/opre.1070.0383},
doi = {10.1287/OPRE.1070.0383},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/CorreaSM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SchulzU07,
author = {Andreas S. Schulz and
Nelson A. Uhan},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Encouraging Cooperation in Sharing Supermodular Costs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {271--285},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_20},
doi = {10.1007/978-3-540-74208-1\_20},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/SchulzU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SchulzM06,
author = {Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {Efficiency and fairness of system-optimal routing with user constraints},
journal = {Networks},
volume = {48},
number = {4},
pages = {223--234},
year = {2006},
url = {https://doi.org/10.1002/net.20133},
doi = {10.1002/NET.20133},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SchulzM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/QueyranneS06,
author = {Maurice Queyranne and
Andreas S. Schulz},
title = {Approximation Bounds for a General Class of Precedence Constrained
Parallel Machine Scheduling Problems},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {5},
pages = {1241--1253},
year = {2006},
url = {https://doi.org/10.1137/S0097539799358094},
doi = {10.1137/S0097539799358094},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/QueyranneS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DunkelS06,
author = {Juliane Dunkel and
Andreas S. Schulz},
editor = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {On the Complexity of Pure-Strategy Nash Equilibria in Congestion and
Local-Effect Games},
booktitle = {Internet and Network Economics, Second International Workshop, {WINE}
2006, Patras, Greece, December 15-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4286},
pages = {62--73},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944874\_7},
doi = {10.1007/11944874\_7},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/DunkelS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/JahnMSM05,
author = {Olaf Jahn and
Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {System-Optimal Routing of Traffic Flows with User Constraints in Networks
with Congestion},
journal = {Oper. Res.},
volume = {53},
number = {4},
pages = {600--616},
year = {2005},
url = {https://doi.org/10.1287/opre.1040.0197},
doi = {10.1287/OPRE.1040.0197},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/JahnMSM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CorreaS05,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz},
title = {Single-Machine Scheduling with Precedence Constraints},
journal = {Math. Oper. Res.},
volume = {30},
number = {4},
pages = {1005--1021},
year = {2005},
url = {https://doi.org/10.1287/moor.1050.0158},
doi = {10.1287/MOOR.1050.0158},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CorreaS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CorreaSM05,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {On the Inefficiency of Equilibria in Congestion Games},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {167--181},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_13},
doi = {10.1007/11496915\_13},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CorreaSM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/ImmorlicaLMS05,
author = {Nicole Immorlica and
Li (Erran) Li and
Vahab S. Mirrokni and
Andreas S. Schulz},
editor = {Xiaotie Deng and
Yinyu Ye},
title = {Coordination Mechanisms for Selfish Scheduling},
booktitle = {Internet and Network Economics, First International Workshop, {WINE}
2005, Hong Kong, China, December 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3828},
pages = {55--69},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11600930\_7},
doi = {10.1007/11600930\_7},
timestamp = {Sun, 18 Dec 2022 19:02:44 +0100},
biburl = {https://dblp.org/rec/conf/wine/ImmorlicaLMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Schulz05,
author = {Andreas S. Schulz},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {New Old Algorithms for Stochastic Scheduling},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/193},
timestamp = {Thu, 10 Jun 2021 13:02:06 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Schulz05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BaptisteCMS04,
author = {Philippe Baptiste and
Jacques Carlier and
Alix Munier and
Andreas S. Schulz},
title = {Introduction},
journal = {Ann. Oper. Res.},
volume = {129},
number = {1-4},
pages = {17--19},
year = {2004},
url = {https://doi.org/10.1023/B:ANOR.0000030779.01529.d2},
doi = {10.1023/B:ANOR.0000030779.01529.D2},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BaptisteCMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CorreaSM04,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {Selfish Routing in Capacitated Networks},
journal = {Math. Oper. Res.},
volume = {29},
number = {4},
pages = {961--976},
year = {2004},
url = {https://doi.org/10.1287/moor.1040.0098},
doi = {10.1287/MOOR.1040.0098},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CorreaSM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MegowS04,
author = {Nicole Megow and
Andreas S. Schulz},
title = {On-line scheduling to minimize average completion time revisited},
journal = {Oper. Res. Lett.},
volume = {32},
number = {5},
pages = {485--490},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.11.008},
doi = {10.1016/J.ORL.2003.11.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/MegowS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/OrlinPS04,
author = {James B. Orlin and
Abraham P. Punnen and
Andreas S. Schulz},
title = {Approximate Local Search in Combinatorial Optimization},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {5},
pages = {1201--1214},
year = {2004},
url = {https://doi.org/10.1137/S0097539703431007},
doi = {10.1137/S0097539703431007},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/OrlinPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CorreaSM04,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {Computational Complexity, Fairness, and the Price of Anarchy of the
Maximum Latency Problem: Extended Abstract},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International
{IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3064},
pages = {59--73},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_5},
doi = {10.1007/978-3-540-25960-2\_5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CorreaSM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CorreaS04,
author = {Jos{\'{e}} R. Correa and
Andreas S. Schulz},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {Single Machine Scheduling with Precedence Constraints: Extended Abstract},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International
{IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3064},
pages = {283--297},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_22},
doi = {10.1007/978-3-540-25960-2\_22},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CorreaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/OrlinPS04,
author = {James B. Orlin and
Abraham P. Punnen and
Andreas S. Schulz},
editor = {J. Ian Munro},
title = {Approximate local search in combinatorial optimization},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {587--596},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982880},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/OrlinPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EisenbrandS03,
author = {Friedrich Eisenbrand and
Andreas S. Schulz},
title = {Bounds on the Chv{\'{a}}tal Rank of Polytopes in the 0/1-Cube},
journal = {Comb.},
volume = {23},
number = {2},
pages = {245--261},
year = {2003},
url = {https://doi.org/10.1007/s00493-003-0020-5},
doi = {10.1007/S00493-003-0020-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EisenbrandS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/MohringSSU03,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Frederik Stork and
Marc Uetz},
title = {Solving Project Scheduling Problems by Minimum Cut Computations},
journal = {Manag. Sci.},
volume = {49},
number = {3},
pages = {330--350},
year = {2003},
url = {https://doi.org/10.1287/mnsc.49.3.330.12737},
doi = {10.1287/MNSC.49.3.330.12737},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/MohringSSU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SchulzM03,
author = {Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {On the performance of user equilibria in traffic networks},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {86--87},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644121},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/SchulzM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MegowS03,
author = {Nicole Megow and
Andreas S. Schulz},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Scheduling to Minimize Average Completion Time Revisited: Deterministic
On-Line Algorithms},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {227--234},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_18},
doi = {10.1007/978-3-540-24592-6\_18},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MegowS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SchulzW02,
author = {Andreas S. Schulz and
Robert Weismantel},
title = {The Complexity of Generic Primal Algorithms for Solving General Integer
Programs},
journal = {Math. Oper. Res.},
volume = {27},
number = {4},
pages = {681--692},
year = {2002},
url = {https://doi.org/10.1287/moor.27.4.681.305},
doi = {10.1287/MOOR.27.4.681.305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SchulzW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoemansQSSW02,
author = {Michel X. Goemans and
Maurice Queyranne and
Andreas S. Schulz and
Martin Skutella and
Yaoguang Wang},
title = {Single Machine Scheduling with Release Dates},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {165--192},
year = {2002},
url = {https://doi.org/10.1137/S089548019936223X},
doi = {10.1137/S089548019936223X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoemansQSSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SchulzS02,
author = {Andreas S. Schulz and
Martin Skutella},
title = {Scheduling Unrelated Machines by Randomized Rounding},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {450--469},
year = {2002},
url = {https://doi.org/10.1137/S0895480199357078},
doi = {10.1137/S0895480199357078},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SchulzS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/MullerS02,
author = {Rudolf M{\"{u}}ller and
Andreas S. Schulz},
title = {Transitive Packing: {A} Unifying Concept in Combinatorial Optimization},
journal = {{SIAM} J. Optim.},
volume = {13},
number = {2},
pages = {335--367},
year = {2002},
url = {https://doi.org/10.1137/S1052623499363256},
doi = {10.1137/S1052623499363256},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/MullerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/2002,
editor = {William J. Cook and
Andreas S. Schulz},
title = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867},
doi = {10.1007/3-540-47867},
isbn = {3-540-43676-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MohringSSU01,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Frederik Stork and
Marc Uetz},
title = {On project scheduling with irregular starting time costs},
journal = {Oper. Res. Lett.},
volume = {28},
number = {4},
pages = {149--154},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00064-5},
doi = {10.1016/S0167-6377(01)00064-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MohringSSU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/OrlinSS00,
author = {James B. Orlin and
Andreas S. Schulz and
Sudipta Sengupta},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {epsilon-optimization schemes and L-bit precision: alternative perspectives
in combinatorial optimization (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {565--572},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335377},
doi = {10.1145/335305.335377},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/OrlinSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BockmayrEHS99,
author = {Alexander Bockmayr and
Friedrich Eisenbrand and
Mark E. Hartmann and
Andreas S. Schulz},
title = {On the Chv{\'{a}}tal Rank of Polytopes in the 0/1 Cube},
journal = {Discret. Appl. Math.},
volume = {98},
number = {1-2},
pages = {21--27},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00156-0},
doi = {10.1016/S0166-218X(99)00156-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BockmayrEHS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MohringSU99,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Marc Uetz},
title = {Approximation in stochastic scheduling: the power of LP-based priority
policies},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {924--942},
year = {1999},
url = {https://doi.org/10.1145/331524.331530},
doi = {10.1145/331524.331530},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MohringSU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MohringSSU99,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Frederik Stork and
Marc Uetz},
editor = {Jaroslav Nesetril},
title = {Resource-Constrained Project Scheduling: Computing Lower Bounds by
Solving Minimum Cut Problems},
booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
Republic, July 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1643},
pages = {139--150},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48481-7\_13},
doi = {10.1007/3-540-48481-7\_13},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MohringSSU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EisenbrandS99,
author = {Friedrich Eisenbrand and
Andreas S. Schulz},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Bounds on the Chv{\'{a}}tal Rank of Polytopes in the 0/1-Cube},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International
{IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1610},
pages = {137--150},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_11},
doi = {10.1007/3-540-48777-8\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/EisenbrandS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/MohringSU99,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Marc Uetz},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Stochastic Machine Scheduling: Performance Guarantees for LP-based
Priority Policies},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {144--155},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_16},
doi = {10.1007/978-3-540-48413-4\_16},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/MohringSU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SchulzW99,
author = {Andreas S. Schulz and
Robert Weismantel},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {967--968},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314950},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/SchulzW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PhillipsSSSW98,
author = {Cynthia A. Phillips and
Andreas S. Schulz and
David B. Shmoys and
Clifford Stein and
Joel Wein},
title = {Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem},
journal = {J. Comb. Optim.},
volume = {1},
number = {4},
pages = {413--426},
year = {1998},
url = {https://doi.org/10.1023/A:1009750913529},
doi = {10.1023/A:1009750913529},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PhillipsSSSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SchraderSW98,
author = {Rainer Schrader and
Andreas S. Schulz and
Georg Wambach},
title = {Base polytopes of series-parallel posets: Linear description and optimization},
journal = {Math. Program.},
volume = {82},
pages = {159--173},
year = {1998},
url = {https://doi.org/10.1007/BF01585869},
doi = {10.1007/BF01585869},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SchraderSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HartmannSS98,
author = {Stephan Hartmann and
Markus W. Sch{\"{a}}ffter and
Andreas S. Schulz},
title = {Switchbox Routing in {VLSI} Design: Closing the Complexity Gap},
journal = {Theor. Comput. Sci.},
volume = {203},
number = {1},
pages = {31--49},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00286-7},
doi = {10.1016/S0304-3975(97)00286-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HartmannSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MunierQS98,
author = {Alix Munier and
Maurice Queyranne and
Andreas S. Schulz},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {Approximation Bounds for a General Class of Precedence Constrained
Parallel Machine Scheduling Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {367--382},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_28},
doi = {10.1007/3-540-69346-7\_28},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MunierQS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArnimS97,
author = {Annelie von Arnim and
Andreas S. Schulz},
title = {Facets of the Generalized Permutahedron of a Poset},
journal = {Discret. Appl. Math.},
volume = {72},
number = {1-2},
pages = {179--192},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00044-3},
doi = {10.1016/S0166-218X(96)00044-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArnimS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HallSSW97,
author = {Leslie A. Hall and
Andreas S. Schulz and
David B. Shmoys and
Joel Wein},
title = {Scheduling to Minimize Average Completion Time: Off-Line and On-Line
Approximation Algorithms},
journal = {Math. Oper. Res.},
volume = {22},
number = {3},
pages = {513--544},
year = {1997},
url = {https://doi.org/10.1287/moor.22.3.513},
doi = {10.1287/MOOR.22.3.513},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HallSSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SchulzS97,
author = {Andreas S. Schulz and
Martin Skutella},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum
Criteria},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {416--429},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_32},
doi = {10.1007/3-540-63397-9\_32},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SchulzS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/SchulzS97,
author = {Andreas S. Schulz and
Martin Skutella},
editor = {Jos{\'{e}} D. P. Rolim},
title = {Random-Based Scheduling: New Approximations and {LP} Lower Bounds},
booktitle = {Randomization and Approximation Techniques in Computer Science, International
Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1269},
pages = {119--133},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63248-4\_11},
doi = {10.1007/3-540-63248-4\_11},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/SchulzS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MohringSS96,
author = {Rolf H. M{\"{o}}hring and
Markus W. Sch{\"{a}}ffter and
Andreas S. Schulz},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Scheduling Jobs with Communication Delays: Using Infeasible Solutions
for Approximation (Extended Abstract)},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {76--90},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_48},
doi = {10.1007/3-540-61680-2\_48},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MohringSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChakrabartiPSSSW96,
author = {Soumen Chakrabarti and
Cynthia A. Phillips and
Andreas S. Schulz and
David B. Shmoys and
Clifford Stein and
Joel Wein},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Improved Scheduling Algorithms for Minsum Criteria},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {646--657},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_166},
doi = {10.1007/3-540-61440-0\_166},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChakrabartiPSSSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Schulz96,
author = {Andreas S. Schulz},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {Scheduling to Minimize Total Weighted Completion Time: Performance
Guarantees of LP-Based Heuristics and Lower Bounds},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {301--315},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_23},
doi = {10.1007/3-540-61310-2\_23},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Schulz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MullerS96,
author = {Rudolf M{\"{u}}ller and
Andreas S. Schulz},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {Transitive Packing},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {430--444},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_32},
doi = {10.1007/3-540-61310-2\_32},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MullerS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HartmannSS96,
author = {Stephan Hartmann and
Markus W. Sch{\"{a}}ffter and
Andreas S. Schulz},
editor = {Fabrizio d'Amore and
Paolo Giulio Franciosa and
Alberto Marchetti{-}Spaccamela},
title = {Switchbox Routing in {VLSI} Design: Closing the Complexity Gap},
booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop,
{WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1197},
pages = {196--210},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62559-3\_17},
doi = {10.1007/3-540-62559-3\_17},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HartmannSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schulz95,
author = {Andreas S. Schulz},
title = {The Permutahedron of Series-parallel Posets},
journal = {Discret. Appl. Math.},
volume = {57},
number = {1},
pages = {85--90},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00079-S},
doi = {10.1016/0166-218X(94)00079-S},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schulz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SchulzWZ95,
author = {Andreas S. Schulz and
Robert Weismantel and
G{\"{u}}nter M. Ziegler},
editor = {Paul G. Spirakis},
title = {0/1-Integer Programming: Optimization and Augmentation are Equivalent},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {473--483},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_164},
doi = {10.1007/3-540-60313-1\_164},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SchulzWZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MullerS95,
author = {Rudolf M{\"{u}}ller and
Andreas S. Schulz},
editor = {Egon Balas and
Jens Clausen},
title = {The Interval Order Polytope of a Digraph},
booktitle = {Integer Programming and Combinatorial Optimization, 4th International
{IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {920},
pages = {50--64},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59408-6\_41},
doi = {10.1007/3-540-59408-6\_41},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MullerS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/QueyranneS95,
author = {Maurice Queyranne and
Andreas S. Schulz},
editor = {Egon Balas and
Jens Clausen},
title = {Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines
with Nonstationary Speeds},
booktitle = {Integer Programming and Combinatorial Optimization, 4th International
{IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {920},
pages = {307--320},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59408-6\_60},
doi = {10.1007/3-540-59408-6\_60},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/QueyranneS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-01-11 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
