| Publication | Date of Publication | Type |
|---|
| The future of operations research is bright | 2018-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2988069 | 2017-05-18 | Paper |
| A Bayesian Approach to Simulated Annealing | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4346793 | 1998-01-13 | Paper |
| Additively separable duality theory | 1996-05-02 | Paper |
| Sensitivity analysis of list scheduling heuristics | 1995-10-10 | Paper |
| Average Case Analysis of a Heuristic for the Assignment Problem | 1994-12-11 | Paper |
| Decomposition in general mathematical programming | 1993-12-09 | Paper |
| A class of generalized greedy algorithms for the multi-knapsack problem | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035629 | 1993-05-18 | Paper |
| The stochastic vehicle routing problem revisited | 1993-01-16 | Paper |
| On when to stop sampling for the maximum | 1993-01-16 | Paper |
| Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra | 1992-09-26 | Paper |
| Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs | 1991-01-01 | Paper |
| Probabilistic analysis of algorithms for dual bin packing problems | 1991-01-01 | Paper |
| Single-machine scheduling subject to stochastic breakdowns | 1990-01-01 | Paper |
| A Bayesian learning procedure for the.(s, Q) inventory policy | 1990-01-01 | Paper |
| A note on Benders' decomposition in mixed-integer quadratic programming | 1990-01-01 | Paper |
| Concurrent stochastic methods for global optimization | 1990-01-01 | Paper |
| A probabilistic analysis of the multiknapsack value function | 1990-01-01 | Paper |
| Machine allocation problems in manufacturing networks | 1990-01-01 | Paper |
| OR Forum—Perspectives on Parallel Computing | 1989-01-01 | Paper |
| On the relation between complexity and uncertainty | 1989-01-01 | Paper |
| Single machine flow-time scheduling with a single breakdown | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3202142 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470253 | 1989-01-01 | Paper |
| A random field model for estimating the content of soil layers | 1988-01-01 | Paper |
| A simulation tool for the performance evaluation of parallel branch and bound algorithms | 1988-01-01 | Paper |
| Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799801 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818133 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832320 | 1988-01-01 | Paper |
| Order statistics and the linear assignment problem | 1987-01-01 | Paper |
| Hit-and-run algorithms for the identification of nonredundant linear inequalities | 1987-01-01 | Paper |
| Bayesian stopping rules for multistart global optimization methods | 1987-01-01 | Paper |
| A multinomial Bayesian approach to the estimation of population and vocabulary size | 1987-01-01 | Paper |
| Nonorthogonal Two-Dimensional Cutting Patterns | 1987-01-01 | Paper |
| The Asymptotic Optimality of the LPT Rule | 1987-01-01 | Paper |
| Stochastic global optimization methods part I: Clustering methods | 1987-01-01 | Paper |
| Stochastic global optimization methods part II: Multi level methods | 1987-01-01 | Paper |
| Vehicle Routing with Time Windows | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785925 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790950 | 1987-01-01 | Paper |
| An introduction to the analysis of approximation algorithms | 1986-01-01 | Paper |
| A probabilistic analysis of the next fit decreasing bin packing heuristic | 1986-01-01 | Paper |
| The rate of convergence to optimality of the LPT rule | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698646 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795158 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221735 | 1985-01-01 | Paper |
| STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688111 | 1985-01-01 | Paper |
| Asymptotic Properties of the Quadratic Assignment Problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698654 | 1985-01-01 | Paper |
| Bounds and Heuristics for Capacitated Routing Problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716814 | 1985-01-01 | Paper |
| Hierarchical vehicle routing problems | 1984-01-01 | Paper |
| New directions in scheduling theory | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217918 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217922 | 1984-01-01 | Paper |
| Stochastic Methods for Global Optimization | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824091 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824110 | 1984-01-01 | Paper |
| Scheduling subject to resource constraints: Classification and complexity | 1983-01-01 | Paper |
| Surrogate duality relaxation for job shop scheduling | 1983-01-01 | Paper |
| The asymptotic behaviour of a distributive sorting method | 1983-01-01 | Paper |
| The Optimal Selection of Small Portfolios | 1983-01-01 | Paper |
| A concise survey of efficiently solvable special cases of the permutation flow-shop problem | 1983-01-01 | Paper |
| An appraisal of computational complexity for operations researchers | 1982-01-01 | Paper |
| A stochastic method for global optimization | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940839 | 1982-01-01 | Paper |
| Computer-Aided complexity classification of combinational problems | 1982-01-01 | Paper |
| Two Lines Least Squares | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962767 | 1982-01-01 | Paper |
| The complexity of linear programming | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897872 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899810 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899811 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916361 | 1981-01-01 | Paper |
| A Solvable Machine Maintenance Model with Applications | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929047 | 1981-01-01 | Paper |
| Minimizing Maximum Lateness in a Two-Machine Open Shop | 1981-01-01 | Paper |
| Complexity results for scheduling chains on a single machine | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206954 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858002 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882478 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883480 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883481 | 1980-01-01 | Paper |
| Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms | 1980-01-01 | Paper |
| Deterministic Production Planning: Algorithms and Complexity | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908777 | 1980-01-01 | Paper |
| Computational Complexity of Discrete Optimization Problems | 1979-01-01 | Paper |
| Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey | 1979-01-01 | Paper |
| A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206648 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206662 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208408 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3879251 | 1979-01-01 | Paper |
| A General Bounding Scheme for the Permutation Flow-Shop Problem | 1978-01-01 | Paper |
| Complexity of Scheduling under Precedence Constraints | 1978-01-01 | Paper |
| Technical Note—On the Expected Performance of Branch-and-Bound Algorithms | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170510 | 1978-01-01 | Paper |
| The complexity of the network design problem | 1978-01-01 | Paper |
| Branching from the largest upper bound. Folklore and facts | 1978-01-01 | Paper |
| Job-Shop Scheduling by Implicit Enumeration | 1977-01-01 | Paper |
| Technical Note—On Mitten's Axioms for Branch-and-Bound | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124328 | 1977-01-01 | Paper |
| On general routing problems | 1976-01-01 | Paper |
| Minimizing maximum lateness on one machine: computational experience and some applications | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055377 | 1975-01-01 | Paper |
| Some Simple Applications of the Travelling Salesman Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077716 | 1975-01-01 | Paper |
| Minimizing Total Costs in One-Machine Scheduling | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099408 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4051851 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062226 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068433 | 1973-01-01 | Paper |
