Search Results - "Orlin, James B"

A faster strongly polynomial time algorithm for submodular function minimization by Orlin, James B.

“…We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O( n 5 EO  + …”
Get full text

On the power of randomization in network interdiction by Bertsimas, Dimitris, Nasrabadi, Ebrahim, Orlin, James B.

“…In this paper, we introduce the randomized network interdiction problem that allows the interdictor to use randomness to select arcs to be removed. We model…”
Get full text

A Simple Approximation Algorithm for Computing Arrow-Debreu Prices by Ghiyasvand, Mehdi, Orlin, James B.

“…We consider the Arrow-Debreu market with linear utilities in which there is a set G of divisible goods and a set B of buyers. Each buyer starts with an initial…”
Get full text

A survey of very large-scale neighborhood search techniques by Ahuja, Ravindra K., Ergun, Özlem, Orlin, James B., Punnen, Abraham P.

“…Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ…”
Get full text

Robust monotone submodular function maximization by Orlin, James B., Schulz, Andreas S., Udwani, Rajan

“…We consider a robust formulation, introduced by Krause et al. (J Artif Intell Res 42:427–486, 2011 ), of the classical cardinality constrained monotone…”
Get full text

Beyond conjoint analysis: Advances in preference measurement by Netzer, Oded, Toubia, Olivier, Bradlow, Eric T., Dahan, Ely, Evgeniou, Theodoros, Feinberg, Fred M., Feit, Eleanor M., Hui, Sam K., Johnson, Joseph, Liechty, John C., Orlin, James B., Rao, Vithala R.

“…We identify gaps and propose several directions for future research in preference measurement. We structure our argument around a framework that views…”
Get full text

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator by Huh, Woonghee Tim, Levi, Retsef, Rusmevichientong, Paat, Orlin, James B.

“…Using the well-known product-limit form of the Kaplan-Meier estimator from statistics, we propose a new class of nonparametric adaptive data-driven policies…”
Get full text

Solving the Convex Cost Integer Dual Network Flow Problem by Ahuja, Ravindra K, Hochbaum, Dorit S, Orlin, James B

“…In this paper 1 , we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the…”
Get full text

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

“…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

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem by AHUJA, Ravindra K, ORLIN, James B, SHARMA, Dushyant

“…The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the…”
Get full text

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem by Ahuja, Ravindra K, Kumar, Arvind, Jha, Krishna C, Orlin, James B

“…The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of…”
Get full text

A fast maximum flow algorithm by Orlin, James B., Gong, Xiao‐yue

“…In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with…”
Get full text

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

“…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

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle by Halman, Nir, Orlin, James B., Simchi-Levi, David

“…The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review…”
Get full text

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

“…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

On multiroute maximum flows in networks by Aggarwal, Charu C., Orlin, James B.

“…Let G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij on each arc (i, j) ∈ A. An elementary…”
Get full text

A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem by AHUJA, Ravindra K, HOCHBAUM, Dorit S, ORLIN, James B

Get full text

Fast algorithms for convex cost flow problems on circles, lines, and trees by Orlin, James B., Vaidyanathan, Balachandran

“…We develop efficient algorithms to solve convex cost flow problems where the underlying graph is a circle, a line, or a tree. Each node i has an associated…”
Get full text

A characterization of irreducible infeasible subsystems in flow networks by Joormann, Imke, Orlin, James B., Pfetsch, Marc E.

“…Infeasible network flow problems with supplies and demands can be characterized via violated cut‐inequalities of the classical Gale‐Hoffman theorem. Written as…”
Get full text

The Locomotive Routing Problem by Vaidyanathan, Balachandran, Ahuja, Ravindra K, Orlin, James B

“…Given a schedule of trains, the locomotive planning (or scheduling) problem (LPP) is to determine the minimum cost assignment of locomotive types to trains…”
Get full text