activity
20072022
most citedSatellite downlink scheduling problem: A case study

75 citations · 134 across the 18 of their papers we have counts for

collaborators

25 papers

cs.AI2022★ 2 cited

Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites

Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou

Active-imaging agile earth observation satellite (AI-AEOS) is a new generation agile earth observation satellite (AEOS). With renewed capabilities in observation and active im-agin…

cs.CV2022

An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split

Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou

The satellite image data downlink scheduling problem (SIDSP) is well studied in literature for traditional satellites. With recent developments in satellite technology, SIDSP for m…

math.OC2018★ 2 cited

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…

cs.CC2017

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…

cs.DM2017★ 8 cited

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem

Abraham P. Punnen, Matthias Walter, Brad D. Woods

We consider the linearization problem associated with the quadratic traveling salesman problem (QTSP). Necessary and sufficient conditions are given for a cost matrix of QTSP t…

math.OC2017★ 5 cited

Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases

Stefan Lendl, Ante Ćustić, Abraham P. Punnen

We introduce and study the combinatorial optimization problem with interaction costs (COPIC). COPIC is the problem of finding two combinatorial structures, one from each of two giv…