Now showing items 1-4 of 4

    • A framework for fair decision-making over time with time-invariant utilities 

      Lodi, Andrea; Sankaranarayanan, Sriram; Wang, Guanyi (Elsevier, 2023-12-02)
      Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-making problem. This paper examines repeated ...
    • A heuristic for the multisource weber problem with service level constraints 

      Venkateshan, Prahalad; Mathur, Kamlesh (Transportation Science, 2015)
      In this paper we develop a column-generation-based heuristic procedure to solve a generalized version of the multisource Weber problem where in addition to the transportation cost we also consider staffing level costs that ...
    • Near optimal design of wavelength routed optical networks 

      Venkateshan, Prahalad; Agarwal, Yogesh Kumar (Elsevier, 2016)
      The problem of designing a wavelength routed optical transport network without wavelength conversion at intermediate nodes is considered. A class of valid inequalities for wavelength routing and assignment is reported and ...
    • Survivable network design with shared-protection routing 

      Agarwal, Y. K.; Venkateshan, Prahalad (Elsevier, 2014)
      In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing ...