The following pages link to James B. Orlin (Q229627):
Displaying 50 items.
- A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model (Q2892354) (← links)
- Very large-scale neighborhood search for the quadratic assignment problem (Q2892376) (← links)
- Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle (Q2917636) (← links)
- A Fast and Simple Algorithm for the Maximum Flow Problem (Q3033534) (← links)
- Dynamic matchings and quasidynamic fractional matchings. I (Q3040950) (← links)
- Dynamic matchings and quasidynamic fractional matchings. II (Q3040951) (← links)
- (Q3056948) (← links)
- Incremental Network Optimization: Theory and Algorithms (Q3100369) (← links)
- Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859) (← links)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (Q3114903) (← links)
- Algorithms for the Simple Equal Flow Problem (Q3116705) (← links)
- (Q3138947) (← links)
- Finding minimum cost to time ratio cycles with small integral transit times (Q3141113) (← links)
- A neighborhood search algorithm for the combined through and fleet assignment model with time windows (Q3156830) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- On the sum-of-squares algorithm for bin packing (Q3191987) (← links)
- <i>ε</i> -optimization schemes and L-bit precision (extended abstract) (Q3192026) (← links)
- (Q3338297) (← links)
- Some Recent Advances in Network Flows (Q3359973) (← links)
- Lexicographically Minimum and Maximum Load Linear Programming Problems (Q3392067) (← links)
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem (Q3392141) (← 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)
- PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM (Q3575375) (← links)
- (Q3579452) (← links)
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems (Q3596368) (← links)
- Inverse Optimization (Q3635034) (← links)
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints (Q3635035) (← links)
- Maximum-throughput dynamic network flows (Q3664790) (← links)
- Minimum Convex Cost Dynamic Network Flows (Q3685538) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- On the complexity of four polyhedral set containment problems (Q3703587) (← links)
- Technical Note—Some Very Easy Knapsack/Partition Problems (Q3703590) (← links)
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing (Q3703618) (← links)
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment (Q3716830) (← links)
- On the simplex algorithm for networks and generalized networks (Q3722234) (← links)
- Improved Time Bounds for the Maximum Flow Problem (Q3830789) (← 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)
- Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets (Q3947440) (← links)
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment (Q3953532) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- The Scaling Network Simplex Algorithm (Q3990557) (← links)
- (Q4134007) (← links)
- (Q4152571) (← links)
- (Q4263700) (← links)
- (Q4311913) (← links)
