2 citations · 2 across the 2 of their papers we have counts for
4 papers
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem
Abraham P. Punnen, Pooja Pandey
The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrix Q and a linear cost vector c. Differe…
The generalized vertex cover problem and some variations
Pooja Pandey, Abraham P. Punnen
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equival…
A note on linear fractional set packing problem
Pooja Pandey
In this note we point out various errors in the paper by Rashmi Gupta and R. R. Saxena, Set packing problem with linear fractional objective function, International Journal of Math…
On a linearization technique for solving quadratic set covering problem and variations
Pooja Pandey, Abraham P. Punnen
In this paper we identify some inaccuracies in the paper by R.R. Saxena and S.R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (…