Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A special decomposition algorithm for block-diagonal linear with a single linking constraint.
Date
1972
Author
Oğuz, Osman
Metadata
Show full item record
Item Usage Stats
9
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/5945
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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 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)
A heuristic for flowshops with total flow time minimization.
Uslu Başaran, Ayşe Gülçin; Kırca, Ömer; Department of Industrial Engineering (1996)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Oğuz, “A special decomposition algorithm for block-diagonal linear with a single linking constraint.,” Middle East Technical University, 1972.