The following pages link to Ravindra K. Ahuja (Q229626):
Displaying 50 items.
- Single-machine scheduling with stepwise tardiness costs and release times (Q656444) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- (Q789311) (redirect page) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning (Q1016076) (← links)
- Minimax linear programming problem (Q1075944) (← links)
- Minimum cost-reliability ratio path problem (Q1102209) (← links)
- A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Optimal expansion of capacitated transshipment networks (Q1266668) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513) (← links)
- A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← 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)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques (Q2770110) (← links)
- A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints (Q2892307) (← links)
- 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)
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701) (← links)
- Algorithms for the minimax transportation problem (Q3026747) (← links)
- A Fast and Simple Algorithm for the Maximum Flow Problem (Q3033534) (← links)
- (Q3056948) (← links)
- Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
- Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications (Q3098331) (← 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)
- A neighborhood search algorithm for the combined through and fleet assignment model with time windows (Q3156830) (← links)
- Some Recent Advances in Network Flows (Q3359973) (← links)
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems (Q3391970) (← links)
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem (Q3392141) (← links)
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time (Q3392169) (← links)
- Faster algorithms for the shortest path problem (Q3474275) (← links)
- Optimal network configuration and capacity expansion of railroads (Q3519362) (← links)
- Inverse Optimization (Q3635034) (← links)
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints (Q3635035) (← links)
- (Q3666614) (← links)
- New lower planes for the network design problem (Q3792507) (← links)
- Improved Time Bounds for the Maximum Flow Problem (Q3830789) (← links)
- (Q3912367) (← links)
- The Scaling Network Simplex Algorithm (Q3990557) (← links)
- (Q4263700) (← links)
