Rasmus V. Rasmussen
European Journal of Operational Research · 2008
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Whom Rasmus V. Rasmussen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Rasmus V. Rasmussen overall
Papers from Rasmus V. Rasmussen's perspective
Ordered by how strongly the researchers Rasmus V. Rasmussen trusts endorse each paper. Same corpus, a different order for every researcher.
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Scheduling A Major College Basketball Conference
- TSPLIB - A Traveling Salesman Problem Library
- Proof verification and hardness of approximation problems
- Reducibility Among Combinatorial Problems
- Faster and simpler algorithms for multicommodity flow and other fractional packing problems
- Fast approximation algorithms for fractional packing and covering problems
- Combinatorial optimization. Polyhedra and efficiency.
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
- Integer and Combinatorial Optimization
Their papers
- Round robin scheduling - a survey (2008) — 373 citations