The following pages link to Prabha Sharma (Q535614):
Displayed 11 items.
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- A combinatorial arc tolerance analysis for network flow problems (Q930771) (← links)
- A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- Permutation polyhedra and minimisation of the variance of completion times on a single machine (Q1850996) (← links)
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
- Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Algorithms for the optimum communication spanning tree problem (Q2507388) (← links)
- (Q3646780) (← links)