The following pages link to James B. Orlin (Q229627):
Displaying 24 items.
- 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)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860) (← links)
- On the hardness of finding subsets with equal average (Q2444739) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Fast neighborhood search for the single machine total weighted tardiness problem (Q2583706) (← links)
- Improved algorithms for computing fisher's market clearing prices (Q2875155) (← links)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (Q3114903) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Faster algorithms for the shortest path problem (Q3474275) (← links)
- A Fast, Simpler Algorithm for the Matroid Parity Problem (Q3503851) (← links)
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (Q3544249) (← links)
- On the Sum-of-Squares algorithm for bin packing (Q3546292) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- Cyclic Scheduling via Integer Programs with Circular Ones (Q3898330) (← links)
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542) (← links)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500) (← links)
- Dynamic shortest paths minimizing travel times and costs (Q4419276) (← links)
- A Simple Approximation Algorithm for Computing Arrow-Debreu Prices (Q4904586) (← links)
- Max flows in O(nm) time, or better (Q5495847) (← links)
