Showing 18,641 - 18,650 of 18,828
information they must reveal to identify these swaps. We present an algorithm that finds opportunities to swap loads without … algorithm to an empirical data set from a large transportation company and present results that suggest significant … management problem context to show how an algorithm can be proven incentive compatible as well as demonstrate the potential value …
Persistent link: https://www.econbiz.de/10009218707
A large number of organizations have implemented security or privacy policies through classified documents. However, this does not resolve a unitary information within the organization and does not complete disclosure of confidential data, according to the hierarchical level that a person...
Persistent link: https://www.econbiz.de/10009245593
Persistent link: https://www.econbiz.de/10009324688
Taking as a starting point the theory of matching applied in the case of a problem of college admissions, where one is interested only to strict preference profiles for students and colleges, a part of the literature has been oriented towards profiles of priorities for colleges. In this paper we...
Persistent link: https://www.econbiz.de/10009393785
The comparison of algorithms complexities is very important both in theory and in practice. When we compare algorithms complexities we need to compare complexity functions. Usually we use one-variable complexity functions. Sometimes, we need multivariable complexity func-tions. In a previous...
Persistent link: https://www.econbiz.de/10009416461
difference method. A comparison between the complexity of the parallel algorithm and the serial one is given. …
Persistent link: https://www.econbiz.de/10009416754
algorithm is proposed for identifying the change-points in the series corresponding to the times when there are changes in … parameter estimates. This algorithm for identifying change-points is tested on the Standard and Poor's 500 monthly index data …
Persistent link: https://www.econbiz.de/10009279002
time at Stage 2 is NP – hard and gave a two-approximation algorithm in O(n3) time. In the case that all jobs have arbitrary … processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is … algorithm is nearing 2. …
Persistent link: https://www.econbiz.de/10008738742
The sequence operation in production flows appears in the usual practice for the installations waiting time decreasing when a lot of pieces use the same technology line in the same direction.
Persistent link: https://www.econbiz.de/10008751444
In this paper we use the problem of determining the feasibility of system of difference constraints. A difference constraints is of the form x - y ≤ b, where x and y are numeric variables and b is a constant. Systems of difference constraints occur in many economic applications. For example,...
Persistent link: https://www.econbiz.de/10008751590