Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: James B. Orlin
@article{DBLP:journals/jacm/OrlinV23,
author = {James B. Orlin and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Directed Shortest Paths via Approximate Cost Balancing},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {3:1--3:33},
year = {2023},
url = {https://doi.org/10.1145/3565019},
doi = {10.1145/3565019},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OrlinV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-15702,
author = {Nathan Atkinson and
Scott C. Ganz and
Dorit S. Hochbaum and
James B. Orlin},
title = {The Strong Maximum Circulation Algorithm: {A} New Method for Aggregating
Preference Rankings},
journal = {CoRR},
volume = {abs/2307.15702},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.15702},
doi = {10.48550/ARXIV.2307.15702},
eprinttype = {arXiv},
eprint = {2307.15702},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-15702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrlinG21,
author = {James B. Orlin and
Xiao{-}Yue Gong},
title = {A fast maximum flow algorithm},
journal = {Networks},
volume = {77},
number = {2},
pages = {287--321},
year = {2021},
url = {https://doi.org/10.1002/net.22001},
doi = {10.1002/NET.22001},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrlinG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/OrlinV21,
author = {James B. Orlin and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {D{\'{a}}niel Marx},
title = {Directed Shortest Paths via Approximate Cost Balancing},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {235--254},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.16},
doi = {10.1137/1.9781611976465.16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/OrlinV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CelaKLOWW21,
author = {Eranda {\c{C}}ela and
Bettina Klinz and
Stefan Lendl and
James B. Orlin and
Gerhard J. Woeginger and
Lasse Wulf},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Linearizable Special Cases of the Quadratic Shortest Path Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {245--256},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_19},
doi = {10.1007/978-3-030-86838-3\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CelaKLOWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenMOS20,
author = {Louis L. Chen and
Will Ma and
James B. Orlin and
David Simchi{-}Levi},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Distributionally Robust Max Flows},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {81--90},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.12},
doi = {10.1137/1.9781611976014.12},
timestamp = {Tue, 09 Mar 2021 20:52:21 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenMOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-07975,
author = {James B. Orlin and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Directed Shortest Paths via Approximate Cost Balancing},
journal = {CoRR},
volume = {abs/2007.07975},
year = {2020},
url = {https://arxiv.org/abs/2007.07975},
eprinttype = {arXiv},
eprint = {2007.07975},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-07975.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-04848,
author = {James B. Orlin and
Xiao{-}Yue Gong},
title = {A Fast Max Flow Algorithm},
journal = {CoRR},
volume = {abs/1910.04848},
year = {2019},
url = {http://arxiv.org/abs/1910.04848},
eprinttype = {arXiv},
eprint = {1910.04848},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-04848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OrlinSW18,
author = {James B. Orlin and
K. Subramani and
Piotr Wojciechowski},
title = {Randomized algorithms for finding the shortest negative cost cycle
in networks},
journal = {Discret. Appl. Math.},
volume = {236},
pages = {387--394},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.10.011},
doi = {10.1016/J.DAM.2017.10.011},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OrlinSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HalmanNO18,
author = {Nir Halman and
Giacomo Nannicini and
James B. Orlin},
title = {On the complexity of energy storage problems},
journal = {Discret. Optim.},
volume = {28},
pages = {31--53},
year = {2018},
url = {https://doi.org/10.1016/j.disopt.2017.11.001},
doi = {10.1016/J.DISOPT.2017.11.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/HalmanNO18.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}
}
@incollection{DBLP:books/tf/18/AhujaEOP18,
author = {Ravindra K. Ahuja and
{\"{O}}zlem Ergun and
James B. Orlin and
Abraham P. Punnen},
editor = {Teofilo F. Gonzalez},
title = {Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {311--326},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-18},
doi = {10.1201/9781351236423-18},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/AhujaEOP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/OrlinS17,
author = {James B. Orlin and
Antonio Sede{\~{n}}o{-}Noda},
editor = {Philip N. Klein},
title = {An \emph{O}(\emph{nm}) time algorithm for finding the min length directed
cycle in a graph},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1866--1879},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.122},
doi = {10.1137/1.9781611974782.122},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/OrlinS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JoormannOP16,
author = {Imke Joormann and
James B. Orlin and
Marc E. Pfetsch},
title = {A characterization of irreducible infeasible subsystems in flow networks},
journal = {Networks},
volume = {68},
number = {2},
pages = {121--129},
year = {2016},
url = {https://doi.org/10.1002/net.21686},
doi = {10.1002/NET.21686},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/JoormannOP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BertsimasNO16,
author = {Dimitris Bertsimas and
Ebrahim Nasrabadi and
James B. Orlin},
title = {On the power of randomization in network interdiction},
journal = {Oper. Res. Lett.},
volume = {44},
number = {1},
pages = {114--120},
year = {2016},
url = {https://doi.org/10.1016/j.orl.2015.11.005},
doi = {10.1016/J.ORL.2015.11.005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BertsimasNO16.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}
}
@article{DBLP:journals/siamjo/HalmanNO15,
author = {Nir Halman and
Giacomo Nannicini and
James B. Orlin},
title = {A Computationally Efficient {FPTAS} for Convex Stochastic Dynamic
Programs},
journal = {{SIAM} J. Optim.},
volume = {25},
number = {1},
pages = {317--350},
year = {2015},
url = {https://doi.org/10.1137/13094774X},
doi = {10.1137/13094774X},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/HalmanNO15.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}
}
@article{DBLP:journals/siamdm/HalmanKLOS14,
author = {Nir Halman and
Diego Klabjan and
Chung{-}Lun Li and
James B. Orlin and
David Simchi{-}Levi},
title = {Fully Polynomial Time Approximation Schemes for Stochastic Dynamic
Programs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {4},
pages = {1725--1796},
year = {2014},
url = {https://doi.org/10.1137/130925153},
doi = {10.1137/130925153},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HalmanKLOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ElkindO13,
author = {Edith Elkind and
James B. Orlin},
title = {On the hardness of finding subsets with equal average},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {477--480},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.001},
doi = {10.1016/J.IPL.2013.04.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ElkindO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumO13,
author = {Dorit S. Hochbaum and
James B. Orlin},
title = {Simplifications and speedups of the pseudoflow algorithm},
journal = {Networks},
volume = {61},
number = {1},
pages = {40--57},
year = {2013},
url = {https://doi.org/10.1002/net.21467},
doi = {10.1002/NET.21467},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrlinV13,
author = {James B. Orlin and
Balachandran Vaidyanathan},
title = {Fast algorithms for convex cost flow problems on circles, lines, and
trees},
journal = {Networks},
volume = {62},
number = {4},
pages = {288--296},
year = {2013},
url = {https://doi.org/10.1002/net.21517},
doi = {10.1002/NET.21517},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrlinV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HalmanNO13,
author = {Nir Halman and
Giacomo Nannicini and
James B. Orlin},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {A Computationally Efficient {FPTAS} for Convex Stochastic Dynamic
Programs},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {577--588},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_49},
doi = {10.1007/978-3-642-40450-4\_49},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/HalmanNO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin13,
author = {James B. Orlin},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Max flows in O(nm) time, or better},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {765--774},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488705},
doi = {10.1145/2488608.2488705},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Orlin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BertsimasNO13,
author = {Dimitris Bertsimas and
Ebrahim Nasrabadi and
James B. Orlin},
title = {On the power of randomization in network interdiction},
journal = {CoRR},
volume = {abs/1312.3478},
year = {2013},
url = {http://arxiv.org/abs/1312.3478},
eprinttype = {arXiv},
eprint = {1312.3478},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BertsimasNO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NasrabadiO13,
author = {Ebrahim Nasrabadi and
James B. Orlin},
title = {Robust optimization with incremental recourse},
journal = {CoRR},
volume = {abs/1312.4075},
year = {2013},
url = {http://arxiv.org/abs/1312.4075},
eprinttype = {arXiv},
eprint = {1312.4075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NasrabadiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HalmanOS12,
author = {Nir Halman and
James B. Orlin and
David Simchi{-}Levi},
title = {Approximating the Nonlinear Newsvendor and Single-Item Stochastic
Lot-Sizing Problems When Data Is Given by an Oracle},
journal = {Oper. Res.},
volume = {60},
number = {2},
pages = {429--446},
year = {2012},
url = {https://doi.org/10.1287/opre.1110.1031},
doi = {10.1287/OPRE.1110.1031},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HalmanOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/GhiyasvandO12,
author = {Mehdi Ghiyasvand and
James B. Orlin},
title = {A Simple Approximation Algorithm for Computing Arrow-Debreu Prices},
journal = {Oper. Res.},
volume = {60},
number = {5},
pages = {1245--1248},
year = {2012},
url = {https://doi.org/10.1287/opre.1120.1113},
doi = {10.1287/OPRE.1120.1113},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/GhiyasvandO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/MilanicOR11,
author = {Martin Milanic and
James B. Orlin and
G{\'{a}}bor Rudolf},
title = {Complexity results for equistable graphs and related classes},
journal = {Ann. Oper. Res.},
volume = {188},
number = {1},
pages = {359--370},
year = {2011},
url = {https://doi.org/10.1007/s10479-010-0720-3},
doi = {10.1007/S10479-010-0720-3},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/MilanicOR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HuhLRO11,
author = {Woonghee Tim Huh and
Retsef Levi and
Paat Rusmevichientong and
James B. Orlin},
title = {Adaptive Data-Driven Inventory Control with Censored Demand Based
on Kaplan-Meier Estimator},
journal = {Oper. Res.},
volume = {59},
number = {4},
pages = {929--941},
year = {2011},
url = {https://doi.org/10.1287/opre.1100.0906},
doi = {10.1287/OPRE.1100.0906},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HuhLRO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KodialamLOS11,
author = {Murali S. Kodialam and
T. V. Lakshman and
James B. Orlin and
Sudipta Sengupta},
title = {End-to-end restorable oblivious routing of hose model traffic},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {19},
number = {4},
pages = {1223--1236},
year = {2011},
url = {https://doi.org/10.1109/TNET.2011.2121918},
doi = {10.1109/TNET.2011.2121918},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KodialamLOS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/DrorOZ10,
author = {Moshe Dror and
James B. Orlin and
Michael Zhu},
title = {Packing Shelves with Items that Divide the Shelves' Length: a Case
of a Universal Number Partition Problem},
journal = {Discret. Math. Algorithms Appl.},
volume = {2},
number = {2},
pages = {189--198},
year = {2010},
url = {https://doi.org/10.1142/S1793830910000565},
doi = {10.1142/S1793830910000565},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/DrorOZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OrlinMSW10,
author = {James B. Orlin and
Kamesh Madduri and
K. Subramani and
Matthew D. Williamson},
title = {A faster algorithm for the single source shortest path problem with
few distinct positive lengths},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {189--198},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.03.001},
doi = {10.1016/J.JDA.2009.03.001},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OrlinMSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin10,
author = {James B. Orlin},
editor = {Leonard J. Schulman},
title = {Improved algorithms for computing fisher's market clearing prices:
computing fisher's market clearing prices},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {291--300},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806731},
doi = {10.1145/1806689.1806731},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Orlin10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Orlin10,
author = {James B. Orlin},
editor = {Edith Elkind and
Nimrod Megiddo and
Peter Bro Miltersen and
Vijay V. Vazirani and
Bernhard von Stengel},
title = {Improved Algorithms for Computing Fisher's Market Clearing Prices},
booktitle = {Equilibrium Computation, 25.04. - 30.04.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10171},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2672/},
timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Orlin10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SerefAO09,
author = {Onur Seref and
Ravindra K. Ahuja and
James B. Orlin},
title = {Incremental Network Optimization: Theory and Algorithms},
journal = {Oper. Res.},
volume = {57},
number = {3},
pages = {586--594},
year = {2009},
url = {https://doi.org/10.1287/opre.1080.0607},
doi = {10.1287/OPRE.1080.0607},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SerefAO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HalmanKMOS09,
author = {Nir Halman and
Diego Klabjan and
Mohamed Mostagir and
James B. Orlin and
David Simchi{-}Levi},
title = {A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic
Inventory Control with Discrete Demand},
journal = {Math. Oper. Res.},
volume = {34},
number = {3},
pages = {674--685},
year = {2009},
url = {https://doi.org/10.1287/moor.1090.0391},
doi = {10.1287/MOOR.1090.0391},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HalmanKMOS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin09,
author = {James B. Orlin},
title = {A faster strongly polynomial time algorithm for submodular function
minimization},
journal = {Math. Program.},
volume = {118},
number = {2},
pages = {237--251},
year = {2009},
url = {https://doi.org/10.1007/s10107-007-0189-2},
doi = {10.1007/S10107-007-0189-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Orlin09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KodialamLOS09,
author = {Murali S. Kodialam and
T. V. Lakshman and
James B. Orlin and
Sudipta Sengupta},
title = {Oblivious routing of highly variable traffic in service overlays and
{IP} backbones},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {17},
number = {2},
pages = {459--472},
year = {2009},
url = {http://doi.acm.org/10.1145/1552193.1552201},
doi = {10.1145/1552193.1552201},
timestamp = {Mon, 08 Jun 2009 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KodialamLOS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IwataO09,
author = {Satoru Iwata and
James B. Orlin},
editor = {Claire Mathieu},
title = {A simple combinatorial algorithm for submodular function minimization},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1230--1237},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.133},
doi = {10.1137/1.9781611973068.133},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/IwataO09.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}
}
@incollection{DBLP:reference/opt/AhujaMO09,
author = {Ravindra K. Ahuja and
Thomas L. Magnanti and
James B. Orlin},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Maximum Flow Problem},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {2009--2020},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_361},
doi = {10.1007/978-0-387-74759-0\_361},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/AhujaMO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/AhujaMO09a,
author = {Ravindra K. Ahuja and
Thomas L. Magnanti and
James B. Orlin},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Minimum Cost Flow Problem},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {2095--2108},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_373},
doi = {10.1007/978-0-387-74759-0\_373},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/AhujaMO09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/KumarO08,
author = {Mahesh Kumar and
James B. Orlin},
title = {Scale-invariant clustering with minimum volume ellipsoids},
journal = {Comput. Oper. Res.},
volume = {35},
number = {4},
pages = {1017--1029},
year = {2008},
url = {https://doi.org/10.1016/j.cor.2006.07.001},
doi = {10.1016/J.COR.2006.07.001},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/KumarO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BurkeDO08,
author = {Edmund K. Burke and
Moshe Dror and
James B. Orlin},
title = {Scheduling malleable tasks with interdependent processing rates: Comments
and observations},
journal = {Discret. Appl. Math.},
volume = {156},
number = {5},
pages = {620--626},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.08.008},
doi = {10.1016/J.DAM.2007.08.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BurkeDO08.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/networks/BompadreO08,
author = {Agust{\'{\i}}n Bompadre and
James B. Orlin},
title = {A simple method for improving the primal simplex method for the multicommodity
flow problem},
journal = {Networks},
volume = {51},
number = {1},
pages = {63--77},
year = {2008},
url = {https://doi.org/10.1002/net.20196},
doi = {10.1002/NET.20196},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BompadreO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DrorO08,
author = {Moshe Dror and
James B. Orlin},
title = {Combinatorial Optimization with Explicit Delineation of the Ground
Set by a Collection of Subsets},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {4},
pages = {1019--1034},
year = {2008},
url = {https://doi.org/10.1137/050636589},
doi = {10.1137/050636589},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DrorO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/VaidyanathanAO08,
author = {Balachandran Vaidyanathan and
Ravindra K. Ahuja and
James B. Orlin},
title = {The Locomotive Routing Problem},
journal = {Transp. Sci.},
volume = {42},
number = {4},
pages = {492--507},
year = {2008},
url = {https://doi.org/10.1287/trsc.1080.0244},
doi = {10.1287/TRSC.1080.0244},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/VaidyanathanAO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Orlin08,
author = {James B. Orlin},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {A Fast, Simpler Algorithm for the Matroid Parity Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {240--258},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_17},
doi = {10.1007/978-3-540-68891-4\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Orlin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalmanKLOS08,
author = {Nir Halman and
Diego Klabjan and
Chung{-}Lun Li and
James B. Orlin and
David Simchi{-}Levi},
editor = {Shang{-}Hua Teng},
title = {Fully polynomial time approximation schemes for stochastic dynamic
programs},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {700--709},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347159},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HalmanKLOS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhujaGMOS07,
author = {Ravindra K. Ahuja and
Jon Goodstein and
Amit Mukherjee and
James B. Orlin and
Dushyant Sharma},
title = {A Very Large-Scale Neighborhood Search Algorithm for the Combined
Through-Fleet-Assignment Model},
journal = {{INFORMS} J. Comput.},
volume = {19},
number = {3},
pages = {416--428},
year = {2007},
url = {https://doi.org/10.1287/ijoc.1060.0193},
doi = {10.1287/IJOC.1060.0193},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AhujaGMOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhujaJOS07,
author = {Ravindra K. Ahuja and
Krishna C. Jha and
James B. Orlin and
Dushyant Sharma},
title = {Very Large-Scale Neighborhood Search for the Quadratic Assignment
Problem},
journal = {{INFORMS} J. Comput.},
volume = {19},
number = {4},
pages = {646--657},
year = {2007},
url = {https://doi.org/10.1287/ijoc.1060.0201},
doi = {10.1287/IJOC.1060.0201},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AhujaJOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/NaceO07,
author = {Dritan Nace and
James B. Orlin},
title = {Lexicographically Minimum and Maximum Load Linear Programming Problems},
journal = {Oper. Res.},
volume = {55},
number = {1},
pages = {182--187},
year = {2007},
url = {https://doi.org/10.1287/opre.1060.0341},
doi = {10.1287/OPRE.1060.0341},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/NaceO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaKJO07,
author = {Ravindra K. Ahuja and
Arvind Kumar and
Krishna C. Jha and
James B. Orlin},
title = {Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem},
journal = {Oper. Res.},
volume = {55},
number = {6},
pages = {1136--1146},
year = {2007},
url = {https://doi.org/10.1287/opre.1070.0440},
doi = {10.1287/OPRE.1070.0440},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaKJO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/KodialamLOS07,
author = {Murali S. Kodialam and
T. V. Lakshman and
James B. Orlin and
Sudipta Sengupta},
title = {Preconfiguring IP-over-Optical Networks to Handle Router Failures
and Unpredictable Traffic},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {25},
number = {5},
pages = {934--948},
year = {2007},
url = {https://doi.org/10.1109/JSAC.2007.070607},
doi = {10.1109/JSAC.2007.070607},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/KodialamLOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Orlin07,
author = {James B. Orlin},
editor = {Matteo Fischetti and
David P. Williamson},
title = {A Faster Strongly Polynomial Time Algorithm for Submodular Function
Minimization},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {240--251},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_19},
doi = {10.1007/978-3-540-72792-7\_19},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Orlin07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ErgunPOA07,
author = {{\"{O}}zlem Ergun and
Abraham P. Punnen and
James B. Orlin and
Ravindra K. Ahuja},
editor = {Teofilo F. Gonzalez},
title = {Very Large-Scale Neighborhood Search},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch20},
doi = {10.1201/9781420010749.CH20},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/ErgunPOA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ErgunO06,
author = {{\"{O}}zlem Ergun and
James B. Orlin},
title = {A dynamic programming methodology in very large scale neighborhood
search applied to the traveling salesman problem},
journal = {Discret. Optim.},
volume = {3},
number = {1},
pages = {78--85},
year = {2006},
url = {https://doi.org/10.1016/j.disopt.2005.10.002},
doi = {10.1016/J.DISOPT.2005.10.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ErgunO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BompadreDO06,
author = {Agust{\'{\i}}n Bompadre and
Moshe Dror and
James B. Orlin},
title = {Improved bounds for vehicle routing solutions},
journal = {Discret. Optim.},
volume = {3},
number = {4},
pages = {299--316},
year = {2006},
url = {https://doi.org/10.1016/j.disopt.2006.04.002},
doi = {10.1016/J.DISOPT.2006.04.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BompadreDO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/ErgunOS06,
author = {{\"{O}}zlem Ergun and
James B. Orlin and
Abran Steele{-}Feldman},
title = {Creating very large scale neighborhoods out of smaller ones by compounding
moves},
journal = {J. Heuristics},
volume = {12},
number = {1-2},
pages = {115--140},
year = {2006},
url = {https://doi.org/10.1007/s10732-006-5561-5},
doi = {10.1007/S10732-006-5561-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/ErgunOS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/DrorLOP06,
author = {Moshe Dror and
Yusin Lee and
James B. Orlin and
Valentin Polishchuk},
title = {The Tsp and the Sum of its Marginal Values},
journal = {Int. J. Comput. Geom. Appl.},
volume = {16},
number = {4},
pages = {333--344},
year = {2006},
url = {https://doi.org/10.1142/S0218195906002063},
doi = {10.1142/S0218195906002063},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/DrorLOP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CsirikJKOSW06,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
title = {On the Sum-of-Squares algorithm for bin packing},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {1--65},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120583},
doi = {10.1145/1120582.1120583},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CsirikJKOSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ErgunO06,
author = {{\"{O}}zlem Ergun and
James B. Orlin},
title = {Fast neighborhood search for the single machine total weighted tardiness
problem},
journal = {Oper. Res. Lett.},
volume = {34},
number = {1},
pages = {41--45},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.01.010},
doi = {10.1016/J.ORL.2005.01.010},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ErgunO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KodialamLOS06,
author = {Murali S. Kodialam and
T. V. Lakshman and
James B. Orlin and
Sudipta Sengupta},
title = {A Versatile Scheme for Routing Highly Variable Traffic in Service
Overlays and {IP} Backbones},
booktitle = {{INFOCOM} 2006. 25th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
23-29 April 2006, Barcelona, Catalunya, Spain},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/INFOCOM.2006.181},
doi = {10.1109/INFOCOM.2006.181},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/KodialamLOS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KodialamLOS06a,
author = {Murali S. Kodialam and
T. V. Lakshman and
James B. Orlin and
Sudipta Sengupta},
title = {Preconfiguring IP-Over-Optical Networks to Handle Router Failures
and Unpredictable Traffic},
booktitle = {{INFOCOM} 2006. 25th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
23-29 April 2006, Barcelona, Catalunya, Spain},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/INFOCOM.2006.332},
doi = {10.1109/INFOCOM.2006.332},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/KodialamLOS06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/patat/MeyersO06,
author = {Carol Meyers and
James B. Orlin},
editor = {Edmund K. Burke and
Hana Rudov{\'{a}}},
title = {Very Large-Scale Neighborhood Search Techniques in Timetabling Problems},
booktitle = {Practice and Theory of Automated Timetabling VI, 6th International
Conference, {PATAT} 2006, Brno, Czech Republic, August 30 - September
1, 2006, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3867},
pages = {24--39},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-77345-0\_2},
doi = {10.1007/978-3-540-77345-0\_2},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/patat/MeyersO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/BlandO05,
author = {Robert G. Bland and
James B. Orlin},
title = {IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson},
journal = {Int. Trans. Oper. Res.},
volume = {12},
number = {3},
pages = {367--372},
year = {2005},
url = {https://doi.org/10.1111/j.1475-3995.2005.00506.x},
doi = {10.1111/J.1475-3995.2005.00506.X},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/BlandO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/RamaswamyOC05,
author = {Ramkumar Ramaswamy and
James B. Orlin and
Nilopal Chakravarti},
title = {Sensitivity analysis for shortest path problems and maximum capacity
path problems in undirected graphs},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {355--369},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0517-8},
doi = {10.1007/S10107-004-0517-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/RamaswamyOC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/AhujaLOSS05,
author = {Ravindra K. Ahuja and
Jian Liu and
James B. Orlin and
Dushyant Sharma and
Larry A. Shughart},
title = {Solving Real-Life Locomotive-Scheduling Problems},
journal = {Transp. Sci.},
volume = {39},
number = {4},
pages = {503--517},
year = {2005},
url = {https://doi.org/10.1287/trsc.1050.0115},
doi = {10.1287/TRSC.1050.0115},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/AhujaLOSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BompadreO05,
author = {Agust{\'{\i}}n Bompadre and
James B. Orlin},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Using Grammars to Generate Very Large Scale Neighborhoods for the
Traveling Salesman Problem and Other Sequencing Problems},
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 = {437--451},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_32},
doi = {10.1007/11496915\_32},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BompadreO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhujaHO04,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
title = {A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network
Flow Problem},
journal = {Algorithmica},
volume = {39},
number = {3},
pages = {189--208},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1085-2},
doi = {10.1007/S00453-004-1085-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhujaHO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/AhujaOPSS04,
author = {Ravindra K. Ahuja and
James B. Orlin and
Stefano Pallottino and
Maria Paola Scaparra and
Maria Grazia Scutell{\`{a}}},
title = {A Multi-Exchange Heuristic for the Single-Source Capacitated Facility
Location Problem},
journal = {Manag. Sci.},
volume = {50},
number = {6},
pages = {749--760},
year = {2004},
url = {https://doi.org/10.1287/mnsc.1030.0193},
doi = {10.1287/MNSC.1030.0193},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/AhujaOPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinS04,
author = {James B. Orlin and
Dushyant Sharma},
title = {Extended neighborhood: Definition and characterization},
journal = {Math. Program.},
volume = {101},
number = {3},
pages = {537--559},
year = {2004},
url = {https://doi.org/10.1007/s10107-003-0497-0},
doi = {10.1007/S10107-003-0497-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OrlinS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AhujaLOGM04,
author = {Ravindra K. Ahuja and
Jian Liu and
James B. Orlin and
Jon Goodstein and
Amit Mukherjee},
title = {A neighborhood search algorithm for the combined through and fleet
assignment model with time windows},
journal = {Networks},
volume = {44},
number = {2},
pages = {160--171},
year = {2004},
url = {https://doi.org/10.1002/net.20026},
doi = {10.1002/NET.20026},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhujaLOGM04.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/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/mansci/AhujaHO03,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
title = {Solving the Convex Cost Integer Dual Network Flow Problem},
journal = {Manag. Sci.},
volume = {49},
number = {7},
pages = {950--964},
year = {2003},
url = {https://doi.org/10.1287/mnsc.49.7.950.16384},
doi = {10.1287/MNSC.49.7.950.16384},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/AhujaHO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AhujaOPS03,
author = {Ravindra K. Ahuja and
James B. Orlin and
Stefano Pallottino and
Maria Grazia Scutell{\`{a}}},
title = {Dynamic shortest paths minimizing travel times and costs},
journal = {Networks},
volume = {41},
number = {4},
pages = {197--205},
year = {2003},
url = {https://doi.org/10.1002/net.10072},
doi = {10.1002/NET.10072},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhujaOPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AhujaOS03,
author = {Ravindra K. Ahuja and
James B. Orlin and
Dushyant Sharma},
title = {A composite very large-scale neighborhood structure for the capacitated
minimum spanning tree problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {185--194},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00236-5},
doi = {10.1016/S0167-6377(02)00236-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AhujaOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AhujaEOP02,
author = {Ravindra K. Ahuja and
{\"{O}}zlem Ergun and
James B. Orlin and
Abraham P. Punnen},
title = {A survey of very large-scale neighborhood search techniques},
journal = {Discret. Appl. Math.},
volume = {123},
number = {1-3},
pages = {75--102},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00338-9},
doi = {10.1016/S0166-218X(01)00338-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AhujaEOP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AggarwalO02,
author = {Charu C. Aggarwal and
James B. Orlin},
title = {On multiroute maximum flows in networks},
journal = {Networks},
volume = {39},
number = {1},
pages = {43--52},
year = {2002},
url = {https://doi.org/10.1002/net.10008},
doi = {10.1002/NET.10008},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AggarwalO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AhujaO02,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {Combinatorial algorithms for inverse network flow problems},
journal = {Networks},
volume = {40},
number = {4},
pages = {181--187},
year = {2002},
url = {https://doi.org/10.1002/net.10048},
doi = {10.1002/NET.10048},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhujaO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AhujaOSS02,
author = {Ravindra K. Ahuja and
James B. Orlin and
Prabha Sharma and
P. T. Sokkalingam},
title = {A network simplex algorithm with O(\emph{n}) consecutive degenerate
pivots},
journal = {Oper. Res. Lett.},
volume = {30},
number = {3},
pages = {141--148},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(02)00114-1},
doi = {10.1016/S0167-6377(02)00114-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AhujaOSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/AhujaOPS02,
author = {Ravindra K. Ahuja and
James B. Orlin and
Stefano Pallottino and
Maria Grazia Scutell{\`{a}}},
title = {Minimum Time and Minimum Cost-Path Problems in Street Networks with
Periodic Traffic Lights},
journal = {Transp. Sci.},
volume = {36},
number = {3},
pages = {326--336},
year = {2002},
url = {https://doi.org/10.1287/trsc.36.3.326.7827},
doi = {10.1287/TRSC.36.3.326.7827},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/AhujaOPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BontridderLLOS02,
author = {Koen M. J. De Bontridder and
B. J. Lageweg and
Jan Karel Lenstra and
James B. Orlin and
Leen Stougie},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Branch-and-Bound Algorithms for the Test Cover Problem},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {223--233},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_23},
doi = {10.1007/3-540-45749-6\_23},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BontridderLLOS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205041,
author = {Neal E. Young and
Robert Endre Tarjan and
James B. Orlin},
title = {Faster Parametric Shortest Path and Minimum Balance Algorithms},
journal = {CoRR},
volume = {cs.DS/0205041},
year = {2002},
url = {https://arxiv.org/abs/cs/0205041},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0210013,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
title = {On the Sum-of-Squares Algorithm for Bin Packing},
journal = {CoRR},
volume = {cs.DS/0210013},
year = {2002},
url = {https://arxiv.org/abs/cs/0210013},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0210013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaO01,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {Inverse Optimization},
journal = {Oper. Res.},
volume = {49},
number = {5},
pages = {771--783},
year = {2001},
url = {https://doi.org/10.1287/opre.49.5.771.10607},
doi = {10.1287/OPRE.49.5.771.10607},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaO01a,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {A Fast Scaling Algorithm for Minimizing Separable Convex Functions
Subject to Chain Constraints},
journal = {Oper. Res.},
volume = {49},
number = {5},
pages = {784--789},
year = {2001},
url = {https://doi.org/10.1287/opre.49.5.784.10601},
doi = {10.1287/OPRE.49.5.784.10601},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaO01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AhujaOS01,
author = {Ravindra K. Ahuja and
James B. Orlin and
Dushyant Sharma},
title = {Multi-exchange neighborhood structures for the capacitated minimum
spanning tree problem},
journal = {Math. Program.},
volume = {91},
number = {1},
pages = {71--97},
year = {2001},
url = {https://doi.org/10.1007/s101070100234},
doi = {10.1007/S101070100234},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AhujaOS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/AhujaOT00,
author = {Ravindra K. Ahuja and
James B. Orlin and
Ashish Tiwari},
title = {A greedy genetic algorithm for the quadratic assignment problem},
journal = {Comput. Oper. Res.},
volume = {27},
number = {10},
pages = {917--934},
year = {2000},
url = {https://doi.org/10.1016/S0305-0548(99)00067-2},
doi = {10.1016/S0305-0548(99)00067-2},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/AhujaOT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AhujaO00,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {A Faster Algorithm for the Inverse Spanning Tree Problem},
journal = {J. Algorithms},
volume = {34},
number = {1},
pages = {177--193},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1052},
doi = {10.1006/JAGM.1999.1052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AhujaO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SokkalingamAO00,
author = {P. T. Sokkalingam and
Ravindra K. Ahuja and
James B. Orlin},
title = {New polynomial-time cycle-canceling algorithms for minimum-cost flows},
journal = {Networks},
volume = {36},
number = {1},
pages = {53--63},
year = {2000},
url = {https://doi.org/10.1002/1097-0037(200008)36:1\&\#60;53::AID-NET6\&\#62;3.0.CO;2-Y},
doi = {10.1002/1097-0037(200008)36:1\&\#60;53::AID-NET6\&\#62;3.0.CO;2-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SokkalingamAO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FleischerO00,
author = {Lisa Fleischer and
James B. Orlin},
title = {Optimal Rounding of Instantaneous Fractional Flows Over Time},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {2},
pages = {145--153},
year = {2000},
url = {https://doi.org/10.1137/S0895480198344138},
doi = {10.1137/S0895480198344138},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FleischerO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CsirikJKOSW00,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the sum-of-squares algorithm for bin packing},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {208--217},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335331},
doi = {10.1145/335305.335331},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CsirikJKOSW00.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/ior/SokkalingamAO99,
author = {P. T. Sokkalingam and
Ravindra K. Ahuja and
James B. Orlin},
title = {Solving Inverse Spanning Tree Problems Through Network Flow Techniques},
journal = {Oper. Res.},
volume = {47},
number = {2},
pages = {291--298},
year = {1999},
url = {https://doi.org/10.1287/opre.47.2.291},
doi = {10.1287/OPRE.47.2.291},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SokkalingamAO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AhujaHO99,
author = {Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Solving the Convex Cost Integer Dual Network Flow Problem},
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 = {31--44},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_3},
doi = {10.1007/3-540-48777-8\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AhujaHO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/OrlinASCGK99,
author = {James B. Orlin and
Ravindra K. Ahuja and
David Simchi{-}Levi and
Sunil Chopra and
Bruce L. Golden and
B. K. Kaku},
editor = {Kenneth H. Rosen and
John G. Michaels and
Jonathan L. Gross and
Jerrold W. Grossman and
Douglas R. Shier},
title = {Networks And Flows},
booktitle = {Handbook of Discrete and Combinatorial Mathematics},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781439832905.ch10},
doi = {10.1201/9781439832905.CH10},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/OrlinASCGK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SchneurO98,
author = {Rina R. Schneur and
James B. Orlin},
title = {A Scaling Algorithm for Multicommodity Flow Problems},
journal = {Oper. Res.},
volume = {46},
number = {2},
pages = {231--246},
year = {1998},
url = {https://doi.org/10.1287/opre.46.2.231},
doi = {10.1287/OPRE.46.2.231},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SchneurO98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AggarwalAHO98,
author = {Charu C. Aggarwal and
Ravindra K. Ahuja and
Jianxiu Hao and
James B. Orlin},
title = {Diagnosing infeasibilities in network flow problems},
journal = {Math. Program.},
volume = {81},
pages = {263--280},
year = {1998},
url = {https://doi.org/10.1007/BF01580084},
doi = {10.1007/BF01580084},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AggarwalAHO98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhujaO97,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {Developing Fitter Genetic Algorithms},
journal = {{INFORMS} J. Comput.},
volume = {9},
number = {3},
pages = {251--253},
year = {1997},
url = {https://doi.org/10.1287/ijoc.9.3.251},
doi = {10.1287/IJOC.9.3.251},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AhujaO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/MireaultOV97,
author = {Paul Mireault and
James B. Orlin and
Rakesh V. Vohra},
title = {A Parametric Worst Case Analysis of the {LPT} Heuristic for Two Uniform
Machines},
journal = {Oper. Res.},
volume = {45},
number = {1},
pages = {116--125},
year = {1997},
url = {https://doi.org/10.1287/opre.45.1.116},
doi = {10.1287/OPRE.45.1.116},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/MireaultOV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AggarwalOT97,
author = {Charu C. Aggarwal and
James B. Orlin and
Ray P. Tai},
title = {Optimized Crossover for the Independent Set Problem},
journal = {Oper. Res.},
volume = {45},
number = {2},
pages = {226--234},
year = {1997},
url = {https://doi.org/10.1287/opre.45.2.226},
doi = {10.1287/OPRE.45.2.226},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AggarwalOT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GoldfarbJO97,
author = {Donald Goldfarb and
Zhiying Jin and
James B. Orlin},
title = {Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized
Circulation Problem},
journal = {Math. Oper. Res.},
volume = {22},
number = {4},
pages = {793--802},
year = {1997},
url = {https://doi.org/10.1287/moor.22.4.793},
doi = {10.1287/MOOR.22.4.793},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GoldfarbJO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin97,
author = {James B. Orlin},
title = {A polynomial time primal network simplex algorithm for minimum cost
flows},
journal = {Math. Program.},
volume = {77},
pages = {109--129},
year = {1997},
url = {https://doi.org/10.1007/BF02614365},
doi = {10.1007/BF02614365},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Orlin97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AhujaO97,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {Equivalence of the primal and dual simplex algorithms for the maximum
flow problem},
journal = {Oper. Res. Lett.},
volume = {20},
number = {3},
pages = {101--108},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(96)00052-1},
doi = {10.1016/S0167-6377(96)00052-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AhujaO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Orlin96,
author = {James B. Orlin},
title = {Commentary - On Experimental Methods for Algorithm Simulation},
journal = {{INFORMS} J. Comput.},
volume = {8},
number = {1},
pages = {21--23},
year = {1996},
url = {https://doi.org/10.1287/ijoc.8.1.21},
doi = {10.1287/IJOC.8.1.21},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Orlin96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhujaO96,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {Use of Representative Operation Counts in Computational Testing of
Algorithms},
journal = {{INFORMS} J. Comput.},
volume = {8},
number = {3},
pages = {318--330},
year = {1996},
url = {https://doi.org/10.1287/ijoc.8.3.318},
doi = {10.1287/IJOC.8.3.318},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AhujaO96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Orlin96,
author = {James B. Orlin},
editor = {{\'{E}}va Tardos},
title = {A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost
Flows (An Extended Abstract)},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {474--481},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314105},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/Orlin96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AhujaO95,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {A capacity scaling algorithm for the constrained maximum flow problem},
journal = {Networks},
volume = {25},
number = {2},
pages = {89--98},
year = {1995},
url = {https://doi.org/10.1002/net.3230250207},
doi = {10.1002/NET.3230250207},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhujaO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HaoO94,
author = {Jianxiu Hao and
James B. Orlin},
title = {A Faster Algorithm for Finding the Minimum Cut in a Directed Graph},
journal = {J. Algorithms},
volume = {17},
number = {3},
pages = {424--446},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1043},
doi = {10.1006/JAGM.1994.1043},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/HaoO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BertsimasO94,
author = {Dimitris Bertsimas and
James B. Orlin},
title = {A technique for speeding up the solution of the Lagrangean dual},
journal = {Math. Program.},
volume = {63},
pages = {23--45},
year = {1994},
url = {https://doi.org/10.1007/BF01582057},
doi = {10.1007/BF01582057},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BertsimasO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhujaOST94,
author = {Ravindra K. Ahuja and
James B. Orlin and
Clifford Stein and
Robert Endre Tarjan},
title = {Improved Algorithms for Bipartite Network Flow},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {5},
pages = {906--933},
year = {1994},
url = {https://doi.org/10.1137/S0097539791199334},
doi = {10.1137/S0097539791199334},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AhujaOST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0069809,
author = {Ravindra K. Ahuja and
Thomas L. Magnanti and
James B. Orlin},
title = {Network flows - theory, algorithms and applications},
publisher = {Prentice Hall},
year = {1993},
isbn = {978-0-13-617549-0},
timestamp = {Wed, 27 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0069809.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShullSOL93,
author = {Randy Shull and
Alan Shuchat and
James B. Orlin and
Marianne Lepp},
title = {Recognizing Hidden Bicircular Networks},
journal = {Discret. Appl. Math.},
volume = {41},
number = {1},
pages = {13--53},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90243-H},
doi = {10.1016/0166-218X(93)90243-H},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShullSOL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Orlin93,
author = {James B. Orlin},
title = {A Faster Strongly Polynomial Minimum Cost Flow Algorithm},
journal = {Oper. Res.},
volume = {41},
number = {2},
pages = {338--350},
year = {1993},
url = {https://doi.org/10.1287/opre.41.2.338},
doi = {10.1287/OPRE.41.2.338},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Orlin93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MizunoSO93,
author = {Shinji Mizuno and
Romesh Saigal and
James B. Orlin},
title = {Determination of optimal vertices from feasible solutions in unimodular
linear programming},
journal = {Math. Program.},
volume = {59},
pages = {23--31},
year = {1993},
url = {https://doi.org/10.1007/BF01581235},
doi = {10.1007/BF01581235},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MizunoSO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinPT93,
author = {James B. Orlin and
Serge A. Plotkin and
{\'{E}}va Tardos},
title = {Polynomial dual network simplex algorithms},
journal = {Math. Program.},
volume = {60},
pages = {255--276},
year = {1993},
url = {https://doi.org/10.1007/BF01580615},
doi = {10.1007/BF01580615},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/OrlinPT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HartmannO93,
author = {Mark Hartmann and
James B. Orlin},
title = {Finding minimum cost to time ratio cycles with small integral transit
times},
journal = {Networks},
volume = {23},
number = {6},
pages = {567--574},
year = {1993},
url = {https://doi.org/10.1002/net.3230230607},
doi = {10.1002/NET.3230230607},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HartmannO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/OrlinS93,
author = {James B. Orlin and
Clifford Stein},
title = {Parallel algorithms for the assignment and minimum-cost flow problems},
journal = {Oper. Res. Lett.},
volume = {14},
number = {4},
pages = {181--186},
year = {1993},
url = {https://doi.org/10.1016/0167-6377(93)90068-R},
doi = {10.1016/0167-6377(93)90068-R},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/OrlinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaO92,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {The Scaling Network Simplex Algorithm},
journal = {Oper. Res.},
volume = {40},
number = {Supplement-1},
pages = {S5--S13},
year = {1992},
url = {https://doi.org/10.1287/opre.40.1.S5},
doi = {10.1287/OPRE.40.1.S5},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaO92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AhujaGOT92,
author = {Ravindra K. Ahuja and
Andrew V. Goldberg and
James B. Orlin and
Robert Endre Tarjan},
title = {Finding minimum-cost flows by double scaling},
journal = {Math. Program.},
volume = {53},
pages = {243--266},
year = {1992},
url = {https://doi.org/10.1007/BF01585705},
doi = {10.1007/BF01585705},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AhujaGOT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinA92,
author = {James B. Orlin and
Ravindra K. Ahuja},
title = {New scaling algorithms for the assignment and minimum mean cycle problems},
journal = {Math. Program.},
volume = {54},
pages = {41--56},
year = {1992},
url = {https://doi.org/10.1007/BF01586040},
doi = {10.1007/BF01586040},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OrlinA92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BertsimasO92,
author = {Dimitris Bertsimas and
James B. Orlin},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {A Technique for Speeding up the Solution of the Lagrangian Dual},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {435--452},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BertsimasO92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HaoO92,
author = {Jianxiu Hao and
James B. Orlin},
editor = {Greg N. Frederickson},
title = {A Faster Algorithm for Finding the Minimum Cut in a Graph},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {165--174},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139439},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/HaoO92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/YoungTO91,
author = {Neal E. Young and
Robert Endre Tarjan and
James B. Orlin},
title = {Faster parametric shortest path and minimum-balance algorithms},
journal = {Networks},
volume = {21},
number = {2},
pages = {205--221},
year = {1991},
url = {https://doi.org/10.1002/net.3230210206},
doi = {10.1002/NET.3230210206},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/YoungTO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/AhujaMO91,
author = {Ravindra K. Ahuja and
Thomas L. Magnanti and
James B. Orlin},
title = {Some Recent Advances in Network Flows},
journal = {{SIAM} Rev.},
volume = {33},
number = {2},
pages = {175--219},
year = {1991},
url = {https://doi.org/10.1137/1033048},
doi = {10.1137/1033048},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/AhujaMO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KodialamO91,
author = {Murali S. Kodialam and
James B. Orlin},
editor = {Alok Aggarwal},
title = {Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its
Relation to Integer Programming},
booktitle = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1991, San Francisco, California, {USA}},
pages = {131--135},
publisher = {{ACM/SIAM}},
year = {1991},
url = {http://dl.acm.org/citation.cfm?id=127787.127816},
timestamp = {Thu, 05 Jul 2018 07:28:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/KodialamO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AhujaMOT90,
author = {Ravindra K. Ahuja and
Kurt Mehlhorn and
James B. Orlin and
Robert Endre Tarjan},
title = {Faster Algorithms for the Shortest Path Problem},
journal = {J. {ACM}},
volume = {37},
number = {2},
pages = {213--223},
year = {1990},
url = {https://doi.org/10.1145/77600.77615},
doi = {10.1145/77600.77615},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AhujaMOT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinV90,
author = {James B. Orlin and
John H. Vande Vate},
title = {Solving the Linear Matroid Parity Problem as a Sequence of Matroid
Intersection Problems},
journal = {Math. Program.},
volume = {47},
pages = {81--106},
year = {1990},
url = {https://doi.org/10.1007/BF01580854},
doi = {10.1007/BF01580854},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OrlinV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShullOSG89,
author = {Randy Shull and
James B. Orlin and
Alan Shuchat and
Marianne L. Gardner},
title = {The structure of bases in bicircular matroids},
journal = {Discret. Appl. Math.},
volume = {23},
number = {3},
pages = {267--283},
year = {1989},
url = {https://doi.org/10.1016/0166-218X(89)90017-6},
doi = {10.1016/0166-218X(89)90017-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShullOSG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/AhujaO89,
author = {Ravindra K. Ahuja and
James B. Orlin},
title = {A Fast and Simple Algorithm for the Maximum Flow Problem},
journal = {Oper. Res.},
volume = {37},
number = {5},
pages = {748--759},
year = {1989},
url = {https://doi.org/10.1287/opre.37.5.748},
doi = {10.1287/OPRE.37.5.748},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/AhujaO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhujaOT89,
author = {Ravindra K. Ahuja and
James B. Orlin and
Robert Endre Tarjan},
title = {Improved Time Bounds for the Maximum Flow Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {939--954},
year = {1989},
url = {https://doi.org/10.1137/0218065},
doi = {10.1137/0218065},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AhujaOT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MagnantiO88,
author = {Thomas L. Magnanti and
James B. Orlin},
title = {Parametric linear programming and anti-cycling pivoting rules},
journal = {Math. Program.},
volume = {41},
number = {1-3},
pages = {317--325},
year = {1988},
url = {https://doi.org/10.1007/BF01580770},
doi = {10.1007/BF01580770},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MagnantiO88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin88,
author = {James B. Orlin},
editor = {Janos Simon},
title = {A Faster Strongly Polynominal Minimum Cost Flow Algorithm},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {377--387},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62249},
doi = {10.1145/62212.62249},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Orlin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ChakravartyOR85,
author = {Amiya K. Chakravarty and
James B. Orlin and
Uriel G. Rothblum},
title = {Consecutive Optimizers for a Partitioning Problem with Applications
to Optimal Inventory Groupings for Joint Replenishment},
journal = {Oper. Res.},
volume = {33},
number = {4},
pages = {820--834},
year = {1985},
url = {https://doi.org/10.1287/opre.33.4.820},
doi = {10.1287/OPRE.33.4.820},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ChakravartyOR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Orlin85,
author = {James B. Orlin},
title = {Technical Note - Some Very Easy Knapsack/Partition Problems},
journal = {Oper. Res.},
volume = {33},
number = {5},
pages = {1154--1160},
year = {1985},
url = {https://doi.org/10.1287/opre.33.5.1154},
doi = {10.1287/OPRE.33.5.1154},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Orlin85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MillerO85,
author = {Zevi Miller and
James B. Orlin},
title = {NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings},
journal = {J. Algorithms},
volume = {6},
number = {1},
pages = {10--16},
year = {1985},
url = {https://doi.org/10.1016/0196-6774(85)90016-1},
doi = {10.1016/0196-6774(85)90016-1},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MillerO85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinR85,
author = {James B. Orlin and
Uriel G. Rothblum},
title = {Computing optimal scalings by parametric network algorithms},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {1--10},
year = {1985},
url = {https://doi.org/10.1007/BF01585655},
doi = {10.1007/BF01585655},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OrlinR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FreundO85,
author = {Robert M. Freund and
James B. Orlin},
title = {On the complexity of four polyhedral set containment problems},
journal = {Math. Program.},
volume = {33},
number = {2},
pages = {139--145},
year = {1985},
url = {https://doi.org/10.1007/BF01582241},
doi = {10.1007/BF01582241},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FreundO85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GravesO85,
author = {Stephen C. Graves and
James B. Orlin},
title = {A minimum concave-cost dynamic network flow problem with an application
to lot-sizing},
journal = {Networks},
volume = {15},
number = {1},
pages = {59--71},
year = {1985},
url = {https://doi.org/10.1002/net.3230150107},
doi = {10.1002/NET.3230150107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GravesO85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Orlin84,
author = {James B. Orlin},
title = {Minimum Convex Cost Dynamic Network Flows},
journal = {Math. Oper. Res.},
volume = {9},
number = {2},
pages = {190--207},
year = {1984},
url = {https://doi.org/10.1287/moor.9.2.190},
doi = {10.1287/MOOR.9.2.190},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Orlin84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin83,
author = {James B. Orlin},
title = {Maximum-throughput dynamic network flows},
journal = {Math. Program.},
volume = {27},
number = {2},
pages = {214--231},
year = {1983},
url = {https://doi.org/10.1007/BF02591946},
doi = {10.1007/BF02591946},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Orlin83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Orlin83,
author = {James B. Orlin},
title = {Dynamic matchings and quasidynamic fractional matchings. {I}},
journal = {Networks},
volume = {13},
number = {4},
pages = {551--562},
year = {1983},
url = {https://doi.org/10.1002/net.3230130407},
doi = {10.1002/NET.3230130407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Orlin83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Orlin83a,
author = {James B. Orlin},
title = {Dynamic matchings and quasidynamic fractional matchings. {II}},
journal = {Networks},
volume = {13},
number = {4},
pages = {563--580},
year = {1983},
url = {https://doi.org/10.1002/net.3230130408},
doi = {10.1002/NET.3230130408},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Orlin83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Orlin82,
author = {James B. Orlin},
title = {Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule:
An Application of Periodic Posets},
journal = {Oper. Res.},
volume = {30},
number = {4},
pages = {760--776},
year = {1982},
url = {https://doi.org/10.1287/opre.30.4.760},
doi = {10.1287/OPRE.30.4.760},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Orlin82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin82,
author = {James B. Orlin},
title = {A polynomial algorithm for integer programming covering problems satisfying
the integer round-up property},
journal = {Math. Program.},
volume = {22},
number = {1},
pages = {231--235},
year = {1982},
url = {https://doi.org/10.1007/BF01581039},
doi = {10.1007/BF01581039},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Orlin82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KarpO81,
author = {Richard M. Karp and
James B. Orlin},
title = {Parametric shortest path algorithms with an application to cyclic
staffing},
journal = {Discret. Appl. Math.},
volume = {3},
number = {1},
pages = {37--45},
year = {1981},
url = {https://doi.org/10.1016/0166-218X(81)90026-3},
doi = {10.1016/0166-218X(81)90026-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KarpO81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin81,
author = {James B. Orlin},
title = {The Complexity of Dynamic Languages and Dynamic Optimization Problems},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {218--227},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802475},
doi = {10.1145/800076.802475},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Orlin81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BartholdiOR80,
author = {John J. Bartholdi III and
James B. Orlin and
H. Donald Ratliff},
title = {Cyclic Scheduling via Integer Programs with Circular Ones},
journal = {Oper. Res.},
volume = {28},
number = {5},
pages = {1074--1085},
year = {1980},
url = {https://doi.org/10.1287/opre.28.5.1074},
doi = {10.1287/OPRE.28.5.1074},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BartholdiOR80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Orlin78,
author = {James B. Orlin},
title = {Line-digraphs, arborescences, and theorems of tutte and knuth},
journal = {J. Comb. Theory, Ser. {B}},
volume = {25},
number = {2},
pages = {187--198},
year = {1978},
url = {https://doi.org/10.1016/0095-8956(78)90038-2},
doi = {10.1016/0095-8956(78)90038-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Orlin78.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-02-10 23: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:
