Markov and Markov-Regenerative pert Networks. - Vidyadhar G. Kulkarni; Veena G. Adlakha (Oper. Res., 1986)

Two heuristic techniques for service location: An evaluation and comparison. - Veena Adlakha; Tigineh Mersha (Comput. Oper. Res., 1989)

Minimum flows in (s, t) planar networks. - Veena Adlakha; Barbara Gladysz; Jerzy Kamburowski (Networks, 1991)

An empirical evaluation of antithetic variates and quasirandom points for simulating stochastic networks. - Veena G. Adlakha (Simul., 1992)

A simulation technique for estimation in perturbed stochastic activity networks. - Veena G. Adlakha; Hossein Arsham (Simul., 1992)

Managing cost uncertainties in transportation and assignment problems. - Veena Adlakha; Hossein Arsham (Adv. Decis. Sci., 1998)

An alternate linear algorithm for the minimum flow problem. - Veena G. Adlakha (J. Oper. Res. Soc., 1999)

A simple algorithm for the source-induced fixed-charge transportation problem. - Veena Adlakha; K. Kowalski (J. Oper. Res. Soc., 2004)

Minimal Functionalities of Course Management Systems: A Faculty Perspective. - Veena G. Adlakha; A. K. Aggarwal (Int. J. Web Based Learn. Teach. Technol., 2009)

A Hybrid Approach for Selecting a Course Management System: A Case Study. - Anil Aggarwal; Veena Adlakha; Terry Ross (J. Inf. Technol. Educ. Innov. Pract., 2012)

On lower bounds for the fixed charge problem. - Veena Adlakha; Krzysztof Kowalski (Comput. Oper. Res., 2014)

Fractional Polynomial Bounds for the Fixed Charge Problem. - Veena Adlakha; K. Kowalski (J. Optim. Theory Appl., 2015)