The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James B. Orlin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James B. Orlin
    A Faster Strongly Polynominal Minimum Cost Flow Algorithm [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:377-387 [Conf]
  2. Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie
    Branch-and-Bound Algorithms for the Test Cover Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:223-233 [Conf]
  3. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    Solving the Convex Cost Integer Dual Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:31-44 [Conf]
  4. Dimitris Bertsimas, James B. Orlin
    A Technique for Speeding up the Solution of the Lagrangian Dual. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:435-452 [Conf]
  5. Agustin Bompadre, James B. Orlin
    Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:437-451 [Conf]
  6. Jianxiu Hao, James B. Orlin
    A Faster Algorithm for Finding the Minimum Cut in a Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:165-174 [Conf]
  7. Murali S. Kodialam, James B. Orlin
    Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:131-135 [Conf]
  8. James B. Orlin
    A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:474-481 [Conf]
  9. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate local search in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:587-596 [Conf]
  10. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the sum-of-squares algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:208-217 [Conf]
  11. James B. Orlin
    The Complexity of Dynamic Languages and Dynamic Optimization Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:218-227 [Conf]
  12. James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
    epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:565-572 [Conf]
  13. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:189-208 [Journal]
  14. Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
    A greedy genetic algorithm for the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2000, v:27, n:10, pp:917-934 [Journal]
  15. Neal E. Young, Robert Endre Tarjan, James B. Orlin
    Faster Parametric Shortest Path and Minimum Balance Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  16. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the Sum-of-Squares Algorithm for Bin Packing [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  17. Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
    A survey of very large-scale neighborhood search techniques. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:75-102 [Journal]
  18. Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp
    Recognizing Hidden Bicircular Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:1, pp:13-53 [Journal]
  19. Özlem Ergun, James B. Orlin, Abran Steele-Feldman
    Creating very large scale neighborhoods out of smaller ones by compounding moves. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2006, v:12, n:1-2, pp:115-140 [Journal]
  20. Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk
    The Tsp and the Sum of its Marginal Values. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:333-344 [Journal]
  21. Ravindra K. Ahuja, James B. Orlin
    Developing Fitter Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:3, pp:251-253 [Journal]
  22. Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
    Faster Algorithms for the Shortest Path Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:213-223 [Journal]
  23. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the Sum-of-Squares algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:1, pp:1-65 [Journal]
  24. Ravindra K. Ahuja, James B. Orlin
    A Faster Algorithm for the Inverse Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:177-193 [Journal]
  25. Jianxiu Hao, James B. Orlin
    A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:424-446 [Journal]
  26. Z. Miller, James B. Orlin
    NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:10-16 [Journal]
  27. James B. Orlin
    Line-digraphs, arborescences, and theorems of tutte and knuth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:2, pp:187-198 [Journal]
  28. Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin
    Diagnosing infeasibilities in network flow problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:263-280 [Journal]
  29. Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
    Finding minimum-cost flows by double scaling. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:243-266 [Journal]
  30. Dimitris Bertsimas, James B. Orlin
    A technique for speeding up the solution of the Lagrangean dual. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:63, n:, pp:23-45 [Journal]
  31. Shinji Mizuno, Romesh Saigal, James B. Orlin
    Determination of optimal vertices from feasible solutions in unimodular linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:23-31 [Journal]
  32. James B. Orlin
    A polynomial time primal network simplex algorithm for minimum cost flows. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:109-129 [Journal]
  33. James B. Orlin, Ravindra K. Ahuja
    New scaling algorithms for the assignment and minimum mean cycle problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:41-56 [Journal]
  34. James B. Orlin, Serge A. Plotkin, Éva Tardos
    Polynomial dual network simplex algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:255-276 [Journal]
  35. James B. Orlin, Dushyant Sharma
    Extended neighborhood: Definition and characterization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:101, n:3, pp:537-559 [Journal]
  36. James B. Orlin, John H. Vande Vate
    Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:47, n:, pp:81-106 [Journal]
  37. Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti
    Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:355-369 [Journal]
  38. Charu C. Aggarwal, James B. Orlin
    On multiroute maximum flows in networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:1, pp:43-52 [Journal]
  39. Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee
    A neighborhood search algorithm for the combined through and fleet assignment model with time windows. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:160-171 [Journal]
  40. Ravindra K. Ahuja, James B. Orlin
    Combinatorial algorithms for inverse network flow problems. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:4, pp:181-187 [Journal]
  41. Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
    Dynamic shortest paths minimizing travel times and costs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:4, pp:197-205 [Journal]
  42. P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
    New polynomial-time cycle-canceling algorithms for minimum-cost flows. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:1, pp:53-63 [Journal]
  43. Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
    A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:185-194 [Journal]
  44. Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam
    A network simplex algorithm with O(n) consecutive degenerate pivots. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:141-148 [Journal]
  45. Özlem Ergun, James B. Orlin
    Fast neighborhood search for the single machine total weighted tardiness problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:41-45 [Journal]
  46. Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan
    Improved Algorithms for Bipartite Network Flow. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:906-933 [Journal]
  47. Ravindra K. Ahuja, James B. Orlin, Robert Endre Tarjan
    Improved Time Bounds for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:5, pp:939-954 [Journal]
  48. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate Local Search in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1201-1214 [Journal]
  49. Lisa Fleischer, James B. Orlin
    Optimal Rounding of Instantaneous Fractional Flows Over Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:145-153 [Journal]
  50. Muralidharan Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
    A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  51. Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
    Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  52. James B. Orlin
    A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:240-251 [Conf]

  53. A Fast, Simpler Algorithm for the Matroid Parity Problem. [Citation Graph (, )][DBLP]


  54. Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. [Citation Graph (, )][DBLP]


  55. Fully polynomial time approximation schemes for stochastic dynamic programs. [Citation Graph (, )][DBLP]


  56. A simple combinatorial algorithm for submodular function minimization. [Citation Graph (, )][DBLP]


  57. Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. [Citation Graph (, )][DBLP]


  58. Integer Programming: Optimization and Evaluation Are Equivalent. [Citation Graph (, )][DBLP]


  59. Scale-invariant clustering with minimum volume ellipsoids. [Citation Graph (, )][DBLP]


  60. Scheduling malleable tasks with interdependent processing rates: Comments and observations. [Citation Graph (, )][DBLP]


  61. The structure of bases in bicircular matroids. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002