| Publication | Date of Publication | Type |
|---|
| The power of linear programming: some surprising and unexpected LPs | 2021-07-14 | Paper |
| Broadening the integer programming audience, the LINDO perspective | 2011-05-20 | Paper |
| The global solver in the LINDO API | 2009-09-18 | Paper |
| Order Allocation for Stock Cutting in the Paper Industry | 2009-07-03 | Paper |
| Conditions that cause risk pooling to increase inventory | 2009-04-08 | Paper |
| Scheduling training for a tank battalion: how to measure readiness | 2007-11-30 | Paper |
| Generalized filtering algorithms for infeasibility analysis | 2007-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464665 | 2004-05-27 | Paper |
| Optimal Integer Solutions to Industrial Cutting Stock Problems | 2003-11-06 | Paper |
| HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road | 1999-09-16 | Paper |
| A Tire Production Scheduling System for Bridgestone/Firestone Off-The-Road | 1998-09-20 | Paper |
| Maximum likelihood genetic sequence reconstruction from oligo content | 1994-09-05 | Paper |
| Analysis of the Deterministic (s, S) Inventory Problem | 1993-01-12 | Paper |
| The Deterministic Dynamic Product Cycling Problem | 1985-01-01 | Paper |
| Sensitivity Analysis for Branch and Bound Integer Programming | 1985-01-01 | Paper |
| Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662646 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3964013 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3964308 | 1982-01-01 | Paper |
| Identification of special structure constraints in linear programs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926330 | 1981-01-01 | Paper |
| A More Portable Fortran Random Number Generator | 1979-01-01 | Paper |
| Branching from the largest upper bound. Folklore and facts | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3865835 | 1978-01-01 | Paper |
| Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks | 1978-01-01 | Paper |
| Dynamic Programming Solution of Sequencing Problems with Precedence Constraints | 1978-01-01 | Paper |
| Implicit representation of generalized variable upper bounds in linear programming | 1978-01-01 | Paper |
| Minimizing the Time-in-System Variance for a Finite Jobset | 1975-01-01 | Paper |
| Optimal and System Myopic Policies for Multi-Echelon Production/Inventory Assembly Systems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132006 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4072867 | 1974-01-01 | Paper |
| Joint Pricing and Inventory Decisions for Constant Priced Items | 1973-01-01 | Paper |
| Using decomposition in integer programming | 1973-01-01 | Paper |
| Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case | 1972-01-01 | Paper |
| Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1 | 1970-01-01 | Paper |
| Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case | 1970-01-01 | Paper |
| A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems | 1969-01-01 | Paper |
| Analysis and Optimization of a Queueing Model of a Real-Time Computer Control System | 1969-01-01 | Paper |
| Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline | 1968-01-01 | Paper |
| The Queue M/G/1 with the Shortest Remaining Processing Time Discipline | 1966-01-01 | Paper |
