American Psychological Association 6th edition

Manley Perkel, Zevi Miller, Dan Pritikin, & Ivan Hal Sudborough. (2005). The strongly connected reliability of complete digraphs: A branch-and-price algorithm for the capacitated \(p\)-median problem. Networks, 45, 165-168. https://doi.org/10.1002/net.20060

ISO-690 (author-date, English)

MANLEY PERKEL, ZEVI MILLER, DAN PRITIKIN and IVAN HAL SUDBOROUGH, 2005. The strongly connected reliability of complete digraphs: A branch-and-price algorithm for the capacitated \(p\)-median problem. Networks. 8 March 2005. Vol. 45, , p. 165-168. DOI 10.1002/net.20060.

Modern Language Association 9th edition

Manley Perkel, Zevi Miller, Dan Pritikin, and Ivan Hal Sudborough. “The Strongly Connected Reliability of Complete Digraphs: A Branch-and-Price Algorithm for the Capacitated \(p\)-Median Problem”. Networks, vol. 45, Mar. 2005, pp. 165-8, https://doi.org/10.1002/net.20060.

Mohr Siebeck - Recht (Deutsch - Österreich)

Manley Perkel/Zevi Miller/Dan Pritikin/Ivan Hal Sudborough: The strongly connected reliability of complete digraphs: A branch-and-price algorithm for the capacitated \(p\)-median problem, Networks 2005, 165-168.

Emerald - Harvard

Manley Perkel, Zevi Miller, Dan Pritikin and Ivan Hal Sudborough. (2005), “The strongly connected reliability of complete digraphs: A branch-and-price algorithm for the capacitated \(p\)-median problem”, Networks, Vol. 45, pp. 165-168.

Warning: These citations may not always be 100% accurate.