Search Results - subject:"ALGORITHM"

Inventory control and regenerative processes: computations

Bazsa-Oldenkamp, E.M.; Frenk, Frenk, J.B.G.; den Iseger, P. - Faculteit der Economische Wetenschappen, Erasmus … - 1999

algorithm (Iseger; A new method for inverting Laplace transforms; 1998) which yields highly accurate computational results of …

Persistent link: https://www.econbiz.de/10010731881

Discrete-Time Discrete-State Latent Markov Models with Time-Constant and Time-Varying Covariates

Vermunt, Jeroen K.; Langeheine, Rolf; Bockenholt, Ulf - In: Journal of Educational and Behavioral Statistics 24 (1999) 2, pp. 179-207

Discrete-time discrete-state Markov chain models can be used to describe individual change in categorical variables. But when the observed states are subject to measurement error, the observed transitions between two points in time will be partially spurious. Latent Markov models make it...

Persistent link: https://www.econbiz.de/10010775978

Optimal path in weak and strong disorder

Schwartz, Nehemia; Porto, Markus; Havlin, Shlomo; … - In: Physica A: Statistical Mechanics and its Applications 266 (1999) 1, pp. 317-321

the Dijkstra algorithm. We study the geometrical and energetic scaling properties of the optimal path under two different …

Persistent link: https://www.econbiz.de/10010873400

Effect of shape anisotropy on transport in a two-dimensional computational model: numerical simulations showing experimental features observed in biomembranes

Pradhan, Gauri R; Pandit, Sagar A; Gangal, Anil D; … - In: Physica A: Statistical Mechanics and its Applications 270 (1999) 1, pp. 288-294

, interacting via the Lennard–Jones potential. We propose a reliable and efficient numerical algorithm to obtain void statistics …

Persistent link: https://www.econbiz.de/10010874522

The Elimination algorithm for the problem of optimal stopping

Sonin, Isaac - In: Computational Statistics 49 (1999) 1, pp. 111-123

We present a new algorithm for solving the optimal stopping problem. The algorithm is based on the idea of elimination …

Persistent link: https://www.econbiz.de/10010847556

A two-cut approach in the analytic center cutting plane method

Goffin, Jean-Louis; Vial, Jean-Philippe - In: Computational Statistics 49 (1999) 1, pp. 149-169

We analyze the two cut generation scheme in the analytic center cutting plane method. We propose an optimal updating direction when the two cuts are central. The direction is optimal in the sense that it maximizes the product of the new slacks within the trust region defined by Dikin's...

Persistent link: https://www.econbiz.de/10010847565

Location of a moving service facility

Puerto, Justo; Rodríguez-Chía, Antonio M. - In: Computational Statistics 49 (1999) 3, pp. 373-393

-known Weiszfeld algorithm for the Weber problem. In order to do that, we consider the Weber problem with trajectories (functions of … considered. An extension of Weiszfeld's algorithm is proposed to solve this kind of problem and it is shown that under some … because the natural pointwise extension of Weiszfeld's algorithm does not have to converge to an optimal solution of the …

Persistent link: https://www.econbiz.de/10010847703

Risk measurement with maximum loss

Studer, Gerold - In: Computational Statistics 50 (1999) 1, pp. 121-134

described; the algorithm is based on the Levenberg-Marquardt theorem, which reduces the high dimensional optimization problem to … can be handled with efficient solution procedures. A description of the overall algorithm rounds off the discussion of …

Persistent link: https://www.econbiz.de/10010847869

Order picking in an automatic warehouse: Solving online asymmetric TSPs

Ascheuer, Norbert; Grötschel, Martin; Abdel-Hamid, … - In: Computational Statistics 49 (1999) 3, pp. 501-515

We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decisions have to be made before all jobs are known....

Persistent link: https://www.econbiz.de/10010848003

On polynomial solvability of two multiprocessor scheduling problems

Girlich, Eberhard; Tarnowski, Alexander G. - In: Mathematical Methods of Operations Research 50 (1999) 1, pp. 27-51

We discuss a new approach for solving multiprocessor scheduling problems by using and improving results for guillotine pallet loading problem. We introduce a new class of schedules by analogy with the guillotine restriction for cutting stock problem and show that many well-known algorithms from...

Persistent link: https://www.econbiz.de/10010949981