Michael A. Trick

European Journal of Operational Research · 1989–2008

A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Whom Michael A. Trick trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Michel X. Goemans
2. David P. Williamson

Who trusts Michael A. Trick overall

1. David Pisinger
2. Stefan Røpke
3. Gerhard Hiermann
4. Jakob Puchinger
5. Hangyu Zhu
6. Xiaogang Zhu
7. Vincent Conitzer
8. Richard F. Hartl
9. Tobias Achterberg

Papers from Michael A. Trick's perspective

Ordered by how strongly the researchers Michael A. Trick trusts endorse each paper. Same corpus, a different order for every researcher.

1. The NP-Completeness Column: An Ongoing Guide
2. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
3. Scheduling A Major College Basketball Conference
4. TSPLIB - A Traveling Salesman Problem Library
5. Proof verification and hardness of approximation problems
6. Reducibility Among Combinatorial Problems
7. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
8. Fast approximation algorithms for fractional packing and covering problems
9. Combinatorial optimization. Polyhedra and efficiency.
10. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)

Their papers

• Round robin scheduling - a survey (2008) — 373 citations
• Scheduling A Major College Basketball Conference (1998)
• A Linear Relaxation Heuristic for the Generalized Assignment Problem (1992)
• Voting schemes for which it can be difficult to tell who won the election (1989)