Search Results - "Orlin, J. B"

Refine Results
  1. 1

    A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem by Ahuja, R. K, Orlin, J. B, Pallottino, S, Scaparra, M. P, Scutella, M. G

    Published in Management science (01-06-2004)
    “…We present a very large-scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The…”
    Get full text
    Journal Article
  2. 2

    Inverse Optimization by Ahuja, Ravindra K, Orlin, James B

    Published in Operations research (01-09-2001)
    “…In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P , let c be a…”
    Get full text
    Journal Article
  3. 3
  4. 4

    Anemia of uremia is associated with reduced in vitro cytokine secretion: Immunopotentiating activity of red blood cells by Gafter, Uzi, Kalechman, Yona, Orlin, Jerome B., Levi, Joseph, Sredni, Benjamin

    Published in Kidney international (01-01-1994)
    “…Anemia of uremia is associated with reduced in vitro cytokine secretion: Immunopotentiating activity of red blood cells. Many in vitro studies demonstrate…”
    Get full text
    Journal Article Conference Proceeding
  5. 5

    A Faster Strongly Polynomial Minimum Cost Flow Algorithm by Orlin, James B

    Published in Operations research (01-03-1993)
    “…In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling…”
    Get full text
    Journal Article
  6. 6

    Finding minimum-cost flows by double scaling by AHUJA, R. K, GOLDDBERG, A. V, ORLIN, J. B, TARJAN, R. E

    Published in Mathematical programming (01-01-1992)
    “…Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. We combine several of these techniques…”
    Get full text
    Journal Article
  7. 7
  8. 8
  9. 9

    Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment by Chakravarty, A. K, Orlin, J. B, Rothblum, U. G

    Published in Operations research (01-07-1985)
    “…We consider several subclasses of the problem of grouping n items (indexed 1, 2, ..., n ) into m subsets so as to minimize the function g ( S 1 , ..., S m )…”
    Get full text
    Journal Article
  10. 10

    A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints by Ahuja, Ravindra K, Orlin, James B

    Published in Operations research (01-09-2001)
    “…We consider the problem of minimizing j N C j (x j ), subject to the following chain constraints x 1 x 2 x 3 ... x n , where C j (x j ) is a convex function of…”
    Get full text
    Journal Article
  11. 11

    Use of plasmapheresis and partial plasma exchange in the management of patients with cryoglobulinemia by Berkman, E M, Orlin, J B

    Published in Transfusion (Philadelphia, Pa.) (01-03-1980)
    “…The management of patients with cryoglobulins often meets with limited success. Reported here is the use of plasmapheresis and/or partial plasma exchange in…”
    Get more information
    Journal Article
  12. 12

    Partial Plasma Exchange Using Albumin Replacement: Removal and Recovery of Normal Plasma Constituents by Orlin, J.B., Berkman, E.M.

    Published in Blood (01-12-1980)
    “…Using albumin and crystalloid as the only replacement fluids, the effect of partial plasma exchange on the removal and recovery of normal plasma constituents…”
    Get full text
    Journal Article
  13. 13

    Solving the linear matroid parity problem as a sequence of matroid intersection problems by ORLIN, J. B, VANDE VATE, J. H

    Published in Mathematical programming (01-05-1990)
    “…We present an O(r super(4)n) algorithm for the linear matroid parity problem. Our solution technique is to introduce a modest generalization, the non-simple…”
    Get full text
    Journal Article
  14. 14

    Optimized Crossover for the Independent Set Problem by Aggarwal, Charu C, Orlin, James B, Tai, Ray P

    Published in Operations research (01-03-1997)
    “…We propose a knowledge-based crossover mechanism for genetic algorithms that exploits the structure of the solution rather than its coding. More generally, we…”
    Get full text
    Journal Article
  15. 15
  16. 16

    Computing optimal scalings by parametric network algorithms by ORLIN, J. B, ROTHBLUM, U. G

    Published in Mathematical programming (01-05-1985)
    “…A symmetric scaling of a square matrix A not equal to 0 is a matrix of the form XAX super(-1) where X is a nonnegative, nonsingular, diagonal matrix having the…”
    Get full text
    Journal Article
  17. 17

    Solving Inverse Spanning Tree Problems Through Network Flow Techniques by Sokkalingam, P. T, Ahuja, Ravindra K, Orlin, James B

    Published in Operations research (01-03-1999)
    “…Given a solution x * and an a priori estimated cost vector c , the inverse optimization problem is to identify another cost vector d so that x * is optimal…”
    Get full text
    Journal Article
  18. 18

    A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment by Chakravarty, A. K., Orlin, J. B., Rothblum, U. G.

    Published in Operations research (01-09-1982)
    “…We consider a problem of optimal grouping and provide conditions under which an optimal partition of an ordered set S={r1,⋯,rn} consists of subsets of…”
    Get full text
    Journal Article
  19. 19

    Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights by Ahuja, Ravindra K, Orlin, James B, Pallottino, Stefano, Grazia Scutella, Maria

    Published in Transportation science (01-08-2002)
    “…This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path…”
    Get full text
    Journal Article
  20. 20

    Single transferable vote resists strategic voting by Bartholdi, John J., Orlin, James B.

    Published in Social choice and welfare (01-10-1991)
    “…We give evidence that Single Tranferable Vote (STV) is computationally resistant to manipulation : It is NP-complete to determine whether there exists a…”
    Get full text
    Journal Article