<Para ID="Par1">Recently, a walk-and-round heuristic was proposed by Huang and Mehrotra (Comput Optim Appl, <CitationRef CitationID="CR24">2012</CitationRef>) for generating high quality feasible solutions of mixed integer linear programs. This approach uses geometric random walks on a polyhedral set to sample points in this set. It subsequently rounds...</citationref></para>

The problem of comparing random vectors arises in many applications. We propose three new concepts of stochastically weighted dominance for comparing random vectors X and Y. The main idea is to use a random vector V to scalarize X and Y as VTX and VTY, and subsequently use available concepts...

The primary goal of a residency program is to prepare trainees for unsupervised care. Duty hour restrictions imposed throughout the prior decade require that residents work significantly fewer hours. Moreover, various stakeholders (e.g. the hospital, mentors, other residents, educators, and...

Hospitals must maintain safe nurse-to-patient ratios in patient care units to offer adequate and safe patient care. Since the patient demand is highly variable, during high patient demand periods temporary or overtime nurses are hired to ensure safe nurse-to-patient ratios. These overtime nurses...

Feasibility pump is a general purpose technique for finding feasible solutions of mixed integer programs. In this paper we report our computational experience on using geometric random walks and a random ray approach to provide good points for the feasibility pump. Computational results on <Emphasis...</emphasis>