Now showing items 1-5 of 5

    • Complete matching in a trinomial doubly-convex complete bipartite graph 

      Ankolekar, Suresh; Patel, Nitin R. (2010-03-14)
      This paper discusses minimum matching in a trinomial doubly convex bipartite graph. The graph consists of three categories of arcs forming a doubly convex structure. The matching involves lexicographical minimization in ...
    • Defective coin problem: an algorithmic analysis 

      Ankolekar, Suresh; DasGupta, Arindam; Srinivasan, G. (2010-03-14)
      The defective coin problem involves identification of defective coin, if any, and ascertain the nature of t defect (heavier/lighter) from a set of coins containing at the most one defective coin, using an equal-ar -balance. ...
    • Lower bound on fleet-size in variable-schedule fleet-size problem 

      Ankolekar, Suresh; Patel, Nitin R. (2010-03-14)
      This paper discusses an approach to compute a lower bound on fleet-size in variable-schedule fleet-size problem. The lower bound is computed in two stages. In stage one, a fixed-schedule fleet-size problem is solved for a ...
    • Optimization of vehicle schedules for a road transport corporation 

      Ankolekar, Suresh; Patel, Nitin R.; Saha, Jahar (2010-03-14)
      This paper discusses construction of a model to minimize fleet-size required to operate a time-table subject to a maintenance constraint. The constraint requires that vehicles be provided maintenance at least once every ...
    • Pure relational algebra query language using dbase II 

      Chaudhuri, Pralay Sen; Ankolekar, Suresh (2010-03-14)
      This paper discusses the development of a query language based on relational algebra implemented using dBASE II. It is observed that dBASE II is relationally incomplete in the sense that certain relational algebra operators ...