Complete numerical solution of the axisymmetrical deep-drawing problem.

Date

1980

Author

Tekkaya, A. Erman

Metadata

Show full item record

Item Usage Stats

85
views

0
downloads

URI

https://hdl.handle.net/11511/7754

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Complete integrability of harmonic maps in two dimensions. Başkal, Z. Sibel; Department of Physics (1983)
A genetic algorithm for maximum-weighted tree matching problem Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-09-01) In hierarchal organizations, for assigning tasks to the divisions of the organization some constraints must be satisfied. This article investigates one such problem in which there are k different tasks to be accomplished and each division's performance on each task may be different and represented by a scalar value. In this article we formally introduce this real life decision problem, named as Maximum-Weighted Tree Matching Problem, and propose a genetic algorithm solution to it, and give some experimental...
An exact algorithm for the minimum squared load assignment problem Karsu, Özlem; Azizoğlu, Meral (Elsevier BV, 2019-06) In this study, we consider an assignment problem with the objective to minimize the sum of squared loads over all agents. We provide mixed integer nonlinear and linear programming formulations of the problem and present a branch and bound algorithm for their solution. The results of our computational experiment have shown the satisfactory behavior of our branch and bound algorithm.
A Branch-and-bound algorithm for airport gate assignment problem Alanlı, Kerem; Azizoğlu, Meral; Department of Industrial Engineering (2019) In this study, we consider an airport gate assignment problem that assigns a number of aircraft to a set of gates so as to minimize total walking distance travelled by all passengers. The aircraft that cannot be assigned to any gate due to overlaps are directed to an apron. The problem is formulated as a mixed-integer nonlinear programming model and then it is linearized. A branch-and-bound algorithm that employs powerful bounding mechanisms is developed. The results of the computational experiment have sho...
A branch-and-bound algorithm for airport gate assignment problem Alanli, Kerem; Karsu, Ozlem; Azizoğlu, Meral (2019-06-23)

Citation Formats

A. E. Tekkaya, “Complete numerical solution of the axisymmetrical deep-drawing problem.,” Middle East Technical University, 1980.