Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

The periodic event scheduling problem (PESP), in which events have to be scheduled repeatedly over a given period, is a complex…

Review

2007

Review

2007

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with…

1999

1999

We present an O(nm)-time network simplex algorithm for finding a tree of shortest paths from a given node to all other nodes in a…

Highly Cited

1997

Highly Cited

1997

Thedynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges…

Highly Cited

1996

Highly Cited

1996

Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open…

1996

1996

This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new…

1992

1992

In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex…

1991

1991

We study the number of pivots required by the primal network simplex algorithm to solve the minimum-cost circulation problem. We…

Highly Cited

1989

Highly Cited

1989

Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that…

Highly Cited

1979

Highly Cited

1979

An example of cycling in the network simplex method is given and some restrictions on its occurrence are proved. An example of…