This paper introduces a new multiple pivot shortest path simplex method by choosing a subset of non-basic arcs to simultaneously enter into the basis. It is shown that the proposed shortest path simplex method requires O(n) multiple pivots and its running time is O(nm). Results from a...

This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan...

National Statistical Agencies and Autonomous Institutions are extremely interested in using information from those areas that are actually smaller than the actual areas for which a survey is initially designed. As such, small area estimation and its application are valuable when conducting...