A branch and bound algorithm for the capacitated minimum spanning tree problem. - Kavindra Malik; Gang Yu 001 (Networks, 1993)

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. - Laureano F. Escudero; Monique Guignard 001; Kavindra Malik (Ann. Oper. Res., 1994)

Optimizing the Costs of Hierarchical Quorum Consensus. - Akhil Kumar 001; Kavindra Malik (Acta Informatica, 1996)

Part selection and tool allocation in discrete parts manufacturing. - Eleftherios Iakovou; Christos Koulamas; Kavindra Malik (Ann. Oper. Res., 1998)