The following pages link to James B. Orlin (Q229627):
Displaying 50 items.
- A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
- (Q646720) (redirect page) (← links)
- Complexity results for equistable graphs and related classes (Q646721) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- Scale-invariant clustering with minimum volume ellipsoids (Q941528) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- A finitely converging cutting plane technique (Q1060961) (← links)
- (Q1108191) (redirect page) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Parametric shortest path algorithms with an application to cyclic staffing (Q1149254) (← links)
- Single transferable vote resists strategic voting (Q1176435) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- Line-digraphs, arborescences and theorems of Tutte and Knuth (Q1226497) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- Randomized algorithms for finding the shortest negative cost cycle in networks (Q1693163) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- On the hardness of finding subsets with equal average (Q2444739) (← links)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- Fast neighborhood search for the single machine total weighted tardiness problem (Q2583706) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques (Q2770110) (← links)
- A Scaling Algorithm for Multicommodity Flow Problems (Q2781151) (← links)
- On multiroute maximum flows in networks (Q2782731) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Improved algorithms for computing fisher's market clearing prices (Q2875155) (← links)
- Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator (Q2879489) (← links)
