| Publication | Date of Publication | Type |
|---|
Alternating priority versus FCFS scheduling in a two-class queueing system
Operations Research Letters | 2013-03-05 | Paper |
| scientific article; zbMATH DE number 5866282 (Why is no real title available?) | 2011-03-15 | Paper |
| scientific article; zbMATH DE number 5866297 (Why is no real title available?) | 2011-03-15 | Paper |
| Four score years of Saul I. Gass: portrait of an OR professional | 2007-06-28 | Paper |
Leonhard Euler: A brief appreciation
Networks | 2007-05-23 | Paper |
IFORS' Operational Research Hall of Fame
International Transactions in Operational Research | 2005-01-20 | Paper |
An annotated timeline of operations research. An informal history
International Series in Operations Research & Management Science | 2004-11-15 | Paper |
| scientific article; zbMATH DE number 1749229 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 956790 (Why is no real title available?) | 1996-12-11 | Paper |
The controlled rounding problem: Complexity and computational experience
European Journal of Operational Research | 1993-09-28 | Paper |
Large-scale controlled rounding using tabu search with strategic oscillation
Annals of Operations Research | 1993-08-16 | Paper |
Using Simulated Annealing to Solve Controlled Rounding Problems
ORSA Journal on Computing | 1993-04-01 | Paper |
Cell suppression: Disclosure protection for sensitive tabular data
Networks | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 35513 (Why is no real title available?) | 1992-06-28 | Paper |
The controlled rounding problem: Relaxations and complexity issues
OR Spektrum | 1992-06-25 | Paper |
Controlled Rounding of Tabular Data
Operations Research | 1990-01-01 | Paper |
Interactive Reliability Analysis on a Microcomputer
American Journal of Mathematical and Management Sciences | 1988-01-01 | Paper |
Transforming arc routing into node routing problems
Computers & Operations Research | 1987-01-01 | Paper |
The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
American Journal of Mathematical and Management Sciences | 1987-01-01 | Paper |
A new heuristic for determining fleet size and composition
Mathematical Programming Studies | 1986-01-01 | Paper |
Experimentation in optimization
European Journal of Operational Research | 1986-01-01 | Paper |
On lower bounds for a class of quadratic 0,1 programs
Operations Research Letters | 1985-01-01 | Paper |
Nested Optimal Policies for Set Functions with Applications to Scheduling
Mathematics of Operations Research | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3878634 (Why is no real title available?) | 1984-01-01 | Paper |
The fleet size and mix vehicle routing problem
Computers & Operations Research | 1984-01-01 | Paper |
A comparison of techniques for solving the fleet size and mix vehicle routing problem
OR Spektrum | 1984-01-01 | Paper |
A decision-theoretic framework for comparing heuristics
European Journal of Operational Research | 1984-01-01 | Paper |
Analysis Of Rail Classification Policies
INFOR: Information Systems and Operational Research | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3775225 (Why is no real title available?) | 1982-01-01 | Paper |
Analytical Models In Rail Transportation: An Annotated Bibliography
INFOR: Information Systems and Operational Research | 1981-01-01 | Paper |
Multicommodity network flows—A survey
Networks | 1978-01-01 | Paper |
