Abraham P. Punnen
Discrete Optimization · 2006–2007
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 22 researchers here, as inferred from the citation graph.
Whom Abraham P. Punnen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Abraham P. Punnen overall
- Andrea Lodi
- A. J. Lambert
- Changwu Huang
- J. Schuijbroek
- Clark W. Barrett
- Kai Wang
- Pietro Belotti
- Yaoxin Wu
- Steven S. Skiena
- Giulia Zarpellon
Papers from Abraham P. Punnen's perspective
Ordered by how strongly the researchers Abraham P. Punnen trusts endorse each paper. Same corpus, a different order for every researcher.
- A dynamic programming approach to sequencing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Digraphs - theory, algorithms and applications
- The Traveling Salesman Problem: A Case Study in Local Optimization
- The complexity of theorem-proving procedures
- The NP-Completeness Column: An Ongoing Guide
- The Design and Analysis of Computer Algorithms
- Matrix multiplication via arithmetic progressions
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
- Introduction to graph theory
Their papers
- The traveling salesman problem (2006) — 1,662 citations
- The traveling salesman problem and its variations (2007) — 1,344 citations