James B. Orlin
According to our database^{1},
James B. Orlin
authored at least 136 papers
between 1978 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at id.loc.gov

at web.mit.edu

at isni.org
On csauthors.net:
Bibliography
2020
CoRR, 2020
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
2019
CoRR, 2019
2018
Math. Program., 2018
Discret. Optim., 2018
Discret. Appl. Math., 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
2016
Oper. Res. Lett., 2016
Networks, 2016
2015
SIAM J. Optim., 2015
2014
SIAM J. Discret. Math., 2014
2013
Networks, 2013
Networks, 2013
Inf. Process. Lett., 2013
CoRR, 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
Approximating the Nonlinear Newsvendor and SingleItem Stochastic LotSizing Problems When Data Is Given by an Oracle.
Oper. Res., 2012
Oper. Res., 2012
2011
IEEE/ACM Trans. Netw., 2011
Adaptive DataDriven Inventory Control with Censored Demand Based on KaplanMeier Estimator.
Oper. Res., 2011
Ann. Oper. Res., 2011
2010
A faster algorithm for the single source shortest path problem with few distinct positive lengths.
J. Discrete Algorithms, 2010
Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem.
Discret. Math. Algorithms Appl., 2010
Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Equilibrium Computation, 25.04.  30.04.2010, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Oblivious routing of highly variable traffic in service overlays and IP backbones.
IEEE/ACM Trans. Netw., 2009
Math. Program., 2009
A Fully PolynomialTime Approximation Scheme for SingleItem Stochastic Inventory Control with Discrete Demand.
Math. Oper. Res., 2009
Oper. Res., 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
2008
Transp. Sci., 2008
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
SIAM J. Discret. Math., 2008
A simple method for improving the primal simplex method for the multicommodity flow problem.
Networks, 2008
epsilonoptimization schemes and Lbit precision: Alternative perspectives for solving combinatorial optimization problems.
Discret. Optim., 2008
Scheduling malleable tasks with interdependent processing rates: Comments and observations.
Discret. Appl. Math., 2008
Comput. Oper. Res., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Preconfiguring IPoverOptical Networks to Handle Router Failures and Unpredictable Traffic.
IEEE J. Sel. Areas Commun., 2007
Oper. Res., 2007
Oper. Res., 2007
INFORMS J. Comput., 2007
A Very LargeScale Neighborhood Search Algorithm for the Combined ThroughFleetAssignment Model.
INFORMS J. Comput., 2007
2006
Oper. Res. Lett., 2006
J. ACM, 2006
Int. J. Comput. Geom. Appl., 2006
J. Heuristics, 2006
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem.
Discret. Optim., 2006
Discret. Optim., 2006
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
2005
Transp. Sci., 2005
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
Math. Program., 2005
Int. Trans. Oper. Res., 2005
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
SIAM J. Comput., 2004
A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
Networks, 2004
Math. Program., 2004
A MultiExchange Heuristic for the SingleSource Capacitated Facility Location Problem.
Manag. Sci., 2004
A CutBased Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica, 2004
2003
A composite very largescale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett., 2003
Networks, 2003
Manag. Sci., 2003
2002
Minimum Time and Minimum CostPath Problems in Street Networks with Periodic Traffic Lights.
Transp. Sci., 2002
Oper. Res. Lett., 2002
Networks, 2002
Networks, 2002
Discret. Appl. Math., 2002
Proceedings of the Algorithms, 2002
2001
Multiexchange neighborhood structures for the capacitated minimum spanning tree problem.
Math. Program., 2001
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.
Oper. Res., 2001
Oper. Res., 2001
2000
SIAM J. Discret. Math., 2000
Networks, 2000
J. Algorithms, 2000
Comput. Oper. Res., 2000
epsilonoptimization schemes and Lbit precision: alternative perspectives in combinatorial optimization (extended abstract).
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Oper. Res., 1999
1998
Math. Program., 1998
Oper. Res., 1998
1997
Equivalence of the primal and dual simplex algorithms for the maximum flow problem.
Oper. Res. Lett., 1997
Math. Program., 1997
PolynomialTime HighestGain Augmenting Path Algorithms for the Generalized Circulation Problem.
Math. Oper. Res., 1997
Oper. Res., 1997
Oper. Res., 1997
INFORMS J. Comput., 1997
1996
INFORMS J. Comput., 1996
INFORMS J. Comput., 1996
A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
Networks, 1995
1994
SIAM J. Comput., 1994
Math. Program., 1994
J. Algorithms, 1994
1993
Oper. Res. Lett., 1993
Networks, 1993
Math. Program., 1993
Determination of optimal vertices from feasible solutions in unimodular linear programming.
Math. Program., 1993
Oper. Res., 1993
Discret. Appl. Math., 1993
Network flows  theory, algorithms and applications.
Prentice Hall, ISBN: 9780136175490, 1993
1992
Math. Program., 1992
Math. Program., 1992
Oper. Res., 1992
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
A Technique for Speeding up the Solution of the Lagrangian Dual.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
SIAM Rev., 1991
Networks, 1991
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming.
Proceedings of the Second Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1991
1990
J. ACM, April, 1990
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.
Math. Program., 1990
1989
SIAM J. Comput., 1989
Oper. Res., 1989
Discret. Appl. Math., 1989
1988
Math. Program., 1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
1985
A minimum concavecost dynamic network flow problem with an application to lotsizing.
Networks, 1985
Math. Program., 1985
Math. Program., 1985
J. Algorithms, 1985
Oper. Res., 1985
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment.
Oper. Res., 1985
1984
Math. Oper. Res., 1984
1983
Networks, 1983
Networks, 1983
Math. Program., 1983
1982
A polynomial algorithm for integer programming covering problems satisfying the integer roundup property.
Math. Program., 1982
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets.
Oper. Res., 1982
1981
Discret. Appl. Math., 1981
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
1980
Oper. Res., 1980
1978
J. Comb. Theory, Ser. B, 1978