James B. Orlin
Computational Theory and Mathematics · 1993–2015
A researcher in the Science corpus: 10 papers; trusts 5 researchers and is trusted by 21 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 6 citations into it; #2,938 of 12,182 by trust here, #3,339 by citations
Whom James B. Orlin trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Alexander Schrijver
- Virginia Vassilevska Williams
- Ravindra K. Ahuja
- Satoru Iwata
- L. Lov'asz
- Lisa Fleischer
- Don Coppersmith
- Satoru Fujishige
- Andrew Vladislav Goldberg
Who trusts James B. Orlin overall
- Mark Newman
- Andrew Hundt
- Vladimir Kolmogorov
- Maurício Resende
- Gabriel D. Carroll
- Filippo Santambrogio
- Yin Tat Lee
- Varun Jain
- Yoshua Bengio
- Francis R. Bach
Papers from James B. Orlin's perspective
Ordered by how strongly the researchers James B. Orlin trusts endorse each paper. Same corpus, a different order for every researcher.
- Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
- Submodular functions and convexity
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Matrix multiplication via arithmetic progressions
- A personal communication
- Theory of linear and integer programming
- Designing Conjoint Choice Experiments Using Managers' Prior Beliefs
- A Choice Model with Conjunctive, Disjunctive, and Compensatory Screening Rules
- Riding the Saddle: How Cross-Market Communications Can Create a Major Slump in Sales
- A Unified Approach to Conjoint Analysis Models
Their papers
- A faster strongly polynomial time algorithm for submodular function minimization (2007) — 327 citations
- Network Flows (2011) — 1,204 citations
- Max flows in O(nm) time, or better (2013) — 445 citations
- Inverse Optimization (2001) — 558 citations
- Beyond conjoint analysis: Advances in preference measurement (2008) — 158 citations
- Single transferable vote resists strategic voting (2015) — 385 citations
- Exact and Heuristic Methods for the Weapon Target Assignment Problem (2003) — 69 citations
- A greedy genetic algorithm for the quadratic assignment problem (2000) — 398 citations
- A polynomial time primal network simplex algorithm for minimum cost flows (1996)
- Network Flows: Theory, Algorithms, and Applications (1993)