Andrew V. Goldberg spends much of his time researching Mathematical optimization, Combinatorics, Maximum flow problem, Shortest path problem and Algorithm. His work on Approximation algorithm as part of general Mathematical optimization research is frequently linked to L-reduction, thereby connecting diverse disciplines of science. His study on Dense graph, Binary logarithm, Graph theory and Maximal independent set is often connected to Arc length as part of broader study in Combinatorics.

Andrew V. Goldberg interconnects Clique-sum, Push–relabel maximum flow algorithm, Dinic's algorithm and Vertex in the investigation of issues within Dense graph. Andrew V. Goldberg combines subjects such as Minimum-cost flow problem and Flow with his study of Maximum flow problem. Particularly relevant to K shortest path routing is his body of work in Shortest path problem.