A benders decomposition algorithm for quadratic network design problem

Gündoğdu, Emine
Gürel, Sinan


A dynamic programming algorithm for tree-like weighted set packing problem
Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-10-15)
In hierarchical organizations, hierarchical structures naturally correspond to nested sets. That is, we have a collection of sets such that for any two sets, either one of them is a subset of the other, or they are disjoint. In other words, a nested set system forms a hierarchy in the form of a tree structure. The task assignment problem on such hierarchical organizations is a real life problem. In this paper, we introduce the tree-like weighted set packing problem, which is a weighted set packing problem r...
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...
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)
A Non-iterative Domain Decomposition Method for Finite Element Analysis of 3D Electromagnetic Scattering Problems
Ozgun, Ozlem; Kuzuoğlu, Mustafa (2008-07-11)
In this paper, we generalize this algorithm to 3D scattering problems, and we demonstrate that the algorithm is actually non-iterative in problems involving smooth convex geometries (such as sphere, cube, missile, cone, plate, etc.) and some special geometries (such as inlet). The most distinguished feature of the algorithm is the utilization of the locally-conformal perfectly matched layer (PML) method along the boundaries of the subdomains. In this algorithm, the original computational domain is partition...
Citation Formats
E. Gündoğdu and S. Gürel, “A benders decomposition algorithm for quadratic network design problem,” presented at the EURO 2018, 29th European Conference on Operational Research, 2011, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/77714.