CP12
Networks and Flows

A Truncated Primal-Infeasible Dual-Feasible Network Interior-Point Method

Mauricio G.C. Resende, AT&T Bell Laboratories; Luis F. Portugal and Joaquim Judice,
Universidade de Coimbra, Portugal; and Geraldo Veiga, AT&T Bell Laboratories

A Polynomial-Time Highest-Gain Augmenting Path Algorithm for the Generalized Circulation Problem

Donald Goldfarb and Zhiying Jin, Columbia University

A Study of General Dynamic Network Programs With Arc Time-Delays

Malcolm C. Pullan, St John's College, Cambridge, United Kingdom

Counterexamples in Maximal Dynamic Flows

Eleonor Ciurea, Transilvania University of Brasov, Romania

Coordination Complexity of Convex Nonnegative Structured Optimization

Michael D. Grigoriadis and Leonid G. Khachiyan, Rutgers University

The Sequential Entropy Maximization for Integer Estimation of Origin-Destination Tables

Kiyoshi Yoneda, and Isaku Wada, Toshiba R&D Center, Japan; and Yasuko Nakayama,
Toshiba Corp., Japan

Registration | Hotel Information | Transportation | Speaker Index | Program Overview