2 citations · 3 across the 8 of their papers we have counts for
6 papers · 1 filter
Counterexample to a conjecture on the pairwise independent correlation gap using AI
Arjun Ramachandra, Karthik Natarajan
Aided by the AI tool GPT5.5 Pro, we provide a counterexample to a conjecture made by Ramachandra and Natarajan (2025) [Pairwise independent correlation gap, Operations Research Let…
Distributionally robust optimization through the lens of submodularity
Karthik Natarajan, Divya Padmanabhan, Arjun Ramachandra
Distributionally robust optimization is used to tackle decision making problems under uncertainty where the distribution of the uncertain data is ambiguous. Many ambiguity sets hav…
Pairwise independent correlation gap
Arjun Ramachandra, Karthik Natarajan
In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as…
Extremal Probability Bounds in Combinatorial Optimization
Divya Padmanabhan, Selin Damla Ahipasaoglu, Arjun Ramachandra +1
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objectiv…
Robust Conic Satisficing
Arjun Ramachandra, Napat Rujeerapaiboon, Melvyn Sim
In practical optimization problems, we typically model uncertainty as a random variable though its true probability distribution is unobservable to the decision maker. Historical d…
Tight Probability Bounds with Pairwise Independence
Arjun Ramachandra, Karthik Natarajan
While useful probability bounds for pairwise independent Bernoulli random variables adding up to at least an integer have been proposed in the literature, none of these bou…