Rafail N. Gasimov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rafail N. Gasimov has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
A. M. Rubinov
SITMS, University of Ballarat Victoria
1 shared publication- Aydin Sipahioglu
Eskisehir Osmangazi University
1 shared publication - Gürkan Öztürk
Eskişehir Teknik Üniversitesi
1 shared publication - O. Ustun1 shared publication
- Tuğba Saraç
Eskişehir Osmangazi Üniversitesi
1 shared publication
Latest Publications
- 16 May 2007
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (1) , 64-79
A multi-objective programming approach to 1.5-dimensional assortment problem
- 16 May 2007
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (1) , 64-79
A multi-objective programming approach to 1.5-dimensional assortment problem
- Open Access
- 1 January 2007
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 3 (2) , 173-191
Solving the quadratic assignment problem using F-MSG algorithm
Quadratic assignment problems are one of the famous strongly NP-hard combinatorial optimization problems. Because of the wide area of applications and the difficulties existing in finding optimal solutions, these problems are one of the most common objects for application of optimization methods. This paper examines the use of a generalized version of the modified subgradient algorithm for solving quadratic assignment problems. Promising computational results are reported for benchmark problem instances taken from the quadratic assignment problem library - QAPLIB.
- 1 January 2007
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 3 (2) , 173-191
Open AccessSolving the quadratic assignment problem using F-MSG algorithm
Quadratic assignment problems are one of the famous strongly NP-hard combinatorial optimization problems. Because of the wide area of applications and the difficulties existing in finding optimal solutions, these problems are one of the most common objects for application of optimization methods. This paper examines the use of a generalized version of the modified subgradient algorithm for solving quadratic assignment problems. Promising computational results are reported for benchmark problem instances taken from the quadratic assignment problem library - QAPLIB.
- 16 August 2006
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 21 (4) , 527-540
Separation via polyhedral conic functions
We consider the problem of discriminating between two finite point sets A and B in the n-dimensional space by using a special type of polyhedral function. An effective finite algorithm for finding a separating function based on iterative solutions of linear programming subproblems is suggested. At each iteration a function whose graph is a polyhedral cone with vertex at a certain point is constructed and the resulting separating function is defined as a point-wise minimum of these functions. It has been shown that arbitrary two finite point disjoint sets can be separated by using this algorithm. An illustrative example is given and an application on classification problems with some real-world data sets has been implemented.
- 16 August 2006
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 21 (4) , 527-540
Separation via polyhedral conic functions
We consider the problem of discriminating between two finite point sets A and B in the n-dimensional space by using a special type of polyhedral function. An effective finite algorithm for finding a separating function based on iterative solutions of linear programming subproblems is suggested. At each iteration a function whose graph is a polyhedral cone with vertex at a certain point is constructed and the resulting separating function is defined as a point-wise minimum of these functions. It has been shown that arbitrary two finite point disjoint sets can be separated by using this algorithm. An illustrative example is given and an application on classification problems with some real-world data sets has been implemented.
- 1 February 2004
- Published by Springer Nature in Journal of Global Optimization
- Vol. 28 (2) , 153-173
On augmented Lagrangians for Optimization Problems with a Single Constraint
- 1 February 2004
- Published by Springer Nature in Journal of Global Optimization
- Vol. 28 (2) , 153-173
On augmented Lagrangians for Optimization Problems with a Single Constraint