| Publication | Date of Publication | Type |
|---|
Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021)
European Journal of Operational Research | 2021-11-05 | Paper |
The power of linear programming: some surprising and unexpected LPs
4OR | 2021-07-14 | Paper |
scientific article; zbMATH DE number 6448265 (Why is no real title available?)
| 2015-06-22 | Paper |
Puzzles, paradoxes, and problem solving. An introduction to mathematical thinking
| 2014-02-05 | Paper |
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
Networks | 2013-08-06 | Paper |
On the distributed Bellman-Ford algorithm and the looping problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
Minimax models for diverse routing
INFORMS Journal on Computing | 2012-05-30 | Paper |
Algebraic methods for stochastic minimum cut and maximum flow problems
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks
Operations Research | 2009-07-18 | Paper |
Extended dominance and a stochastic shortest path problem
Computers \& Operations Research | 2008-11-07 | Paper |
Label-correcting shortest path algorithms revisisted
| 2007-06-28 | Paper |
Cut scheduling in the apparel industry
Computers \& Operations Research | 2007-06-04 | Paper |
An Efficient Enumeration Algorithm for the Two-Sample Randomization Distribution
Operations Research/Computer Science Interfaces Series | 2007-05-21 | Paper |
Minimum spanning trees in networks with varying edge weights
Annals of Operations Research | 2007-02-05 | Paper |
scientific article; zbMATH DE number 5064934 (Why is no real title available?)
| 2006-10-17 | Paper |
scientific article; zbMATH DE number 1933260 (Why is no real title available?)
| 2003-08-07 | Paper |
Cancellation in cyclic consecutive systems
Journal of Computational and Applied Mathematics | 2002-08-22 | Paper |
scientific article; zbMATH DE number 1348644 (Why is no real title available?)
| 1999-10-06 | Paper |
scientific article; zbMATH DE number 1156589 (Why is no real title available?)
| 1998-05-26 | Paper |
An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks
INFORMS Journal on Computing | 1997-11-25 | Paper |
A paradigm for listing \((s,t)\)-cuts in graphs
Algorithmica | 1996-08-13 | Paper |
Some applications of nonnegative linear systems: Farkas strikes again
Operations Research Letters | 1995-01-11 | Paper |
scientific article; zbMATH DE number 176263 (Why is no real title available?)
| 1993-05-18 | Paper |
Reliability Computations for Planar Networks
ORSA Journal on Computing | 1993-01-16 | Paper |
Generating the states of a binary stochastic system
Discrete Applied Mathematics | 1993-01-16 | Paper |
scientific article; zbMATH DE number 91033 (Why is no real title available?)
| 1993-01-16 | Paper |
scientific article; zbMATH DE number 49666 (Why is no real title available?)
| 1992-09-17 | Paper |
A factoring approach for the stochastic shortest path problem
Operations Research Letters | 1992-06-27 | Paper |
Reliability covering problems
Networks | 1992-06-25 | Paper |
Perron eigenvectors and the symmetric transportation polytope
Linear Algebra and its Applications | 1992-06-25 | Paper |
A Multistage Linear Array Assignment Problem
Operations Research | 1990-01-01 | Paper |
Maximal chordal subgraphs
Discrete Applied Mathematics | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4087683 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4097115 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4178324 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4085390 (Why is no real title available?)
| 1988-01-01 | Paper |
Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
Computers \& Operations Research | 1987-01-01 | Paper |
Algebraic Methods Applied to Network Reliability Problems
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Iterative algorithms for generating minimal cutsets in directed graphs
Networks | 1986-01-01 | Paper |
Algorithms for Generating Minimal Cutsets by Inversion
IEEE Transactions on Reliability | 1985-01-01 | Paper |
Some aspects of perfect elimination orderings in chordal graphs
Discrete Applied Mathematics | 1984-01-01 | Paper |
Computational Methods for Minimum Spanning Tree Algorithms
SIAM Journal on Scientific and Statistical Computing | 1984-01-01 | Paper |
Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights
ACM Transactions on Mathematical Software | 1984-01-01 | Paper |
Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
Operations Research | 1983-01-01 | Paper |
On powers and centers of chordal graphs
Discrete Applied Mathematics | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3848952 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3851152 (Why is no real title available?)
| 1983-01-01 | Paper |
Counterexamples in measuring the distance between binary trees
Mathematical Social Sciences | 1983-01-01 | Paper |
Testing for homogeneity of two-dimensional surfaces
Mathematical Modelling | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3800940 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3769655 (Why is no real title available?)
| 1981-01-01 | Paper |
Arc tolerances in shortest path and network flow problems
Networks | 1981-01-01 | Paper |
Properties of Labeling Methods for Determining Shortest Path Trees
Journal of Research of the National Bureau of Standards | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3769657 (Why is no real title available?)
| 1981-01-01 | Paper |
Algorithm 564: A Test Problem Generator for Discrete Linear L 1 Approximation Problem
ACM Transactions on Mathematical Software | 1980-01-01 | Paper |
A Test Problem Generator for Discrete Linear L 1 Approximation Problems
ACM Transactions on Mathematical Software | 1980-01-01 | Paper |
Player aggregation in noncooperative Games
Journal of Research of the National Bureau of Standards | 1980-01-01 | Paper |
On algorithms for finding the k shortest paths in a network
Networks | 1979-01-01 | Paper |
Norm approximation problems and norm statistics
Journal of Research of the National Bureau of Standards | 1978-01-01 | Paper |
Planes, Cubes and Center-Representable Polytopes
The American Mathematical Monthly | 1977-01-01 | Paper |
Iterative methods for determining the k shortest paths in a network
Networks | 1976-01-01 | Paper |
Inverting sparse matrices by tree partitioning
Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences | 1976-01-01 | Paper |
Computational experience with an algorithm for finding the k shortest paths in a network
Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences | 1974-01-01 | Paper |
Maximizing the number of spanning trees in a graph with n nodes and m edges
Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences | 1974-01-01 | Paper |
A decomposition algorithm for optimality problems in tree-structured networks
Discrete Mathematics | 1973-01-01 | Paper |
A Note on an Algebra for the k Best Routes in a Network
IMA Journal of Applied Mathematics | 1973-01-01 | Paper |
