A special decomposition algorithm for block-diagonal linear with a single linking constraint.

Oğuz, Osman


A Monte Carlo method for dynamic finite size scaling of the ising method.
Kökten, Hatice; Department of Physics (1986)
A decomposition procedure for a large-scale linear program:National coal production and distribution system.
Gürbüz, H. Ibrahim; Department of Industrial Engineering (1983)
A one-pass predictor-corrector algorithm for the inverse Langevin function
BAŞDEMİR, SELÇUK; Dal, Hüsnü (2022-01-01)
© The Author(s) 2022.Inverse Langevin function has an extensive use in statistical mechanics, polymer chemistry, and physics. Main struggle is that the inverse Langevin function cannot be expressed in an exact analytical form. To this end, many approaches to estimate the inverse Langevin function have been proposed. A trade-off can be observed between level of accuracy and mathematical complexity in the existing approximants in the literature. In the present contribution, a simple, yet efficient one-pass pr...
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
Chung, CS; Flynn, J; Kirca, O (Elsevier BV, 2002-10-11)
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling problem, which is known to be NP-hard for m greater than or equal to 2. In this article, we develop a branch and bound algorithm to solve both the weighted and unweighted version of this problem. Our algorithm incorporates a new machine-based lower bound and a dominance test for pruning nodes. Computational experiments suggest that the algorithm can handle test problems with n less than or equal to 15. It al...
A generalized two parameter model for layered elastic foundations
Güven, İbrahim; Mengi, Yalçın; Department of Engineering Sciences (1994)
Citation Formats
O. Oğuz, “A special decomposition algorithm for block-diagonal linear with a single linking constraint.,” Middle East Technical University, 1972.