| Publication | Date of Publication | Type |
|---|
| A note on the properties of the optimal solution(s) of the greed and regret problem | 2010-03-01 | Paper |
| Learning from Mistakes: A Note on Just-in-Time Systems | 1996-10-13 | Paper |
| The Complexity of Eliminating Dominated Strategies | 1993-11-28 | Paper |
| Hashing vectors for tabu search | 1993-08-16 | Paper |
| The complexity of lifted inequalities for the knapsack problem | 1993-01-17 | Paper |
| Nash and correlated equilibria: Some complexity considerations | 1992-09-27 | Paper |
| Competitive location in the plane | 1992-01-01 | Paper |
| A linear-time algorithm for solving continuous maximin knapsack problems | 1991-01-01 | Paper |
| On the order of eliminating dominated strategies | 1990-01-01 | Paper |
| Small talk and cooperation: A note on bounded rationality | 1989-01-01 | Paper |
| Easily Computable Facets of the Knapsack Polytope | 1989-01-01 | Paper |
| Is every cycle basis fundamental? | 1989-01-01 | Paper |
| Probabilistic Analysis of the Capacitated Transportation Problem | 1988-01-01 | Paper |
| Comment on 'Some computational results on real 0-1 knapsack problems' | 1987-01-01 | Paper |
| A linear time randomizing algorithm for searching ranked functions | 1987-01-01 | Paper |
| An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem | 1986-01-01 | Paper |
| Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$ | 1986-01-01 | Paper |
| Probabilistic Analysis of Geometric Location Problems | 1985-01-01 | Paper |
| On Shortest Paths in Graphs with Random Weights | 1985-01-01 | Paper |
| An O(n) algorithm for the linear multiple choice knapsack problem and related problems | 1984-01-01 | Paper |
| On the Core and Dual Set of Linear Programming Games | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340498 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827770 | 1984-01-01 | Paper |
| The Maximum Coverage Location Problem | 1983-01-01 | Paper |
| Generalized Network Problems Yielding Totally Balanced Games | 1982-01-01 | Paper |
| Polynomial algorithms for estimating network reliability | 1982-01-01 | Paper |
| Locating Centers on a Tree with Discontinuous Supply and Demand Regions | 1982-01-01 | Paper |
| Totally Balanced Games and Games of Flow | 1982-01-01 | Paper |
| On search over rationals | 1981-01-01 | Paper |
| Measuring the Quality of Approximate Solutions to Zero-One Programming Problems | 1981-01-01 | Paper |
| An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems | 1981-01-01 | Paper |
| The Linear Multiple Choice Knapsack Problem | 1980-01-01 | Paper |
| An Algorithm for Large Zero-One Knapsack Problems | 1980-01-01 | Paper |
| Lifting the facets of zero–one polytopes | 1978-01-01 | Paper |
| Facets of the Knapsack Polytope From Minimal Covers | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3892882 | 1977-01-01 | Paper |
| Durability of Capital Goods: Taxes and Market Structure | 1977-01-01 | Paper |
| Graph substitution and set packing polytopes | 1977-01-01 | Paper |
