Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
We study a well-known linear programming relaxation of the p-median problem. We give a characterization of the directed graphs for which this system of inequalities defines an integral polytope. As a consequence, we obtain that the p-median problem is polynomial in that class of graphs. We also give an algorithm to recognize these graphs. © 2011 Elsevier B.V. All rights reserved.
T. Graham, A. Afzali, et al.
Microlithography 2000
Imran Nasim, Michael E. Henderson
Mathematics
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007