Showing 11 - 20 of 35
Persistent link: https://www.econbiz.de/10005302005
Persistent link: https://www.econbiz.de/10003520269
This paper first presents a brief reveiw of the multicriteria problems faced by the United States Army, Navy, and Marine Corps in making enlisted personnel assignment decisions. Then for the most complex of these military assignment problems, the Marine Corps problem, a new modeling and solution...
Persistent link: https://www.econbiz.de/10009204368
This paper develops efficient algorithms for obtaining a dual feasible starting basis for the capacitated distribution problem. The motivation for the development of such a technique is threefold. Firstly, although efficient dual methods for solving such problems have been developed, none of...
Persistent link: https://www.econbiz.de/10009214060
This paper considers a distribution model with upper and lower bounds on the number of units shipped from an origin or to a destination. Our problem differs from the classical distribution model in which the node shipping amounts are, by contrast, specified exactly. This generalization of the...
Persistent link: https://www.econbiz.de/10009190259
This paper describes a procedure for determining if constrained network problems (i.e., network problems with additional linear constraints) can be transformed into equivalent pure network problems by a linear transformation involving the node constraints and the extra constraints. These results...
Persistent link: https://www.econbiz.de/10009191894
This paper contains a new and very successful application of mathematical programming in the petroleum industry. Specifically, the paper describes the design and implementation of a model and computer system to address the complex short-term planning and operational issues associated with the...
Persistent link: https://www.econbiz.de/10009197858
Persistent link: https://www.econbiz.de/10005347695
This short note presents a formal description of a fast and robust shortest path algorithm. Modeled on an algorithm of Pape (1974), it requires less memory store than most algorithms and at the same time permits arc lengths to range between -[chi] and +[chi]. It is described in a machine...
Persistent link: https://www.econbiz.de/10005228078
Persistent link: https://www.econbiz.de/10005253889