4 citations · 14 across the 11 of their papers we have counts for
3 papers · 1 filter
Submodular Optimization Problems and Greedy Strategies: A Survey
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki +1
The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the o…
A General Framework for Bounding Approximate Dynamic Programming Schemes
Yajing Liu, Edwin Chong, Ali Pezeshki +1
For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterize…
Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees
Shankarachary Ragi, Edwin K. P. Chong, Hans D. Mittelmann
We develop polynomial-time heuristic methods to solve unimodular quadratic programs (UQPs) approximately, which are known to be NP-hard. In the UQP framework, we maximize a quadrat…