Search
Now showing items 1-5 of 5
A branch‐and‐cut approach for the least cost influence problem on social networks
(Wiley, 2020-07)
This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ...
Least-cost influence maximization on social networks
(Informs, 2020-03)
Viral-marketing strategies are of significant interest in the online economy. Roughly, in these problems, one seeks to identify which individuals to strategically target in a social network so that a given proportion of ...
An effective formulation of the multi-criteria test suite minimization problem
(Elsevier, 2020-10)
Test suite minimization problem has been mainly addressed by employing heuristic techniques or integer linear programming focusing on a specific criterion or bi-criteria. These approaches fall short to compute optimal ...
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
(Elsevier, 2022-09-16)
This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization ...
Summary of an effective formulation of the multi-criteria test suite minimization problem
(IEEE, 2022)
This is an extended abstract of the article: Okan Orsan Ozener and Hasan Sozer, 'An Effective Formulation of the Multi-Criteria Test Suite Minimization Problem', published in the Journal of Systems and Software, Vol. 168, ...
Share this page