158 citations · 513 across the 30 of their papers we have counts for
7 papers · 1 filter
The quadratic balanced optimization problem
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan +1
We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard e…
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP0…
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
Daniel Karapetyan, Abraham P. Punnen
We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP). Applications of the…
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms
Daniel Karapetyan
Combinatorial optimization is widely applied in a number of areas nowadays. Unfortunately, many combinatorial optimization problems are NP-hard which usually means that they are un…
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
Mohammad Reihaneh, Daniel Karapetyan
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objec…
Satellite downlink scheduling problem: A case study
Daniel Karapetyan, Snezana Mitrovic-Minic, Krishna T. Malladi +1
The synthetic aperture radar (SAR) technology enables satellites to efficiently acquire high quality images of the Earth surface. This generates significant communication traffic f…