Prabha Sharma

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Robust discrete spanning tree problem: local search algorithms Opsearch	2022-10-18	Paper
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights EURO Journal on Computational Optimization	2018-04-12	Paper
An efficient local search for minimizing completion time variance in permutation flow shops Computers & Operations Research	2012-11-15	Paper
Symmetric weight constrained traveling salesman problem: Local search Opsearch	2011-05-13	Paper
An efficient heuristic algorithm for the bottleneck traveling salesman problem Opsearch	2010-03-15	Paper
Benders' partitioning approach for solving the optimal communication spanning tree problem	2009-11-27	Paper
A combinatorial arc tolerance analysis for network flow problems Journal of Applied Mathematics and Decision Sciences	2008-07-01	Paper
Algorithms for the optimum communication spanning tree problem Annals of Operations Research	2006-10-11	Paper
A network simplex algorithm with O(\(n\)) consecutive degenerate pivots Operations Research Letters	2003-04-02	Paper
Permutation polyhedra and minimisation of the variance of completion times on a single machine Journal of Heuristics	2002-12-15	Paper
A new pivot selection rule for the network simplex algorithm Mathematical Programming. Series A. Series B	1998-06-22	Paper

Research outcomes over time

This page was built for person: Prabha Sharma