| Publication | Date of Publication | Type |
|---|
A clock-and-offer auction market for grid resources when bidders face stochastic computational needs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Freedom of privacy: anonymous data collection with respondent-defined privacy protection
INFORMS Journal on Computing | 2012-07-28 | Paper |
Optimal testing of digital microfluidic biochips
INFORMS Journal on Computing | 2012-07-28 | Paper |
Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction
Operations Research | 2009-08-13 | Paper |
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
Operations Research | 2009-07-05 | Paper |
Confidentiality via Camouflage: The CVC Approach to Disclosure Limitation When Answering Queries to Databases
Operations Research | 2009-07-03 | Paper |
The \(k\)-centrum shortest path problem
Top | 2007-08-08 | Paper |
Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
Operations Research | 2002-03-18 | Paper |
On crossings, the crossing postman problem, and the rural postman problem
Networks | 2002-01-27 | Paper |
Interval Protection of Confidential Information in a Database
INFORMS Journal on Computing | 1998-01-01 | Paper |
Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
Operations Research | 1990-01-01 | Paper |
On the Vector Assignment p-Median Problem
Transportation Science | 1989-01-01 | Paper |
Error Localization for Erroneous Data: Continuous Data, Linear Constraints
SIAM Journal on Scientific and Statistical Computing | 1988-01-01 | Paper |
Optimal Imputation of Erroneous Data: Categorical Data, General Edits
Operations Research | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3910164 (Why is no real title available?)
| 1985-01-01 | Paper |
Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
The generalized diameter of a graph
Networks | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3708412 (Why is no real title available?)
| 1981-01-01 | Paper |
Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure
Operations Research | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3683356 (Why is no real title available?)
| 1979-01-01 | Paper |
The Bottleneck Traveling Salesman Problem
Journal of the ACM | 1978-01-01 | Paper |
Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
Operations Research | 1977-01-01 | Paper |
Bottleneck linear programming
Mathematical Programming | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3427118 (Why is no real title available?)
| 1973-01-01 | Paper |
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Operations Research | 1973-01-01 | Paper |
scientific article; zbMATH DE number 3410784 (Why is no real title available?)
| 1972-01-01 | Paper |
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
Operations Research | 1971-01-01 | Paper |
Optimal Political Districting by Implicit Enumeration Techniques
Management Science | 1970-01-01 | Paper |
The Set-Partitioning Problem: Set Covering with Equality Constraints
Operations Research | 1969-01-01 | Paper |
