26 citations · 39 across the 5 of their papers we have counts for
5 papers · 1 filter
CAPPA: Continuous-time Accelerated Proximal Point Algorithm for Sparse Recovery
Kunal Garg, Mayank Baranwal
This paper develops a novel Continuous-time Accelerated Proximal Point Algorithm (CAPPA) for -minimization problems with provable fixed-time convergence guarantees. The pro…
Multiway k-Cut in Static and Dynamic Graphs: A Maximum Entropy Principle Approach
Mayank Baranwal, Amber Srivastava, Srinivasa Salapaka
This work presents a maximum entropy principle based algorithm for solving minimum multiway -cut problem defined over static and dynamic {\em digraphs}. A multiway -cut probl…
Clustering with Capacity and Size Constraints: A Deterministic Approach
Mayank Baranwal, Srinivasa M. Salapaka
This paper discusses a deterministic clustering approach to capacitated resource allocation problems. In particular, the Deterministic Annealing (DA) algorithm from the data-compre…
A Deterministic Annealing Approach to the Multiple Traveling Salesmen and Related Problems
Mayank Baranwal, Brian Roehl, Srinivasa M. Salapaka
This paper presents a novel and efficient heuristic framework for approximating the solutions to the multiple traveling salesmen problem (m-TSP) and other variants on the TSP. The…
Vehicle Routing Problem with Time Windows: A Deterministic Annealing approach
Mayank Baranwal, Pratik M. Parekh, Lavanya Marla +2
The Vehicle Routing Problem with Time-Windows (VRPTW) is an important problem in allocating resources on networks in time and space. We present in this paper a Deterministic Anneal…