Douglas R. Shier

Networks, 2022

2019-2020 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2022

Ailsa H. Land, EURO Gold Medallist (1927-2021).

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

2021

Twenty-one years in the life of Networks (2000 to 2020).

[BibT_eX]

[DOI]

Networks, 2021

The power of linear programming: some surprising and unexpected LPs.

[BibT_eX]

[DOI]

4OR, 2021

2019

Preface: Special Issue on Network Optimization in Transportation, Logistics, and Industry (Part 2).

[BibT_eX]

[DOI]

Networks, 2019

Editorial: 2018 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2019

2018

Editorial: 2017 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2018

2017

Editorial: 2016 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2017

2016

Editorial.

[BibT_eX]

[DOI]

Networks, 2016

Editorial: 2015 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2016

2015

Editorial: 2014 Glover-Klingman Prize winners.

[BibT_eX]

[DOI]

Networks, 2015

Editorial: 2013 Glover-Klingman Prize winners.

[BibT_eX]

[DOI]

Networks, 2015

2013

Algebraic methods applied to shortest path and maximum flow problems in stochastic networks.

[BibT_eX]

[DOI]

Katherine C. Hastings

Networks, 2013

Editorial: 2011 Glover-Klingman Prize Winners.

[BibT_eX]

[DOI]

Networks, 2013

A Network Approach to a Geometric Packing Problem.

[BibT_eX]

[DOI]

Bradley J. Paynter

Electron. Notes Discret. Math., 2013

2012

Editorial: 2010 Glover-Klingman prize winners.

[BibT_eX]

[DOI]

Networks, 2012

2011

Editorial: 2009 Glover-Klingman Prize winners.

[BibT_eX]

[DOI]

Networks, 2011

Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems.

[BibT_eX]

[DOI]

Katherine C. Hastings

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Editorial: 2008 Glover-Klingman prize winners.

[BibT_eX]

[DOI]

Networks, 2010

2009

Extended dominance and a stochastic shortest path problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

Editorial: 2007 Glover-Klingman Prize winners.

[BibT_eX]

[DOI]

Networks, 2008

Editorial: 2006 Glover-Klingman Prize winners.

[BibT_eX]

[DOI]

Networks, 2008

2007

On the Distributed Bellman-Ford Algorithm and the Looping Problem.

[BibT_eX]

[DOI]

Terri L. Schlosser

INFORMS J. Comput., 2007

Cut scheduling in the apparel industry.

[BibT_eX]

[DOI]

Dawn M. Rose

Comput. Oper. Res., 2007

2006

Editorial: 2005 Glover-Klingman prize winners.

[BibT_eX]

[DOI]

Networks, 2006

Minimum spanning trees in networks with varying edge weights.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

2005

Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks.

[BibT_eX]

[DOI]

Oper. Res., 2005

2004

2003 Glover-Klingman prize winners.

[BibT_eX]

[DOI]

Networks, 2004

2003

Editorial: Glover-Klingman prize.

[BibT_eX]

[DOI]

Networks, 2003

Networks and Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Minimax Models for Diverse Routing.

[BibT_eX]

[DOI]

James P. Brumbaugh-Smith

INFORMS J. Comput., 2002

1996

Commentary - On Algorithm Analysis.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1996

An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks.

[BibT_eX]

[DOI]

James P. Jarvis

INFORMS J. Comput., 1996

A Paradigm for Listing (s, t)-Cuts in Graphs.

[BibT_eX]

[DOI]

J. Scott Provan

Algorithmica, 1996

1994

Some applications of nonnegative linear systems: Farkas strikes again.

[BibT_eX]

[DOI]

Robin Lougee-Heimer

Warren P. Adams

Oper. Res. Lett., 1994

1992

Generating the States of a Binary Stochastic System.

[BibT_eX]

[DOI]

E. J. Valvo

Robert E. Jamison

Discret. Appl. Math., 1992

1991

A factoring approach for the stochastic shortest path problem.

[BibT_eX]

[DOI]

Kelly J. Hayhurst

Oper. Res. Lett., 1991

Reliability covering problems.

[BibT_eX]

[DOI]

Michael O. Ball

J. Scott Provan

Networks, 1991

Inclusion-exclusion, cancellation, and consecutive sets.

[BibT_eX]

[DOI]

M. H. McIlwain

Australas. J Comb., 1991

1990

A Multistage Linear Array Assignment Problem.

[BibT_eX]

[DOI]

Oper. Res., 1990

Reliability Computations for Planar Networks.

[BibT_eX]

[DOI]

David E. Whited

James P. Jarvis

INFORMS J. Comput., 1990

Algorithms for Approximating the Performance of Multimode Systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '90, 1990

1989

Algebraic Methods for Bounding Network Reliability.

[BibT_eX]

[DOI]

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

A new algorithm for performance analysis of communication systems.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1988

Maximal chordal subgraphs.

[BibT_eX]

[DOI]

Perino M. Dearing

Richard Henry Frymuth Jackson

D. D. Warner

Discret. Appl. Math., 1988

1987

Comparison of mathematical programming software: A case study using discrete L1 approximation codes.

[BibT_eX]

[DOI]

Paul D. Domich

Karla L. Hoffman

Patsy B. Saunders

Comput. Oper. Res., 1987

1986

Iterative algorithms for generating minimal cutsets in directed graphs.

[BibT_eX]

[DOI]

David E. Whited

Networks, 1986

1984

Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights.

[BibT_eX]

[DOI]

R. E. Haymond

James P. Jarvis

ACM Trans. Math. Softw., 1984

Some aspects of perfect elimination orderings in chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1983

Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network.

[BibT_eX]

[DOI]

Perino M. Dearing

Oper. Res., 1983

On powers and centers of chordal graphs.

[BibT_eX]

[DOI]

Renu C. Laskar

Discret. Appl. Math., 1983

1981

A computational study of Floyd's algorithm.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1981

1980

Algorithm 564: A Test Problem Generator for Discrete Linear L1 Approximation Problems.

[BibT_eX]

[DOI]

Karla L. Hoffman

ACM Trans. Math. Softw., 1980

A Test Problem Generator for Discrete Linear L1 Approximation Problems.

[BibT_eX]

[DOI]

Karla L. Hoffman

ACM Trans. Math. Softw., 1980

Arc tolerances in shortest path and network flow problems.

[BibT_eX]

[DOI]

Christoph Witzgall

Networks, 1980

1979

On algorithms for finding the k shortest paths in a network.

[BibT_eX]

[DOI]

Networks, 1979

1976

Iterative methods for determining the k shortest paths in a network.

[BibT_eX]

[DOI]

Networks, 1976

1973

A decomposition algorithm for optimality problems in tree-structured networks.

[BibT_eX]

[DOI]