-
I .I
-..
,:,,--"-i,-,.,,,-.,,,,
.-.1I.1- ..
-..-..
.1I.
-...II.,-I- :-..
-- "- .-I-.--.-.--,-,
I-1..I
-.I.-", .-I
,-..I-1
I
-:---:",I--..-:-..
-1,II
.:-,....1.,;- - -,-: ;-11-1
.
II-,--I.-.-.II-I
I -- 1 :-.
1-..
-::.,.1.
I. .......I.IIb...
. ,-..-I--.
I.I..
o,
;7,-.i,ZII-.-..-.
,,.-..I,-III.
,-II1.--.%II
,:-1
`: I -,
I- ,,II,---,.,,,,I:,.--.I-.-,
I,.--,,I.,-,,.,.,,
-.-.
,-.-. i.,:-. -,:-I-I
,- ,I .-, :---,-.-.-,.-,
I-,,.-.
,II-I-,.,,I-.-I-I,-.-I-::..-,,
,-i-.-.--.,
,-i7'.:-I-..,
,
--. -1
t, ,::-., ,I..:''.----,
,--,
I,..
---.I-.-.o-:,.--- .I-11II,-,: .-:;--. .,-..-7,
:-,
,-,':. ,.-----. .---.
- .!.,:,
-,.-t---- ,,,--o,- -. .;.. -;-,, --.- ..
,,,.., ,.
-.:
":
.. 1- ,,,-;-,1,. ,:-:ZI2
.-,
,.I_:.-,-I,
,-1,,-,
I1.
..I--.I--,-I-Z.---I.I7..:
..:-1 -`
,,--I:.
.,-I.--.:--..--,,
:,,-.
I----.,----'I---11
,-.:.i
.I..-.-,
:I.....-..-;,II
.--.I,
,.,-I-I.-.%...
I,,
,.",
.,
.i . ,-.sw-II- --.
..-..i-.-.---..;,!
".
.-,
--,--,--.,b...-:-,-. : .
-,,---rr
, -. --.--..
,.
,, ::,
;-:',
.
,-. ; -..,-.. - ,.:.'.'
. ..
.1
, ,,-,,-.,..-.j-,I.:.,,
-"--,I--,-.:I,. 7i-, -,i, ,,--"--. ..
- ,---.--. -.
, ..,
,,-.- ,,..!-,--,.I...,
,
--.
q,--:,%-,I.
.I-I..
II,_.-!,...I-I,.-,,
r, -:.1-,---.:,I
;,,.,-,I", .,-,:.:-.:.-..----7k-,,,
..
-!
,
"---1,
,---2
.,.,,--..
.II-....-.,II::
.-.-.----,;..
,---., ,.-,--- ..I-,,
,, ,.--,-,-,-I-:.II.-;-,..!.,-.
-----.
-.
,-., , - , -,,,..,-i-I.-.,iI-!,.,,
... I.---,I,, .i--.7
,,-,;
..
-.-,1,.- -1.1.I
.
. .-.-.-,
.--.
"
-.
,.,,--..
,,.- -,,--,
:,.-",.,,--Z,,,, ,.,
.--I.,-- -,.,-,,
,.,..,.,-,I,
, :..-; ,,:,,
v,,--,-,`
.-.,..,:
--..
-I-I11...".,(--,-:-;, ..
-,
,--.---...,, '. .
:...:.,-,.--.-I1,
.--.
,,
,--,
:-,,-I-I'. ,- ;,-I-.e-,i-.Ir::I,,-..,,,"
,..
,-,-,-.t--.,,.ItI,.T,-,-.-,..
.1
-,I.r.,.,-..I..I,,,--Z-I,.-i-.I--Z.,-:---..,-,
-,,-;:..,-.
,:I,,,I,.I,.I-,,.I--I
-:,.4, --:,`.,
I.-I
-; ,,, -.,:,----..,:1,,,.::-.
.. ;I :-,
II , . ,,Z
...
III.-1.II.
.IOI
I,Z
.,,
.:.--- -: .,:-!-.
,:--..I:b.,
..- ,:L,
- 1.!-, -_I-T
..,-,,------_
,:,;
-I
..1. ..-I-.,",-,-.
,---,,,-:-,,----1--,:
i.--'- ,O.,
,---.-,,7
I.",.-.-..
.1.,.-- L--:-,:-1 .,-:,-...,
.
...-:,
-: ,-.I-7..I,
i
-,., .- ,
- ,4:. ",
..
-;
'. .,,,b.
- .,,,---! ,,!,
;::,,-,-.:
-,7- -`
, ,, - ,-',,,,,
.,-;.,I ,,mI------,-..-..II-I,,
..
,.-.,-:
,
---.,,-,,-Jiv,
11,.-.
, -.
,,
.,
, , --I
1,
,-7-q-r
,.,,.I,.,,.
:.---,`.--:
,--.-;--,.-.--,-.--..,:.,11- I.-..
,"",,--1...,,.I-.-I-..'.
-,
-I-,,--. :,-,::,--I.I,--,.,,,I%..-..
%.:--:I.I
....
-:,%,-.II:,;-,---:.-,
:-,II
.Ii,,, !,----,
.,,,..,,--.E--I::...
.
-,-I
-:,,,---:
-I
,:.,1.,-:-.-..
,-,- .-.,,,-,,,-!
: I .:2-;I,--:
-,,"
-,::,;',-.
-.,-I..II -,"-.I--,
.,-----,-,
-,,,- ,",,,,.v--,-;.,---,,..- ,,-,m,1.---,,-,-,-.,,-.-,
-.-.,J..--I-,
,-.-,-,:,..-l,------P,--,---,
;
..
---I.:,.
...
,-f,.-.--:,!.--...--,;,
.-1
I-I.,
I .-..
-,-I7iI,..,
.:,;,
--II.,,,-',:
.-,,-.,-..-.::..,-.--.% -.---II
-2 ,.Z-....,.-.
:-..7r1 ,
.:,,-, , .,-,--.,..1...-..l,:--:F,,-. o
7--7-,,.-:--I;,,.-,.
,.-,--1
,-,,"--I-iI,-,I.
.f-,,---,-.
.III,1--:
-.
.,%:-,-,.--,----.,,,.p,,
I,.--I---I:I,,:,I-I.
.I-IbI.". -"--.-;
-,,-..
I.,,
I.,I.-,-:,.-.
I-,,..-,
-...
I.
7-.
,.,
,,:.-II1.,I.,7,
. .,I.- ---- ---,,,,-I ..,,.--,, - ,,,, "--.%
.,.-,:.
,, -,-..-...-..,
, -,.I4-I ,,-:,
-.--,,I,,-11,I.
...
,:..,.1, -,,--,..rI,,
, , ,.--,,;-,`.I,,,.-,.,.
:-!:,:-.---,
,-.--.I,- .I-,.-,
-.
:, .-.-,i.I.--I:7-...::11
,,I ,,-i-----:-,
,-.iI..---,,..
., 1W
-,'-..,-,-,;
-. :-.,,::
,.---.,-,,II.--:
--.
:--..--.d.
.-- -I,I,-,--,
;,...,,;-,r::
..--..,;,-.:1
.-,.
,I
--..- I, ":
, ,
,- -,--;.:I.
-; -, ,;,II-I
-:-I...
-!------;1I_---.
,,i-,,
,.;.!,.
,
,--.,
.-I--.--!,I----.
I",
-.
I,
....
-,,,,
.
,
.,,1
,
-II-I:-.
,,:
,,-,:
,
,.,;,-,:.,
-1--.-,,.,.1.--.,
-,
.,,,".-..,
,
..-.
,".
-,;,-.,-,
P--I.,
-1,1.-:'.:;,-I,I.l.:
,-:1.::
- 1.--.
I I-,
:.-. -..
,,,i
1,,,,,!,,,I----b
,7,
, ,:: - ---.
-..,,.--;
1:,----- "---.I,-.-,r.,1,--,--.-:,,-.i-,I:",:I-I:-:
-..-,,-c
,.
1), ,.,,dI:.,
, ",
::...I,I,,.
,
-.
1..--1.I,-.I
1.
---.
,:1
,...-.
-,
,,-..;,.
.I.,.,-"
,,-:,
-...,-,,, -I, ...-;.I-::,,.,-.-.,I
...--,---.
i -,.
4 .--: ,- ,"
",,
--I-.,.r,,
-,-,,-;.-,, -.
""-,-,,-,:-- , :,,,-, :,.::1:
z.
.%.I--- ,,. I,1:,,-.:-:
,"
,.I...
..-.
4 I.
, II,::
,.1,
. rI ..-:.--,,.,
"-..
,; ,,-"---_,
.,:,.
,..I,"
, ,,
.,.I-...
,,:-,,
-;.-,;,:-.,.,. ,.,.-,,--,-,4.
,- ."-..--- .1,
,-III.-,-,
,.,-,,. ;II:,-I ,-.-I,.,-1.I.-%,-,,.,.----'-,,II
.,:%.:,,.-...
.,-,,:-I.-.,11;.
:,
.-.,--,.....I-I-N,l---;1.
., ..-. I-,-I-,--.t
,,II-..
I..II,:..
,:.:,,,
,
"
... ,,
.,, . . - ,,,,
, -; ,..",x.,:,
-!: ,
Z,.-.--.
-, . .. I-,,,-,,
,;j,:,-. I-1 -!,
--,-.i,
--.,
--::--.-.
, I,,I-I,,,.I.----,-.",,-,1...-,..--.,---,
.-.,:-,-,,:,
,.T.,
----.,:
I.-,..,:I-.,
I
I,-1..:.;
;.--.1
.,
-,-.,
,-,
.
,..
.4,-.
.
.-...
-,
I,Z".
,
-,
.:
,:,
".
:,!,.
.,..,--,
.,,---1-:,
-.:,-,.,,I
:, ---!
.-,.
,,
....
,.I .-,
- ,,-, :7-.--,-,; .-.
,-: ".,,--,-,--,--,.,,..,. -, -,. ..
I11
..
..
,
.,
-I
.
.4
,
IIr;,
.,
,
,
-,
,:
,
,
.
.
.
I
.I.
-,
I.I
-z
,.,
-:
,
'.
,
-_
,:
.
--,
-:
.
..
...
,
,
,
.
z
.
.
,
F
.
,
,.
- -.
I,
,.
,--,,
":
I--,
-,i.-,,,I.,..I
"
..
II-..-I-...,,:.
1...
-. ,j. ,.-.-.1
-...
-I.
-..-.
,--Alk
..
I- I
,II
II.-
--
,-,.-,
--,. ,-,I--:.
- ---I.
-
-- -.,,.
,- -,
.- ..
. - .,
;,,
---;,:`71
1 .,1j,":
-,,,.-,.-.l
II,,
I,
-1-OFF&,..I0%
-Am;-.I..1,
-.
11.-
!-Ill- -.---..--,
,
,. ,:,_.L--",
-,I
T.:
II,
I- "b.I
t--T.
I,z-I.
.j--I..--.-,1,
-..-,-,I: "`,. :,,--,,---,.,IF
--I---.-.,:I-&..
II,,1:.:,
:_,, -7..-.I-:.4,
.7..,,.I.
-;
mII-IL.-1,,:-:-L,,
.,- -"
,;-1---.I,
-I,,:
-..
-,I,
I-I.,...m.:.--,,-I
..,
.".
:--,o-,,: 11,.-,.--.
t,...-.".,-.II-.. -;,,.
I..7,-I
-,
--:.1;..I-1..r.1eI.
.II.,
-1II.-I..,--.I-.-
,..:1,
---
.all-
,.,-
-.:,t--,-
I11.
,:-.
-Aft..,
km; .---
.,;,,
II
. ----
-: .7
,
lrmw
..,-- EL
,-,-.
,,-.-!,
.-- ,, :..,.,-.
..-
,-:I,: . 1,
"
,
,-
::,,,,,.
-:.I-.
4I-II::,i.-."- ,,
- I,,I
.-IZ
,.::
--.
..I
-,:.;:I:,
,,
-,':----,
..[I -1I..,--:-I
.I.
-I;
-- ,;.
-,-..
,,.1.4.::-.,,.-I---1
--:,---,,Z1.-....I--=i
.-j
..,; --- ..,,, I-1..
,.,,;, ,,, .-,1,..I.
;,,,-,-.I
..
-,r-;
,,, -.
-..
,:,,,.-,
, ;,r --,"I.-,...--.I.- .. ",:; :-.-.i:.I----,
.tl-1::-:-,
...
: -.- ,-I-..I--.1,
:,.,-.I
.,,,..,. ;,,,--,-.-.-1
,,-,,.,.
.-I-; ,--,..
---.:-...--,
.-. i,.-,
..
I-,-;1.--,rt
! :.."
.--.
-- ,-,
,;,,.-.Z
,o.:,,.,
---.:, -.,
,-,
.,-.
-; ,: ',
-,,-I:
,,,,.
,II,.: ,,-1I-II..,.,,.
.,,-%.--,IrI
I....,I..:
,,.
,. ,I
.,
:
..-1:-I
I,
.1,,:
I-,j,,-,,.:---,:.2"--.,.-----,:.,.
.I,.--1
11,.:-..,.,-1.
,--,I....
-,
;
,:,.;-I11--,I,-..-.
,:...
; ;E--....:
,,
....
-,--1,
I,,,I.,1-,-,.. .,
,,L
,:
,-,%---:.I,-.,.
- ;:,.....:.,.--.-.-..,
:, .,
.'.---.,.-.,.
-,:1.I-.-,:-:
L-I
--d,--:
-1
..,;-,.....-,:
.,-.-,,,",----,....tI,:::.,,-".---,::I--I-.,,-.
,---..-I.I..;.1.I.-I-..i-,:
-,-T,-,:1:-..,:,-,--..I-:-!
:1,- --.I ,,---,-,.I-_,.-. -,: ,:,.-,--,,..e.-:
.I-II,...
%
- -I:--I-.-.
I-::.,-:.
--..
I.,--;,."I
---...-I
.,
.,I
.--,"--.Z..
j,.II"-I
_ - I..
I,.-...-I.,,:
:,-.
--..I--,.
.,
I.,
.,,-.I,,--,I.-,
,
.,.-.iI.Im..I:
1,
-- ,-,,.-I-..I.--II-.,- -I-:.-I-,:..---I7-,-..,--..-...11---,,---..
-ll-,
I.-.
,..I..-III..-.I.- -I
-I1...-.,.I--.1.
:.---,--I
,-.I.,:.
-: -II--,
,-.I,,,,I.II..
-II.:. .-.-I.I,--,..,.-Ij.-.
II,.
,.-.-,
.i.I,,I,.
-: ::., -.
;...,-II
....II;..;;-,.
.,.I-.
. I II:.I.i..
-1,..-I
,--I,,.wIi-.,..I,..
..; .,,-:,
,-,.--.---I-.
:-:--,,--I.II.-.1.
,.I-..,.
,
.--.
,-..;vr-.
:,
.!-.:-,,i.
..,:-,.
,,,, .1 .. :,,-,:-I...-.,-,-.,,-.
.,,.-.,-.--I.-.-Ir
:;II,,
-%,:
,---1.
-,."-., ..I---.,,:.,-:-,
.,---7,::-II.I,.I-1
:-- -7,
-,.---..,--.-,-.---.I,..I,.--II
,I--II-.I.,,;"," ..-. rxt.-.,.
..-,:-,;:
--,::
L,-,
..,
-1
,:
"I-,I.
.I.,III.:-:..
,
I.,.-:R'
I-I:,-.:-.-z,:,
-----i,,.%.-.-.,.-,I
,,.I.I-:
.I,
...
.xI,-::..-I-I..
-...
,-1,:,
I - I --:II,,-.,....
.
, -1.
,- -,.,-_:
j---..I,%
I.1.
..
,..-1q-..1...._II..:I,.,,.:,
,,,,
I:,:,,,.--:--,,J.1
2.
...
,.
-.-.-,,I11
,.,;,..
I-,.-I
,;
:.!-,
,-:
,
,1
,-,]
:I-.,
iI
;-,,III,-,1:,:,-....:-.---.I--..I,
.
,:,,-:.lv
-I.:-...
,7,-'I ,:I-I.--..
.,:II1.
I1. .1.
,.--,,1.
".I:,-.-cIII.:7.
.,
,----:.-I----.,-,:
-..
,-,
--;
..`:,
.,
11 .,
.--.
,-I--:.I:. :. -,
-,, -:.I.:
.. :.- -, 4 -I..--.,.-,1,.I
i--.,
7:-.-:..,-,
.:
:I,
-,--,-....,..,I..I-.
i,-..--:
,.Ii--;,-t
....
- "--.-:
.,-I-,.I
-,.",,,...,,m
I. ,
_I,..,I-IIj.
,-I---,I-.. ::
..,,-r;I:,,.- ,.,,-I,,--,..-. ,,.-,...
, ,,.
,.--:
,..
, -I.,-I:.--,:I-.----II-..,-.IIq..-.I-..-----.
..
LIj ,2,,- -I-.-...---..-:,-.
,,,-.,,..--;
-,-.,,.:.I.,I.-,
-,,,',.,I-III.-.,-1.-,...
I,-:!-',
, :,,,,I-----..
.I,-,,.- ....
-t.-.-,,
-I.--,,--1
.
.II-.-.;..I,-''
,,,I--,.
-.
1--.
'.,. -:.11,,-.II.-.Iw
I..
o--I
-"
.1,i. . ..%.,.-:,I
-l -..L1.1,-., 1.,-:::-:
,",:-.,
,:,
,-...Ii;,....,---I-I.1I .-,:7,.1-..
li-II-..,..".-.I--.,;--q:
,,. M,--,--I--7
i11
,. ,:L:,,,-,,
.III"
-I.I-I---,
;-,-...
I1
..
-: -I,.
.-,:,I.;I--!-,-IIIII-I-.I--I
-,
-,
-,,I:I.1
,.,---,
"
r.,,,-,
-,,II..,,------I.LII---.-,,i.I:.
.,
:,,,-,--.-,,I-,
.,.--.I.
I--,-I.-7:I
,.
I-I
....:: L-..
, ,..., ,
,-.
I,.:....
,, -.-:::: iI.I
,,,.I-.
----Il
----.-I
.,,I....1
.
:,-...
,.I
--..-.
,I--,-, ,.,I.-i,..-."
,-,--- ,-,-,
I,.,
, :
,-.,, ,',,.:I,.
-I..I,..-I..-.,:u II-II,,i.:.,
7.-, : ,"..,
:,-,
-- --7,..-.,I.,
. I.,,-.,- I ,p
,I,,.,
.sI;,
,,--,
,,:,I.-I.-L--,%,..,i-::
..I-I.
-,-,-,
,. ::., `I I:
-,;,.-.-.I,II.I:.::,1.,,,,-I
--- .14
,::,".,:::
--.I-.11I,-T-.--.1I..
: .,III-.II-..-I,
. .--c
,:
- ,-,-..,-,,."
--- ,,--,-:,
- I-, , --. ..- ,--,-t.
:,I..-I.
-. ,I:,,,,,I
,, --,I.-,,,,I-!II.:,-;,;,I-II-, -I-.-p-.,,,:-%,,,
,,I"--..--,-:,
-,,,.:,
,"
I.I-..--:--.1----,-:-,-,i--,I,,,-.:,I -,--,,I..-I.-I.:.-.,ZI-II----...:,...-,!-;,
,
,,-.
--..-...-1-I-1I.IItII,-...,"
3-`-,,
,; --F,.
.,F -- ,,:----,,,
I.-,I-I--le,,,...:..,I-."-.I.
--,:I.,
...
I.II-..
....
-.
.I.II-..
--.,,...-I
I.,.-.,
-,
Z--,
.LI.7-....--I-II-,-,I..III-,,!:,
,,
I.:-I:II--::
.-.
I1,-I
;L.I--.
-b.I..
1,,,,.
,--,:..
, ,...-I,
.--I.I,
-.
,-:-. .,
,
,:
,.- IIIL..,.
,-:
.. -. .,1- --. ,.-,-I.I.I.
,:-1. ,,.I.
1;",
-; -;,,-I,-IIII.:,.I-.
,.-i:,:,-.:I, ,.,..I,-jl
...---,,IIII
,,...
-- ,:..-,,
I-I.11-.-.---,
,..--. ....-- -- ---. - -- ---,- ...-..-- -- -. 1.. ---.. -:
---...-,I-..I.-.--,
,..--,,
:,..
-.
,.,F
I-,-,-.I--.IIII
I,-"w,,I-I
,--:,..-,,.,I-,I.,I.
I:,II
,-..,--,,-,
:.I---I
-.I-:,.-..-,
,.- ll - :.,--.
I-, .-,z.7.I:-!,,-:-,.-I.I-,
,.,-I.-.-----II,
- I-.I.
,-,
II.-IJ.:,:
.,-i:.II1.II.
i
::,:,j : ,,.,I-,,--.-..
I-.
-,.I-..,-- 11-,",
-I ,.,I-,.-,.,-...-;-I-.1:.-::
,,:.-.
.II.;..
"---i.
,-1,,:.- .
:i
.. ,I.I-,,
.:,,:, ...
,-6.--I,,,-..
-,,I.-,.,:
d,,
I.I.t,--,-..
; iI.
i....--,..
.,.
.:-;.-I,.,:..-..,,
!i----..
,
--- I.,",
-:2-,.
-s,
-:,: ,--.,:I'. ;:-,-: ,.
-.
-.- ,,,,
r,..-I --,
IT'1,
:1 ",
,;-:i.,.:.-,;,,I,-.I.I:.
:iII--,.I. :.-,.I-1
: ,,
--.
--,
.
,-.IIILI-I.I--,
.-:.--,I
-j,.
-,.
.r.,..
.-,I.1
I;
, --,.:....-III---,--,-,..-I..
1,I.--1
, .,-.:
,"',-,,,-,; -,
, -.,--III-.,IiI.,-.:
-:,.. , .,.:,,
-.-,.II..:..,-,
:,-...,.,.:, -,.-..,.iIm::
Z ..
,.,,-g
II--.-..
..I
.II1 ,-,..%-.
,,.,;,
--...,-.--:
, I.
II-.
-.1:I,-,11I...-i;-,'I-I,,,.I--.!-.1
I-,
,,,I.-,IZ.-,,"--7:, :_ 1,,"... i..
7, ,-I
-I.I:
..,,-.
..,%,-,
:
,Z,
-.
-,,.--.I:-I.,,4.
.I.,
:--,
- :,,,i,.-,---,
...I.-,-.I!:I.-.:-,,-.
,,:-:
-,
.`, ,,,,
,:--I,:..,::-I
I-..-t:I
-.
,,-I.,I,-.,
,.-II,
.I--,-;. :.- I-I--,..:.I--.---Ii:_
I: ",,..1.:
I.I-11.
,--,
.
:.III.I'`
,
,.-,I-.,--.-.I
-.-,-,,II:4
-.-.21.I.-.I.--.
,LI
--. ,-,,-.,-,-------:' ,7,-.
:12:.
I::,--_,_
,.:--t.I,,
--I,,--I
I_,.II--..I
-7,: _!
- -11 ---. ,.-,,,
,,-,,:-,i._.,-1`I-I.I
I
::, -,,----i-.,,
,oII
,II
.i .,.I-1.--iII--.,----,,-.-,,,-,
t ;-, ----.
--...LI-..-.
,,---.. I..,...-"--.,
I-...
:,-,.
-I I.-I.
I I-,I
:,--I-I,--.I
-,,:I-, ,-1,:,,- ..
,,1,...I..--,--.
,-!,,II-...q-1
:..,,.,
--..
r,-.I,-L
,---1..-,:-:.I-I-::
,-"
-,,-:-,...:
I-I.I..-...
,...I.;--1.-.
I.I.,.,I1,'I,;
.
.-,-.-,,I
_,,,..-.II.I
I.-I...,
,,-I
-,
-,..-.-..I-,,.I----11
.I.,III,-!-(
,,I,"r
.,-.I:-,IIIi,I
I.--.--,,I- .-1,:,,I
I,I
.-I
,I:
_-,
:,
..-,:.I,,.-I,,-..
-.- I,..
I.--I.7, -,,,.,
,: ,:I-.II--I-... IZ-II-I.7,,
i,,.
I-I.L.IIIII;I
.1,I-......I-1:I
1.
.,
III:.
:...-..;-I
,II21.I
:;I
-:-.4.
,,:'L,--,
.j-...i..,.-I.-I...I-.i
,
,;:,
I...II--.1,.II:,I
-,:.-I
.,I.-..-:.1.-J.
.:,,-...I-,.-1I.
I.,--:
I
I- -...I..-I
-.
,-.- I-,
.i ."-,
-: ---i.-.I.I-....I..-.I-1,...IiIIII-..:.I.I1II,,.-.
.. :-:... ,.
I -,..--.,.,I..
: --:
,1,-:
;, I-,:;
,-,: ,,-. .:: I -.-.-I-1.-:.T,-,,
; .,--1I:,-,-t,,.--,
,-,..-...:--,
II
.-4.,I-.,.I
,:I.-p.Ip...-.
,.I..ilI--...
1.-III.,I-.,.,.Iq..I.-,-I
I.....-,.
.I.-...,....-i
,,
I.r,I.
I-.I-II
II-I.:.
---",,
,Ii-...I,-:.,%-,.: :,,,..,-1-.I.L
...I.:..I,.II
.,..
IIII
..
II.-I,7
..-..-.,.,;I-.I--.I.I.II..:.I.--.
-:-:,..II-I-III,,,-,,,
-.:,-I:-:-I,--..-,.,.t,.
.,.1--1I.-.7:
..-.
,A,I,-,..,I-,
-.-,
,.I.I.I--..III--.I-II-.
,,
..
,z%-II.1,I--III.,.,,
1II.-I-II-.I..
1.I1,I:-,
..
..II-,
II--...,.-..I
1
-I.II
-I I.-,.I-I
.I--I
,,--, : ,..I-I
,-I.III.II.I-I.....I---.I-I-.,...
i-.,,I.
I-.I...
.
-,-:I-.,
::t:
,..III.----,-.,II-III..I-I-1..,I.-.I,
,
: -.--
11.-I--- il..0-,
I,
I-.
,: ,qI-.
,, ,.. I.:.,-.I..-.---..
-.-.
,--,.I,
'
,
--.,.
I-.---:-;.
...-:,
.''.
-,
..
.
,..
.,!.-,---I,-,-:---,,-,
.;,.:...,
-.,t.,--I-,Z.:-:-.-I---.
,:
,-, :,
,
-.
,
.---,:.T--II..,-.,-.
1.
-,
.-,-,
,
-.
:---.IF
-,-1
9.,.,.-,In
:
,
;
:
,
.
,
.
-.
.1I.
-I1,
.
--,-,- ,-:''.,
.
,-11
1".
-.:..,;-:-.
---.
,
-,.I,
pape-1
I-.
,
,,-,:,
:
Z,
II.i
........
I. ur or'' ki-r1,I,
,,,
I.
,-;,
Deterministic Network Optimization
A Bibllography
by
Bruce L. Golden
and
Thomas L. Magnanti
OR 054-76
June
976
Supported in part by U. S. Oepartment of Transportation (Contract
(TARP).
DOT-TSC-1058), Transportation Advanced Research Program
U
-2-
Oeterministic Network Optilizatlont A Bibliography
Introouct ion
In recent years, Network Optimization has grown to be a
popular and fruitful
area of operations research.
T. C. Hu
considers this area a new branch of combinatorial mathematics and
applied graph theory GEN18I.
The remarkable emergence of this
subject
is
brought
to
light by eKamining the one-page
bibliography in
ai
S.TlC Usesg by O. Ore (1963)
where the
author states,
"The
number of books on graph theory s very
small."
In this report, we present a categorized bibliography on
Deterministic Network Optimization which Includes a number of
books and nearly 7uj entries.
As the reader might note, most of
our citations have appeared since Ore's book was published.
We do not intend to
be
encyclopedic
in
this
compllation; rather,
we have included references which are, for
the most part,
accessib le and substant ia.
We
emphas ize
algorithms
for network optimization and underlying theory.
Mathematica
GEN24]
and Kivestu and Simpson [GENi91
provide
comprehensive bibliographies which emphasize applications.
There are several noteworthy general reference books
which should be mentioned.
Ford and Fulkersons monograph GEN81
Is the original reference on the theory of flows n networks.
In
addition to containing results on static maximal flow and minimal
cost flow problems, this source ntroduces network analysis as a
fresh viewpoint for studying purely combinatoral problems.
More
recently,
Frank
and
Frisch [GENO]
have written a very
comprehensive treatment of the theory of networks, entailing both
deterministic and
probabilistic
networks.
Garfinkel
and
Nemhauser
[GEN131
cover
integer
programming,
theory and
applications.
The relaticnship between nteger programming
and
graphs
Is
emphasized throughout the book.
Christofides'
GEN41
new book on graph theory, written by an operations researcher,
stresses algorithms for classical operations research network
problems.
It Includes
a chapter on matching theory and an
in-depth
discussion
of the Chinese postman Prob lem.
The
excellent survey of deterministic networks by Bradley (GEN2]
is
also recommended highly.
Network models are important not only because of their
direct applicabilty.
In many cases,
network
optimization
problems form subproblems for more cosplex and general real-world
situations.
Successful
applications of network models Include
transport of goods, assignment problems, analysis and synthesis
of
transportation
and
communication networks,
routing of
vehicles, traffic e quilibrium,
equipment replacement,
project
planning,
production and inventory
cont ro l,
optimal capaci ty
scheduling, and a host of others (see Fulkerson GEN12l).
We have divided our bib Iography
on deterministic
network optimization Into several categories n order to make It
more readable and valuable to network researceers.
These
-3-
Deterministic Network Optimization
Intro duct ion
A Bibliography
categories arel
NETWORK
ANALYSIS
NET WORK
SYNTHESIS
UNIFYING
TOPICS
A.
B.
C.
0.
E.
F.
G.
General References
Shortest Path Problems and
Network Reliability
Single and Multi-Commodity
Traffic Equilibrium
The Chinese Postman Problem
Probl
Travel ing Sa lesman
(Vehicle Routing)
H.
I.
J.
Minimal Spanning Trees and Variants
Location of Facilities on a Network
Design of an Optimal Network
K.
L.
H.
Implementation Issues
Complexity Theory
Hatrolds and Graph Theory
Variants
Flows
and Matching
Extensl ons
ems
and
It
should be noted that these categories are not
mutually exclusive.
On the other hand, we do feel they represent
most research areas In Deterministic Network Optimization.
In compiling a bibllography of this nature, we have of
course, benefited from many previous compilations.
The books
mentioned above have served as general sources.
In addition,
papers by Assad [MULT1],
Francis and Goldstein tLOCZ41]
Glover
and Kingnan [IMP191, Pierce SP361, and Wong IDES591 have been
useful sources for special topics.
The
authors
welcome
suggestions for improving this bibliography and hope that It will
serve as a useful reference n this rmportant research field.
Finally,
we would
like to thank Ross Shachter who
designed a computerized system for composing and updating this
bibliograph y.
-4-
Deterministic Network Optmizationt A Bibliography
General References
An.all
aoM a.glorlal
New York (1964).
GENI.
E. BECKENEACH (ed.),
John Wiley and Sons,
GEN2.
G. BRADLEY, "Survey of Deterministic
Iransactia1z,2 Z(3)
222-234 (1975).
GEN3.
R. BUSACKER and T. SAATY,
nite fCQJaa
McGran- Hill, New York (1965).
GEN4.
N.
CHRISTOFIOES,
G
Ag.g.aCh Academic Press,
GEN5.
G.
DANTZIG,
LI ear
Princeton
Unl versity
(1963).
Matheai5,
Press,
Ntaorhs
.ag
[J:b
beayI
AD
New York (975).
Egca. ralg
Alif
Networks,"
A.L!aorjthi9CL
EXtgaslnons
New Jersey
and
Pr nceton,
ELHAGHRABY,
Soaa blaGk
]
dG.J
, nD
1AQAlCQ Springer-Verlag, New York (1970).
GEN6.
S.
GEN7.
S. EVEN,
(1973).
GEN8.
in tacrj,
L. FORD and D. FULKERSON, E[IgJv
University Press, Princetont N.J.
GEN9.
H. FRANK and I. FRISCH,
Ala.irma , (July 1970).
"Network Analysis,"
H. FRANK and I.
CQniBnlcati.j
Transmssion and
Addison-Wesley, Reading, Mass.
GENIO.
AloCthmic Coajinai.C2ci,
FRISCH,
ICansortAaUGn NJIw DLt
b
OQau.LIln
Macml Illan,
New York
Princeton
ScLenttjC
(1971).
GENIIo
I. FRISCH
(ed.),
Proceedings
Large-Scale Networks," fJg
br,
GEN12.
D. FULKERSON,
"Flow
Networks
Operations Research, AULrjan fat
(2), 115-138 (1966).
GEN13.
R. GARFINKEL and Go NEHAUSER,
Wlley, New York (1972).
GEN14.
F. HARARY,
( 1969).
GEN15.
8. HARRIS (ed.), irah
hC r
Academic Press, New York (1970).
GEN16.
ang
Proagramm n
C. HU,
JItJgJr
T.
Addison-Wesley, Reading, Mass. (969).
Gra.b IJ
of the Symposium
i2(1), 1975.
on
and
Combinatorial
&matLac.l
nUtblX, Z23
Lntea
rcY, Addison-Wesley,
Q.g
l
r
PC
Reading,
,
n
Mass.
A oolicatloQn
tInrLcrk
FL
s,
-5-
Deterministic Network Optimization:
General References
A Bibliograhy
GEN17.
T. C. HU, "Recent Advances
RBSIt IJf, 354-359 (1968).
GENJ8.
T C
dath
GEN19.
P. KIVESTU and R.
Optimization
(forthcoming)
GENZO
Do KNUTH, It Ai g/
o utar
eroaraslalq
Addison-Wesley, Reading, Mass. (968).
Y .,
GEN21.
Do KNUTH,
b JL.At
of g.J
Addison-Wesley, Reading, Mass
Mg.L
GEN22-
E. LAWLER, Combinatorla
fJtl
s Holt, Rinehart,
GEN23.
C.
LIU9
Introauctlion tQ ~gaGlatrial
McGraw-H11,
New York (1968).
GEN24.
MATHEMATICA
"Bibliography
Publications," In preparation.
GEN25.
O. ORE, fiEC
m IlgaLhejr Uoi. , Random House,
Singer Company, New York (1963).
GEN26.
A. NIJENHUIS and H. WILF
GgInL±l.Oa
Academic Press, New York(1975)o
GEN27.
R. POTTS and R. OLIVER,
E.LGI
In
IransDortation
HJktw]rhI
Academic Press, New York (1972).
GEN28.
Re READ (ed.),
ragh
Press, New York (1972).
GEN29.
T. L.
SAATY,
0Lmz2atLo
ID lalAr
in
ad
Rsia3 d
Ej~Cjcs
eoblQa~sq* McGraw-H111, New York (1970).
GEN30o
H.
SALKIN,
Reading, Mass.
GEN31.
A. SCOTT,
gohloat:.La ECac
QG &
aDgl. Plnniag Methuen, London (1971).
GEN32.
M. ELLS EaIjmo
°Sf
1
Press, New York (971).
g
Pergamon
GEN33.
M. ZELKOWITZ and A. AGRAWALA, "KWIC Index for
Networks," tift
.2th3 3](2)
135-172 (1973).
ComAuter
HU, "Some
ErQg.,
n
Network
Problems
in Discrete
1 02-112 (1971).
Flows,
SM
Optimizatlon,"
SIMPSONI
"Applications of Network
8A
Bbl iography,"
MIT Technical Report
Inte9er
(1975).
era!anralng
EauS
(1973).
Qgtltz&atongl
Networh
and Winston (forthcomilng).
of
CTbeoy Ig
Jg
laheatlcs
Network
Theory
The L.
W.
ALaorthma,
GoIli.qla
ecggaeulg,
3,
Academic
Addison-Wesl ey
at.L
llGnat ociAL Cooulta
AnLYiLis
Deterministic Network Optlmization: A Blblography
Shortest Path Problems and Variants
SPi.
Me BAZARAA
"A Dual
LANGLEY,
L AaLd
l
figAh~
R.
end
'
Algorithm,
Shortest
2i(3)*
Path
496-501
( 1974).
SP2.
"On a Routing Problem,'"
R. BELLMAN,
t£, 87-90
Bar,
Anis
ath.
(1958).
BROWN,
NU QCat
kS
Alternating
"Shortest
,(4)* 311-334 (1974).
Path
Algorithms,"
SP3.
J.
SP4.
"A Directlonall y Oriented Shortest Path
BUTAS,
L.
seaC
2, 253-268 (1968).
n
Algorithm," IrasoortatLo
SP5.
"LjaLg
V. CERF.
. COWAN, R. MULLIN and R. STANTON,
fgund
a Ib Araga Sbar
eat~ In BASIlAr firtinbh"
LtirbCksg .t(4), 335-342 (974).
SP6.
K. COOKE and E. HALSEY, "The Shortest Route through a
Network with Time-Dependent Internodal Transit Times,"
Mathb. A na
A&g
A
et . t1 493-498 (1966).
SP7.
G. DANTZIG, "On the Shortest Route Through a
ft"
L., ·
t 187-190 (1960).
SP8.
E. OIJKSTRA,
Graphst"
SP9.
blumL.
"A Note on Two Probl ems
t1
atbematlk,
"An
S.
DREYF US,
Algorithms·," Ons
n Connection with
269-271 (1959).
of
Appraisa I
B.-. 1.Z(3).
971
Network,"
Shortest-Path
Some
395-412 (1969).
Shortest Path," fjQG&
g
SP10.
R. FLOYD, "Algorithm
1(6)
345 (1962).
SPIl.
B FOX, "Finding a Minimal Cost to Time Ratio Circuit,"
Q2nna BiaS.
12I, 546 (1969).
SP2.
Probabilistic
H. FRANK, "Shortest Paths In
QOansB&,
1S(4). 583-599 (1969).
SP13.
J. GILSINN and C. WITZGALL "A Performance Comparlson
of Labeling Algorithms for Calculating Shortest Path
Trees," National Bureau of Standards Technical Note 772
(1973).
SP4.o
F. GLOVER, 0. KLINGMAN,
Finding All Shortest
( 1974).
SP15.
Path
8. GOLDEN, "Shortest
Working Paper OR 044-75,
jog
Graphst
"A Note on
and A. NAPIER,
Paths," Lcans. Sl-.,
(i),* 3-13
A Comparlson,
Algorithmst
Opers. Res. Center, M.I.T.
-Deterministic Network Optimization A Bbliography
Shortest Path Problems and Variants
(October
1975),
forthcoming in QarL.t
Res,
SPj6.
A. GOLDMAN and G. NEMHAUSER, "A T-ansport
Improvement
Problem Transformable
to a Best-Path Problem," Irml.l,
rL
L, 295-307 (1967).
SPJt.
S. HAKIMI, "Shortest Paths In Grapis-A Review,"
:tt..SaM *
icuit IThery 368-369 (1972).
SP18.
J.
HALPERN and I.
Constraints
on
PRIESS,
Movement
"Shortest
and Parking,"
IJ;Ef
Path with Time
thawomr.s I(3),
241-253 (1974.
SP19.
P. HART, N. NILSSON, and B. RAPHAEL,
"A Formal
Basis
for the Heuristic Oetermination of Minimum Cost Paths,"
IEEE
tran
·S=.
(2), 100-107
g
S ste
Sa
n;c
l
fSr
tPcs
(1968).
SP20.
L.
HITCHNER,
"A Comparative Investigation of
the
Computational
Efficiency of Shortest Path Algorithms.
Tech Report ORC 68-17, Opers.
Res.
Center,
Univ.
of
Calitf. at Berkeley (July 1968).
SP21.
A. HOFFHAN and H. ARKOWITZ, "A Note on Shortest Path,
Assignment,
and Transportation Problems," taYt. Bjri.
Lag., Q.,
.,
375-380 (1963).
SP22.
W. HOFFMAN and R. PAVLEY, "A ethod for the Solution of
the Nth Best Path Problem, "'JAC,
, 506-514 (1959).
SP23.
W. HSIEH and A. KERSHENBAUM, "Constrained
Routing In
Large Sparse Networks,
"Eocg
LnL gf Internationaf
Taiwan
Taipei,
SvaOSils, August 20- 22
CQ&utr
(1975) ..
SP24.
T. C. HU,
A ecomposition Algorlthm for Shortest Paths
in a Network," GQD,& igi.L, .1,
91-102 (1968).
SP25.
T. C. HU and . TORRES, "Shortcut
n the Oecomposit on
Algorithm for Shortest Paths In 3 Network," JIM djoCrZnL
qI sea
r
a.
evelolon an
13,
,
387-390 (1969).
SP26.
H.
JOKSCH,
Constraints,"
(1966).
"The
JL
.,
j
Shortest
Route
Problem
With
Wh
AJl.&
.an A&J.L
A , 191
SPZ7.
O.
JOHNSON,
"A
Algorithm," JAClJ
SP28.
D. JOHNSON,
"Algorithms For Shortest
Thesis, Cornell University (1973) .
Note on OJlkstra's Shortest
2iG(3), 385-388 (1973).
Paths,"
Path
Ph.O.
-8-
A Bibliography
ariants
Deterministic Network Optlmization
Shortest Path Problems and
Paths
Shortest
AU CQB2.fIlnc
Sorting,"
and
Boston, (August
SP29.
"On
E. JOHNSON,
1Z
I
ECesegnas
1972), 510-517.
SP30.
R. KIRBY and R. POTTS, "The Minimum Route Problem for
Penalties and Prohibit ons,"
Turn
with
Networks
TrarnsorAation Bsarch, 3, 397-408 (1969).
SP31.
V. KLEE, "A String Algorittm
&L.
Directed Networks, "DnsA.
SP32.
Decomposltlon
"A
G. MILLS,
Ons.
Shortest-Route Probl em,"
(1966).
SP33.
Go MILLS, "A Heuristic Approach to Some Shortest Route
jaLt
Garch
B
QOeratloL
ng.ia
a
Prob I ems,"
(Harch 1968).
gurnaaL,
SP34.
G. NENHAUSER, "A Generalized Permanent Label Setting
Algorithm for the Shortest Path Between Specified
328-334
38,
ad &Aal
JathbL Anaj
Nodes," JlL g
(1972).
SP35.
Efficiency
and
"Implementation
PAPE,
U.
Moore-Algorithms for the Shortest Route Problem,"
r.G., r , 212-222 (1974).
SP36.
for Shortest
on Algorithms
Bibliography
A. PIERCE,
and Related Circuit
Shortest Spanning Tree,
Path,
(2), 129-150
Routing Problems (1956- 194)," Itworbrs,
( 1975).
SP37.
I. POHL, "Heuristic Search Viewed as Patl Finding
1, 193 (1970).
Graph," ACtfilJCL It.ll.ilgenc
SP38.
R.
POTTS
tiLgdorks,
for
L.
Shortest Paths
428-432 (1964).
In
the
for
Algorithm
1(2), 279-291
B. .
of
l.
a
n
Icansporatal/a
in
Fl1QI
and R. OLIVER,
Academic Press, New York (1972).
"The K Shortest
1-11 (1968)
Chains
in
a
Graoh,"
SP39.
n. SAKAROVITCH,
,
a.,
1anS
SP40.
J. SAKSENA and S. KUMAR, "The Roting Problem with
&., 14, 909-913 (1966).
Specified Nodes, "Q.ns,.
SP41.
J. F. SHAPIRO, "Shortest Route Hethods For Finite State
Space Oeterministic Dynamic Programming Problems," JI
1232-1250 (968).
, If1,
li.
QQM
L&gon
SP42.
O. SHIER, "Algorithms for Finding the K Shortest Paths
in
a Network," paper presented at ORSA/TIMS Spring
Meeting, Philadelphia (1976).
"k"
Deterministic Network Optimizationt A Bibliography
Shortest Pat9, Problems and Variants
-9-
SP43.
O. SHIER, "Computational Experience with an Algorithm
for Finding the K Shortest Paths n a Network," aJu.nal
139-165 (974).
Z,
gari b. if h9
G/ BRa
SP44.
Shortest
P. SPIRA, "A New Algorithm for Finding All
Arcs i'n Average Time
n a Graph of Positive
Paths
28-32 (1973).
IAM LL gcutIng, Z(i)
O((nlogn)++2),"
SP45.
P. SPIRA and A. PAN, "On Finding and Updating Spanning
.LAUt AL ".RBoltgl2t (3),
Trees and Shortest Paths,"
375-380 (1975).
SP46.
Routes
A. WEINTRAUB, "The Shortest and K-Shortest
3(1), 61-74 (1973).
Assignment Problems," QJGJs
SP47.
for
ILLIAMS, "An Improved Shortest Path Algorithm
T.
in which the Maxlmum Outward Degree s Less
Networks
than n/2," Presented at the 1975 ORSA/TIMS Meeting, Las
Vegas, Nevada.
SP48.
J. YEN, "An Algorithm for Finding Shortest Routes from
Source Nodes to a Given Destination n General
All
MathematIrs1&
f &lad
Jdurnal
Networks," aC.terl
2,i 526-530 (1970)
SP49.
J. YEN, "On Hu's Oecompositlon Algorithm for Shortest
(4), 983-985 (1971).
]9g.
Paths in a Network, "lns.
SP50O.
Finding the Lengths of All Shortest Paths in
J. YEN,
N-Node Nonnegative Distance Complete Networks Using
12(3),
JACM
1/2N+3 Additions and Nee3 Comparlsions"
423-424 (1972).
as
-10-
A Blbliography
Deterministic Network Optimization
Network Reliability
REL1.
for
M BALL and R. VAN SLYKE9 "Backtracking Algorithms
(1),
&[A £iJ.etlnqtf39
Network Rel lab I lity Anal ysis"
B-73 (975).
REL2.
PROSCHAN,
R. BARLOW and F.
Bal.lahii.tI Wiley (1965).
REL3.
In a
M. BELLMHOREt "Optimal Al locaton of Resources
John Hopkins
Communicatlons Network," Ph.O. Thesis,
University, Baltimore, Maryland (1965).
REL4.
"An Impl cit Enumeration
M. BELLMORE and P. JENSEN,
Scheme for Proper Cut Generation," Tachnometrics, 1Z(4)
(1970).
REL5.
0. BROWN, "A Computerized Algorithm for Determining the
Reliability of Redundant Configurations," IEF .r.ans.
gD Rellaibllt·
-2n(3)
bIhQrx
JJ.l
ItJbnswati
.jl
121±-24 (J971).
REL6.
Optimization of
"Topological
H. FRANK and W. CHOW,
ji 1385-1397
sL
ro.gce.ed inl
Computer Networks,"
(1972).
REL7.
and Design of
"Analysis
FRISCH,
H. FRANK and I.
CoI. LLQ Tc.·
lca.itS1InS
,EE.
Survivabl e Networks,"
502-503 (1970).
Co·gL(5)
REL8.
"A Note
V. FU and S. YAU,
Networks,"
Communication
on the
. SL
of
Rellabl Ity
469-474
j/(3)
( 1962).
REL9.
0. FULKERSON and L SHAPLEY "MHnimal
Graphs," 1aIwoks, 1(1). 91-98 (971).
Connected
K-Arc
Least
RELlO.
S. HAKIMHI "An Algorithm for Construction of the
Vulnerable Communication Network," IEEU rars.a
229-230 (1969).
1jagc1. CTL-.
REL11.
S. L. HAKII and A. AIN, "On the Design
241-260 (1973).
Networks," I.njt.grks 3(3)
REL12.
A Fast Recursive Al gorithm to Calculate
E. HANSLER,
lty
of a Communication Network," IUg
the Re labi
3) , 637-640 (1972).
C.2a(
anQ mfuDlIcatlons,
ICI/ans
REL13.
"Exact
WILKOV9
and R.
CAULIFFE,
G.
HANSLER,
E.
el lability," Ne~tocksi
Calculation of Computer Network
4(2), 95-112 (1974).
REL14.
J.
HOPCROFT and
R.
TARJAN,
"Dividn
of
a
rircult
Reliable
Graph
nto
-11-
Deterministic Network Optimization8
A Bbllography
Network Reliability
Triconnected
1973)
Components,"
SL&N
REL15.
J. HOPCROFT and R. TARJAN,
gaJ
Graph Hanipulation,"
RELI6.
T. C.
HU,
RBAXLx
L.
ogmgut.,
Z(3)
(Sept.
Algorithms for
"Efficient
(June 1973) .
(16)
gi. &Q,,
"ost Reliable Routes
(2), 261 (1966).
in
a
Network,"
SIA
REL7.
P. JENSEN and H. BELLMORE, "An Algorithm to Determine
the Reliability of a Complex System," EE TransactSlns
920 a liab lt
R-i(4) (969).
REL18.
for the
P. JENSEN, "A Graph Decomposition Technique
Electronic Networks," Ph.D.
of
Redundant
Design
Dissertation, Johns Hopkins Univarsity, Bait., Maryland
(1967).
RELI9.
A. KERSHENBAUM and R. VAN SLYKE, "Recursive Analysis of
[(j1)9 81-94 (1973).
Nletwanck
Network Rellabl ty,"
REL20.
Y. KIM, K. CASE, and P. GHARE, "A Method for Computing
Qn
IrCa~S
IEEE
Reliability,"
System
Complex
R21(4), 215-219 (1972).
e llaltiA.
REL21.
Communication
Reliable
"Synthesis of
LEGGETT
J.
of
University
dissertation,
Ph.D.
Networks,
Pennsylvania (1968).
REL22.
W. MAYEDA,
( 1972).
REL23.
in
of Stochastic Networks
IRCHANOANI, "Analysis
P.
Resource
Innovative
Systems,
Service
Emergency
Report
Tech.
Planning in Urban Public Safety Systemst
TR-15-75, Opers. Res. Center, M.[.T, (March 19751.
REL24.
K. MHISRA, "An Algorithm for the Reliability Evaluation
.
Relabllt,
T.lfE tc an
of Redundant Networkst"
146-151 (1970).
-1_21(4)*
REL25.
K. MISRA and T. RAO, "Reliability Analysis of Redundant
Qn
Itans
L.LE
Graphs,"
Flow
Using
Networks
19-24 (1970).
BRleJjakjL1x, g(1),
REL26.
E. MOORE and C. SHANNON, "Reliable Circuits Using
I nsttuteta
I Fran.aal
&
Relays,"
Reliable
191-208 (Part I) and 281-297 (Part II)(1956).
REL27
F..
Gran
OSKOWITZ,
A&ILE
(1968).
.I.caU
Ieor.
"The
John Wiley and Sons,
Analysis
Em.
aal
of
Redundancy
roES.
s
New
York
Less
2f,
Networks,"
J, ., 627-632
-12-
Oeterministlc Network Optimlzation
A Bibliography
Network Reliability
REL28.
J. MHURCHLAIDO, "Calculating the Probablilty that a Graph
JD-82,
Planning
and
is
Dlisconnected,"
Report
Transport Research
and Computation Co., London (Feb.
1973).
REL29.
for Repairable
Relations
"Fundamental
J. HURCHLANO,
Planning and Transport Research
Iterms" Report JOM-177
and Computation Co., London (Feb. 1973).
REL30·
J. MURCHLAND and 0. SHIER, "Calculating the Probability
Report
Disconnected,"
that an Undirected Graph Is
Research
and
Transport
Planning
and
JDM-186,
Computation Co.,
REL31.
London (1973)·
"Finding
S. PARIKH and I. FRISCH,
Routes In Communication
System,"
xstas, CS-1i±
Most
the
Reliable
IEEE l ansaaau
402-407 (1963).
REL32.
Complex
of
Relab lity
"Computing
A. ROSENTHAL,
Ph.O° Thesis, U.· of Cal., Berkeley (1974).
Systems,"
REL33.
Linear (rAi.bZ
S. SESHU and H. REED,
tiagacrkse Addilson-Wesley (1971).
REL34.
J. SUURBALLE, "Disjoint Paths
.(2)* 125-146 (1974).
REL35.
TARJAN,
R.
Algorlthms,"
REL36.
"Rellab llty
FRANK,
H.
and
SLYKE
R.
VAN
Computer-Communication
Network, " Proc
tb QCon.
71-82,
(1971).
AFIPS
Press,
Providence,
SlulatiAn
REL37.
R.
VAN
Analysiss
"Depth
SiL&
SLYKE
and
mnQa
E
n a Network,"
Ictri
Ulworkspt
First Search and Linear
fAaai.-, (2) (June 1972).
H.
FRANK,
Part Ir" Nerk9t
1(3),
H. FRANK, and A.
Analysist
Part
"Nletwork
279-290
al
Graph
of
d
Rel labil ity
(1971).
"Network
KERSHENBAUM,
2. "
ltaorks(to
be
REL38.
R. VAN SLYKE,
Rel iability
published).
REL39.
R. WILKOV, "Analysis and Design of
Reliable Computer
s,1
M-20 ( 3) .
Ians
g QMaiLcL a
JEF
Net works 9"
660-678 (1972).
REL4O.
O. WING, "Algorithms to Find the Most Reliable Path In
a Network," .LB
ITrans. .
cLt
T.rIheo
..A ,. 78-79
(1961).
-i3-
Deterministic Network Optimization A Bibliography
Single and Multi-Commodity Flows
MULTI.
A Survey,"
Network Flows A. ASSAD, "ulticommodity
M. I.T., Working Paper OR
Operations Research Center
u 45-75.
MULT2.
the Generalized
'On
IVANESCU,
and P. L.
E. BALAS
an. SaCJl 11t 88-202 (1964).
Problem,"
Transportation
MULT3o
the
Solving
for
"An Algorithm
BEALE,
M. L.
E.
Transportation Problem When the Shipping Cost over Each
Route is Convex," Nay B 1. LQaL Q.9 fa 43-46 (1959).
MULT4.
M. BELLMORE,
Multivehicle
J9
MULT5.
36-47
S.
and
G. BENNINGTON,
Tanker Scheduling Problem,"
LUBORE,
Irans .,
"A
Defense
of
(1971)
and
M. BELLMORE
Multi-Commodity
H. RATLIFF,
e
Networks,"
"'OptimaI
I"Lel
an.
j1(4)
174-185(1971).
"An Ef ficlent Minimum Cost
BENNINGTON,
atl.a L, 1J(9), 1021-1051 (1973).
Algorithmn"
Flow
MULT6.
G. E.
MULTi.
6 BOZOKI, "Minimum Cost Hulticommodity Network Flows,"
Thesis, Purdue Univ. (June 1969).
Ph. D
NULT.
for the Trafftic
So P. BRAOLEY9 "Solution Techniques
Report ORC 65-35, Opers.
Tech.
Assignment Problem,"
of Calif. Berkeley (1965).
Res. Center, Univ.
MULT9.
Routing ln a
"3ptImal
D. G. CANTOR and M. GERLA,
9
Computer Network, " IfEE TCan
Packet-Sw itched
(J974).
±0g 10062-1068
.t-I
CQUL±M*..l
MULT10.
A. CHARNES and W. W. COOPER, "The Stepping Stone Method
In
Calculations
of Explaining Linear Programming
Transportation
Problems,"
Man,
SjLo
1
49-69 (1954).
MULT1.
A. CHARNES and W. W. COOPER, "Multicopy Traffic Network
Ed. )
Herman,
(R.
ELt
TrafI.LL
.
Models," In Thor
(19611.
84-96
Amsterdam,
Elseviewn
MULTZ2.
A Primal Algorithm for Solving
S. CHEN and R. SAIGAL,
Flow Problem with Additional
Network
Capacitated
a
Laboratorles,
Report, Bell
Linear Constraints," Tech,
Holmdel, N. J. (1975).
MULTI3.
'Optimal
SMITH and G. TYNDALL,
R.
J. E. CREMEANSe
Multicommodity Flows with Resource Allocation," tNil
269-280 (970).
LQg Q *r 1,
*es
-14-
Deterministic Network Optimization: A Bibliography
Single and Mu ti-Commodity Flows
MULTt4.
G. B. OANTZIG, "Application of the Simplex
ethod to a
Transportation
Problem,"
AGt.Iy
ily
A!nalzs.gs
i
g
Liaa
.
ana Al.
JLSatiLgn Cowles Commission Monograph
139 Wiley, 359-373 (1951).
MULT15.
G. B. OANTZIG and O. R. FULKERSON,
"On
MHn-Cut
Theorem of Networks," In Lear
angi RglatJa
Systsi
nnat
the Max-F I ow
Ineouuallites
38
,
215-21
(1956)
MULT16.
G. B. ANTZIG and A. J. HOFFMAN, "ilworth's
Theorem on
Partially Ordered Sets," in LILaC Iaua
ils
Ana
Baiatea SsX.ta 9 A,
9.t Math.
Stud
,
Princeton
Univ. Press., Princeton, N. J. 207-214 (1956).
HULT17.
J. 8. DENNIS9, A High-Speed Computer Technique for
Transportation Problems" JA,9 A,
32-151 (1958).
MULTi8.
P. OWYER,
"The
Direct Solution
of
the
Problem with Reduced Matrices," ,a.L
the
Transportation
1.(1),
1j.,,
77-98
( 1966).
MULTj9.
P.
S. DWYER,
Transportation
Matrices," Univ.
MULT20.
J. EDMONOS and R. H. KARP, "Theoretical Improvements In
Algorithmic Ef ficency
for Network Flow Problems,"
Lrf:
9. 248-264 (1972).
MULT21.
P. ELIAS, A. FEINSTEIN, and C. E. SHANNON, "A Note on
the Maximal Flow through a Network," IE IJCan..
nICBr&A
Ih.eorC
I1_2. 117-119 (1956).
MULT22
H.
.
ea;u
FLOOD,
iLa.. t
"The
Solution
of
the
Hitchcock
Problem
with a Method of Reduced
of MiHch. (1955).
"On the Hitchcock
iJstribution
Problem,"
I ., 369-386 (1953).
MULT23.
L. R. FORD and 0
Network," Can, L
R FULKERSON, "Maximal Flow through a
MLath.
1.i9 399-404 (1956).
MULT24.
L. R.
FORD and O. R.
FULKERSON,
"Solving
Transportation Problem," aAM
ig, ,9 24-32 (1956).
nULT25.
L.
R. FORD and D.
R. FULKERSO N
"A
Pri1a l-Dual
Algorithm for the Capacitated Hitchcock Problem,"
aL
Res L& .Q*.
47-54 (1957).
MULT26.
L. R. FORD and 0. R. FULKERSON, "A Simple Algorithm for
Finding Maximal Network Flows and An Application to the
Hitchcock Probl em," Can. J Ihtb3 9! ,
210-218
(1957).
MULT27.
L.
R. FORD and 0. R.
FULKERSON9
klonstructing
the
Maximal
-15-
Deterministic Network Optimization A Bibliography
Single and Multi-Commodity Flows
Dynamic Flows from Static Flows," Qns. B
(1958).
.9o
419-433
MULT28.
Suggested
"A
FULKERSON,
L.
R.
FORD and 0. R.
Computation for Maximal Multi-Commodity Network Flows,"
U..
1M
"i. i. 97-101 (1958).
MULT29.
"Network
L. R. FORD and 0. R. FULKERSON,
.
Systems of Representatives," Ql..L A fatfLt.
(1958) .
MULT30.
L. R. FORD and O. R. FULKERSON,
Princeton Univ. Press, Princeton,
MtULT31.
H. FRANK and W. CHOU, 'Routing
Jors,
(2), 99-112 (1971).
MULT32.
Qgu3jlatio.o.ns Transmlsslon
H. FRANK and I. T. FRISCH,
Addison-Wesley, Reading,
NatjrCk,
Aug TCTansgotaati
Mass. (1971) .
MULT33o
I. T. FRISCH, "Optimum Routes in Communication Systems
with Channel
Capacities and Channel Re liabilities,"
IUEE cUanls
"
S ystieaf, .5±l· 241-244 (1963).
MULT34.
Method
Computatona I
"A
FUJISAWA9
T.
Transportation Problem in
a Network," ".
aQGJ,JaaL- , 157-173 (195°).
MULT35.
in
a Lossy Network,"
T. FUJISAWA, "Maximum Flows In
A.D
n
IrcuI
t
erL
lft
Connu
AlQin
Po e ed
xatl hJUas:tY Urbana I I.,
385-383 (1963).
MULT36.
"Note on Ollworth's Decomposition
O. R. FULKERSON,
Theorem for Partially Ordered Sets," In Proc aBIQe
lAtlb SQC,
Z, 701-7C2 (1956).
MULT37.
0. R. FULKERSON, "A Network Flow Feasibility Theorem
A.tL
Ha
, 11,
Can,
Applications,"
and Combinatorial
4 4 C- 4 5 1,
(1959) ·.
MULT38.
"An
Out-of-K I ter
0.
R. FULKERSON,
F low Problems," J& UAis 9
Minimum-Cost
MULT39.
0. GALE, "A Theorem on Flows
flthl-. Z, 1073-1082 (1957).
MULT40.
O. GALE,
f,
MULT41.
59-63
in
In
Flow and
1j, 78-85
i
N.
F l os
N. J. (1962).
Computer
Networks,"
for
OQrc
the
t..
for
Method
18-27 (1961).
Networks,"
"Transient Flows In Networks,"
QotarJIi
Lch.
Ea.
attg
J.
L,
(1959).
Solving
for
Algorithm
"An
N. GLEYZAL,
A.
Transportation Problem,"
Res. Paoer 2583, Uji J.A,
the
54,
-16-
Deterministic Network Optimilzatlont A Blbliography
Single and Multi-Commodity Flows
213-216 (1955).
MULT42.
F. GLOVER and 0. KLINGMAN, "On the Equivalence of Some
Generalized Network Problems to Pure Network Problems,"
alJ
Etag·.
.
.(3), 369-370 (1973) ·
MULT43.
F. GLOVER,
D. KLINGMAN,
and G. R.
ROSS,
"Finding
Equivalent Transportation Problems," hayi B.s. L
21(2)* 247-2539
(974).
MULT44.
B. GOLDEN
A Minimum Cost Multicommodity Network Flow
Problem Concerning Imports and
Exports," NeSwgCmjZ9
i(4) 331-356 (975)-
MULT45.
M. O GRIGORIADIS and W. W., WHITE, "A Partitioning
Algorithm for the Multicommodity Network Flow Problem,"
tiabl, etag-, (2), 157-177 (Oct. 1972).
MULT46.
M. D.
GRIGORIAOIS
and
W.
W.
WHITE,
"Computational
Experience with a Multicommodity Flow Algorithm," In
QotialzatIC
/
I&r 6Mhas
ftarp
AI1 caon,
(R.
Cottle and Krarup, Eds.) English Univ. Press, 205-226
(1972)
IULT47.
R. C.
QQa1,
MULT48.
S. L. HAKIMI, "Simultaneous Flows through Communication
Networks,"
J
TLans.
irL.cL.
1JQj-_ 9, 169-175
(1962).
MULT49.
J. HARTMAN and L. LASOON, "A Generalized Upper-Bounding
Algorithm for Multicommodity Flow Networks,"
3LktlhS
1, 33-354 (1972).
MULT50
I. HELLER, "Constraint
atrices of Transportation-type
Problems,"
,
asa.U Ls..L ., i, 73-78 (1957).
MULT51.
F. L. HITCHCOCK, "The Distribution of a Product from
Several Sources to Numerous Localities,"
h
Nattl.
EhtS-, 2,
224-230 (1941) ·
MULT52
T. C. HU, "'Multicommodity Network Flows,"
l1t 344- 360 (1963).
MULT53.
T. C. HU, "'On the Feasibility of Simultaneous Flows
a Network," Q.5
Bjft., "j, 359-360 (1964).
MULT54.
T. C. HU,
BaS La.
MULT55.
H. IRI,
GRINOLO, "A Multicommodity
B
16· 1i234-1238 (1968).
Hax-FIow
Minimum Convex Cost Flow
,
1-9 (1966).
Algorithm,"
ons
n Networks,"
USs.,
in
Nay,
2&Lt*
A New Method of Solving Transportation-Network
-17-
Deterministic Network Optimizationt A Bibliography
Single and Multi-Commodity Flows
Problems,"
"L QjlCA&
Res
Soc.
Jaanq 3
27-87 (1960).
Tech.
Flow through Networks,"
Res. Center, M.I.T. (June 1958).
MULT56.
W. S. JEWELL, "Optimal
8, Opers.
Report No.
MULT57.
Flow through
"Optimal
N. S. JEWELL,
476-499 (1962).
Gains,' Qnns. LB.o /-
MULT58.
W. S. JEWELL, "Multicommodity Network Solutions," Tech.
eitero Univ. of Calif.
Res.
Opers.
Report ORC66-23,
Berkeley, (1966).
MULT59.
"A
JEWELL,
S.
W.
Flow-Algorithm," Tech.
Center, Univ. of Callf.,
MULT60.
E. JOHNSON, "Networks and Basic Solutions," Qnn s.·fb
,· 619-624 (1966).
MULT61.
the Trans location of Masses,"
"On
L. KANTOROVITCHI,
Lt, 199-201, (1942).
J;i
r Si·,
&ea" (I0Qokladl
GIaJ
MULT62.
L. KANTOROVITCH and M. K. GAVURIN, "The Application of
Methods In Probl ers of Freight Flow
Mathematical
fgSLncerned ]ilt3
EIiLuA
Analysis," I QlQlectlon G/
of
Publ
TCanLsYor'
Etfectiveia
Increasing 1S L2
the Akademii Nauk SSSR
Networks
with
Mu Iticommodity
Pri mal-Oal
Report ORC 66-24, Oers. Res.
Berkeley (1966).
,
1i10-138 (1949)-
HULT63.
A
Flowst
"Mul ticommodity Network
KENNINGTON,
J.
Solution
and
Models
Llnear
of
Survey
State-of-the-Art
Techniques, " Tech. Reports IEOR 75014 and IEOR 75015,
Dept. of Ind. Eng. ano Opers. Res., SMU (Dec. 1975).
HULT64.
M. KLEIN, "A Primal Method for Minimum Cost Flows with
Application to the Assignment and TransportaProblems,"
205-220 (1967).
1A(3).L
,
H~.
MULT65.
for
Algorithm
'An
KLEITMAN,
J.
D.
9
Networ
Multi-commodity Flow Problems,"
Certain
J, 75-90
( 1971).
MULT66.
Nonlinear
for
Algorithm
"An
KLESSIG,
W.
R.
_l4)343-356
UtwQror
Multicommodity Flow Problems,"
(1974).
MULT67.
O. KLINGHAN and G. T. ROSS, Finding Equivalent NeTwork
Formulations for Constrained Network Problems," MaL
SJL (to appear).
MULT68.
Constrained
O. KLINGHAN and R. RUSSELL, "Solving
91-106
23(1),
2B"j
QDns.
Transportation Problems,"
(1975).
-18-
Deterministic Network Optlmilzation A Bibliography
Single and Multi-Commodlty Flows
MULT69.
T.
C.
KOOPMANS
and
S.
REI TER,
"A
Mode I
of
Transportation,
in AG&i. ity Anal.Y.i
a.t eCgloduc tQD a
Alocgation,
Cowles Commission Monograph 139 Wil ey,
222-259 (1951).
MULT70.
H. W. KUHN, "The Hungarian Method for the Assignment
Problem," a1a B.L Log,
*g.o2 83-97 (1955).
MULT71.
H. . KUHN9 "Variants of the Hungarian Method for the
Assignment Problems," t.QA&L
is.
LQ9 9., 3, 253-258
(1956).
MULT72o
S.
AIER,
"A Multi-Item Network Flow Model
with
Capacity Constraints," Tech.
Report 69-149 Dept. of
Opers. Res., Stanford Univ. (Oec 1969).
MULT73.
'A
Compact
Inverse Scheme Applied to a
S. MAIER,
Multicommodity Network with Resource Constraints," In
QpUalzait
Univ.
tULT74.
MULT75.
1bJE
Press,
ar
179-
All acatlJsn
source
Eng l sh
203 (1972).
W. MAYEOA and M. E. VAN
VALKENBURG,
"Properties
of
Lossy Communication
Nets,"
EJ;
Trans. CIrcu&L
t]t.
CTLtzp 344-388 (1965).
J.
ZA
MINTY, "Monotone Networks,"
A 2.L, 194-212 (1960)
y.Q Sc.
Prg&
Londng
MULT76.
'"The Assignment
T. S. MOTZKIN,
.h^
. gSoeslum
In
Ag.LL
109-125 (1956).
MULT77.
F.
MUARRAS,
"Optimization
J.
Networks with Galns," ah... t Egs
MULT78.
the
Assignment
for
"Algorithms
J.
MUNKRES,
Transportation Problem," L. SA!, i
32-38 (1957) .
MULT79.
K. ONAGA,
Networkst"
A
In ero.S
Prob Iem,"
:Ltj .M
,
McGraw-HI I ,
of
the Flow Through
4(2), 135-145 (1972)
and
"Optimum
Flows in
General Communicat ion
EnbJ.L
idlasts 283s 308-317 (1967).
HULT80O
A. ORDEN, "The
276-285 (1956).
MULT81.
J. H. PLA,
"An Out-of-Kilter Algorithm
Minimum Cost Potential
Problems,"
Jit
275-290 (971j)
MULT82.
M. R. RAO and S. ZIONTS, "Allocation of Transportat on
Units to Alternative Trips," Qga
RjU., Zk. 52-63
(1968)
'
Transhipment
Problem,"
em"
a.
1J.,
3
for Solving
P.g
EC.r.Q
4'
'
..
~ ~~~~~~~C
.
,\
,
-19-
A Bbliography
Deterministic Network Optimizatlon
Single and Multi-Commodity Flows
NULT83.
J. T. ROBACKER, "On Network Theory,"
RM-14989 The RAND Corp. (May 1955).
MULT84.
8. ROTHFARB,
Flows," Ph.D.
HULT85.
Memorandum
for Multlicommodity
Comblnatoric Methods
Thesis, Univ. of Catlf., Berkeley (1968).
the Three-Commodity
T. FRISCH, "On
at.-, i , 46-58
gQ AaaL&
a
B. ROTHFARB and I.
F low
Res.
Problem,"
SM
(1969).
"Ccmmon
202-205
MULT86.
FRISCH,
T.
8. ROTHFARB, N. P. SHEIN, and I.
h,
2QrasaR,.t
Hulticommodity Flow,"
Terminal
(1968)
MULT87.
Feasiblllty of
8. ROTHSCHILD and A. WHINSTON9,
lp 112112129 (1966).
Commodity Flows," onsr. ft.a.,
HULT88.
B. ROTHSCHILD and
Network Flowst QgD.
MULT89.
R. SAIGAL, "Multlcommodity
ORC 69-14,
Report
Tech.
Callf
.9
Berkeley
Two
two Commodity
"On
A. WHINSTON,
377-387 (1966).
fjL-,,4,
(Sept.
Flows in ODirected Networks,"
Opers. Res. Center, Univ. of
969).
HULT90.
N. SAKAROVITCH9 "The Multicommodity Max Flow Problem',
es. Center, Univ. of
ORC 66-25, Opers.
Report
Tech.
Calif., Berkeley (1966).
MULT91.
H. SAKAROVITCH,
Thesls,
Ph.O.
Berkeley (1966).
MULT92.
and
Primal-Dual
"A Note on the
SHAPIRO,
F.
J.
for Network Optimrai zat ion
Algorithms
ter
Out-of-K Il
(to appear).
Problems," .ititlZS
MULT93.
Functions,"
Network F lw
"On
SHAPLEY,
S.
L.
Memorandum RM-2338, The RAN'D Corp., (March 1959).
MULT94.
the
for
Al gorithms
"Oecomposit ion
C. SWOVELAND,
Multicommodity Distrlbution Problei," Working PaPer No.
Man. Instit., UCLA (June 1975)
184, Western Sci.
MULT95.
Transportation Solutions,"
"Instant
W. SZWARC9
iti. Lga Quart., 2· (3), 427-440 (1975).
MULT96.
Transportation
"The
W. SZWARC,
uaLIbt., ±&, 185-202 (1971).
L,
MULT97.
W. SZWARC9 "The Transportation Problem with
an, Sclp "l 33-50 (1964).
Demand,
Flow Probleat,"
Multicomeodity
"The
Center, Univ. of Callf.,
Res.
Opers.
Paradox,"
tlv.
Res.
at.L
as.
Stochastic
-20-
Deterministic Network Optimization A Bibliography
Single and Multi-Commodlty Flows
on Feasibility Conditions of
1/ ,
"sg-.
2Q2.iA.
a Network,"
MULT98.
"Comments
D. T. TANG,
Simultaneous Flow In
143-146 (1965).
MULT99.
To TANG, "Communication
O. T.
I
F low Requirements,"
176-182
MULT100.
Networks
Tal
c .
wlth
Simultaneous
ICh.c,
.t1-.,
(1962).
0. T. TANG,
I E E Ia,,
"Blpath
1ru.uI
Networks and Multicommodity Flows,"
I:,"
C J.1 468-474 (1964).
MULTO11.
N. TOMIZAWA,
On Some Techniques Useful for Solution of
19' 173-194
(1972)o
Transportation Problems," ItQioIC.a
MULT102.
J. A.
F low"
MULT103.
TOMLIN,
Qs.
'Minimum
U.qL, ,LA,
Cost
ulticommodity
Network
45-51 (1966).
J. A. TOMLINt"A Mathematical Programming Model for the
of Traffic," .ca.s ·
Combined Oi s tr ibut ion-Ass i gnment
.1,
, 120-140
(1971).
Laws,"
. TUCKER, "Analogues of Kirchhoff's
Has!lngton UnL . JLItJ
Er
I, (1950).
MULTJ04
A.
MULT105.
J. VON NEUMANN,
A Certain Zero-Sum Two-Person Game
In
Assignment Problem,"
Equivalent to the Optimal
Q CcibutJ=Q
.Q tbah eory qgf Gagl, Ann.
Math Study
28, 5-12 (1953).
MULT10 6.
D. F.
VOTAW Jr., and A. ORDEN,
Assignment Problem," Prolect SCOOP,
"The
Manual
~eraa
Personnel
10, 155-163
(1952).
MULT107.
H.
. WAGNER, "On a Class of Capacitated Transportation
Sl., Ji 304-318 (1959).
Problems," la,
MULTiC 8.
A. C. WILLIAMS, "A Treatment of Transportation Problems
by Oecomposition," Le. SIA
, 1, 35-48 (1962).
MULT109.
N. nHITE,
"Oynamic
Transship ment
Networks:
An
Algorithm and its Application to the DiOlstribution of
Empty Containers," Networbs, 2(3), 211-236 (1972).
MULTiO.
R.
. WOLLHER,
"HMuticommodity
Network F lows with
Resource Constraintst
The General zed Multiccmmodlty
tocrk,
1(3), 245-263 (1972).
Flow Problem,"
MULT111.
8. YAGED,
Models,"
"Minimum Cost Routing for
LaearkI4S, 1(2), 139-172 (971).
MULT112.
N. ZADEH,
"More
Static
Network
Pathological Examples for Network
Flow
-21-
Deterministlc Network Optimization A Bbliography
Single and Multi-Commodity Flows
Problems," Hath
.Er. g.
5(2).
217-224 (1973).
MULT113.
N ZADEH,
A Bad Network Problem for the Smplex Method
and Other Minimum Cost Flow Algorithms,"
ath, erg2.,
5(3), 255-266 (1973).
lULT114.
Backloggl ng
Model
and
a
W. I.
ZANGWILL9
"A
Multi-Echelon
Model
o f a Oynamic
Economic Lot Size
Network Approach,"
MI
j.,9
Production System- A
11(9).
506-527 (1969).
-22-
Oeterminist lc Network Optimization A Bibliography
Traffic Equilibrium
Traffic
Theory of
109-117 (1967).
,
Flow
in
EQUIL1.
M. J. BECKMANN, "On the
Quartur..·
Networks," If.L=
EQUIL2.
M.
EQUIL 3.
A
Transportation Planning
in
"Search
BHATT,
K.
Critical Bibliographye" Research Report R 68-46, M.I.T.
Oepartment of Civil Engineering (1968).
EQUIL4.
R. BROOKS, "Allocatlon of Natur al
es.
Shortage," Ph.D. Thesis, Opers.
.AtLdA
cGUIRE and C. B. WINSTEN,
ECKMANN, C. 8.
New
Press.
Univ.
Yale
ansportation
I
f
Economics
in
Haven (1956).
Gas in Times of
Center, MIT, (Aug.
1975).
EQUIL5.
A. CHARNES and W. COOPER,"Mul ticopy Traffic Network
.w (R. Herman, Editor),
n Th.ory 21 1rafj.Q
Models,"
G. OANS and 0.
84-96 (196).
Amsterdam,
Elsevier,
Oversaturated
of
Control
"Opt ival
GAZIS,
ICDn.s.
Networks,"
Transportation
Store-and-Forward
L)(1), 1-19 (1976).
Cla
EQUIL6.
Model
S. C. OAFERMOS, "An Extenoaed Traffic Assignment
,
with Applications to Two-Way Traffic,'"Irans.L S21.,
366- 389 (1971).
EQUIL7.
Problem for
S. C. DAFERMOS, "The Traffic Assignment
S,
Multi-Class User Transportation Networks," Tran.
(1),
73-87 (1972).
EQUIL8.
S. C. DAFERMOS and F.T. SPARROW The Traffic Assignment
D
Network," L Re&. Sal ~jtE..
Problem for a General
73B, 91-118(1969).
EQUIL9.
"On Incremental
J. FERLANO, H. FLORIAN, and C. ACHIM,
Rs. 9((4),
Iran&.
for Traffic Assignment,"
Methods
237-239 (1975).
EQUIL1G.
for Computing
A Method
M. FLORIAN and S. NGUYEN,
Trans. .GI.,
Demands,"
astic
El
with
Network Equilibrium
A, 321-332 (1974).
EQUILi1.
Experience with
"Recent
NGUYEN,
H. FLORIAN and S.
Conjested Urban
a
of
Methods for the Study
Equilibrium
Traff ic
on
Symp.
Int.
the
Area," presented at
1974).
(Nov.
Montreal
Methods,
Equilibrium
EQUIL 2.
M. FLORIAN, S. NGUYEN and J. FERLAND, "On
Distributlon-Assignment of Traffic, "Trl
the
.
Combined
, 9((1)
-23-
Deterministic Network Optlmizatlont A Bibliography
Traffic Equilibrium
43-53 (1975).
EQUIL13o
"The FlIon
KLEINROCK,
H. GERLA and L.
FRATTA,
L.
orward
Store-and-F
to
Deviation Methodt An Approach
97-133
(2),
NgL~Jorhj1
Communicatlon Network Designg"
(1973).
EQUIL14.
EQUILI5.
"Area
N. GARTNER9
.Equ Ilbr um " gfr
Montreal (Nov. 1974).
Traffic
1 SYt
Control
Tatl.[2
oQ
Network
and
IIC
EIgsaFau
Assignment
"A Method for the Traffic
A. GIBERT,
LBS Report
Transport Network Theory Unit
Problem,"
TNT 959 London Business School, London (1968).
EQUIL16.
A. GIBERT, "A Method for the Traffic Assignment Problem
when Demand s Elastic," Transport Network Theory Unit
London
London Business School
85,
Report LBS-TNT
(1968}.
EQUILI7.
A.
E. O. HEADY,
H. H. HALL,
Equilibrium
"Spacial
SPOSITO,
Quadratic Programming Analysis,"
323-338 (1975)o
EQUIL18.
"Traff lc Equi libria
PETERSON,
L.
H. A HALL and E.
Discussion Paper
qg,"
Analyzed via Geometric Programmi
and M an
Econ.
in
Studies
No. 130, Center for Math.
Scl.tNorthwestern Univ. (1975).
EQUIL19.
A.
and V.
STOECKER,
I n U.S. Agricult ure A
1Z(2),
the Urban Traf fic
N. O. JORGENSON, "Some Aspects of
Report, Univ. of
Graduate
Prob lem, I.T.T.E.
Assignment
Calif, Berkeley (1963 ) .
Urban
EQUIL20.
D. KULASH, "A Transportation Equilibrium Model,"
(Sept.
Institute Paper 708-45, Washington, D.C.
EQUIL21.
An
and W,. PIERSKALLA,
L. J. LEBLANC, L. J. MORLOK,
and Efficient Approach to Equilibrium Traffic
Accurate
Record
Assignment on a ConJested Networks," Tran. Res.
Interactive Graphics and Transportation Systems
491J
Planning 12-33 (1974).
EQUIL22.
EQUIL23.
1971).
and
Analys Is
"An
MORLOK,
and E.
LEBLANC
J.
L.
f Ic
Traf
In
Assumptions
Behavioral
of
Comparison
on Traf fic
Symp.
Assignment," presented at the Int.
Equilibrium Methods, Montreal (November j974).
"A Column
TROTTER,
G NEMHAUSER and L.
T. LEVENTHAL
Generation Algorithm for Opt ma I Traf fic Asslgnment,"
Icaas ,IL., LZ(2), 168-176 (1 973
-24-
A Bibliography
Deterministic Network Optimization
Traffic Equilibrium
EQUIL24.
Researcth Program for
'A
B. MARTIN and M. MA HEIM,
iLhJt/
Traffic Assignment Techniques,"
Comparison of
9, 965.
Biaarc.h B g
"A Model
and an
and G. . NiEMAUSER,
the Oynamic Traffic Assignment Problem,'"
fBib9.S t
Sya, 9.13 ir
lCal c FaullibrLUm
1974).
EQUIL25.
O. K. MERCHANT
Algorithm for
ft
IrLl&
Montreal (Nov.
EQUIL26.
in
J. O. MURCHLANO, "Road Network Traffic Distribution
Equilibrium," paper for the Tagung Weber "Mathematische
Wissenschaf ten,"
Wirchaf ts
In
den
Methodan
Mathematisches
Forschungsinstitat,
Oberwolfach
(Oct.
1969).
EQUIL27.
A Unified Approach to Equilibrium Methods
S. NGUYEN,
Assignments," presented at the Int. Syrp.
for Traf ic
1974).
on Traffic Equilibrium Methods," Montreal (Nov.
EQUIL28.
S. NGUYEN, "An Algorithm
for the Traffic Assignment
GiL,
(3), 203-216 (Aug. 1974).
Problem," ILr&r
EQUIL29-
E.
L.
"'A
PETERSON,
.an SrGJL.,
Algorithm,"
Primal -Dua I
ZZ(i),
87-95
Traffic
Assl gnment
(1975).
EQUIL3O.
in
Mettods
'Analytical
C. PINNELL and G. SATTERLY,
for Arterial Street
Systems Analysis
Transportatlon:
Operations, AJ Engra. ec
PC.
.Y.L,
Ar
Ea=.& , 67-95 (963).
~l.e..q
EQUIL31.
ITcansport.LnQ
R. 8. POTTS and R. M. OLIVER, fiLEa I
bltoarCiks Academic Press, New York (1972).
EQUIL32.
E.
R.
RUITER,
"Equi librium
and
Transportation
Networks," presented at
the Int.
Symp.
on Traffic
Equilibrium Methods," Montreal (Nov. 1974).
EQUIL33.
P.
A
SAMUELSON,
Programming,"
EQUIL34.
T. TAKAYAMA
Equilibrium
(1970).
"Spatial
ALrer& EcQn
and
G.
Models,"
Price Equilibrium and
U-.,
,
283-303
Linear
(1952).
"Alternative
G. JUDGE,
ItL Gf ReaLgQDiL
S.cJWQfa,
SPacial
, 1-12
EQUIL35.
Equllibrluw and
T. TAKAYAMA and G. G JUDGE, "Spaclal
f, 510-524
. °. EIacrm s;n.
Quadratic Programming,"
(1964).
EQUIL36.
T. TAKAYAMA and A. O. WOODLAND,
Equivalence of Price
and
Quantity Formulations of Spacial EquIl Ibriuml
Purified Duality n Quadratic and Concave Programming,
LEGG
,(6),
889-906 (1970).
-25-
Deterministic Network Otimizationt A Blbiograhy
Traffic Equilibrium
EQUIL37.
H.
IGAN , "Benefit
Assessment for Network Traffic
Models and Application to Road Pricing," Road Research
Laboratories Report LT 417,
Crowthorne,
Berkshire
(1971).
EQUIL38.
M. WIGAN and T
BANFORO,
"A Perturbative Model
for
Congested and Overloaded Transportatlon Networks," Road
Research
Laboratory
Report
LR
4i.,
Crowthorne,
Berkshire (1971).
EQUIL39.
O. WILKIE an R STEFANEK,
Precise Oetermination of
Equillbrium
in
Travel
Forecasting Problems Using
Numerical Techniques," tnLttav
_aie carcFSacord
AL
1971.
EQUIL4O.
A.
WILSON,
O str ibut ion
"A
Statistical
Theory
of
Spatial
Systems," TLans.
BtsL,
253-269 (1967).
Deterministic Network Optimizationt A Bibliography
The Chinese Postman and atcling
-26-
CPPi.
n. L. BALINSKI, "Establishing the
City Univ. of New York (1969).
CPP2.
M. L
BALINSKI,
"Labelling
to
Obtain
a
Maximum
Matching,"
in
o
rminaiaLkl
athem.ti
and
Lt
AJla LiC9aaI
. (R. C. Bose and T.
A. Dowling,
Eds.),
Univ. of North Carolina Press, 585-602 (1969).
CPP3.
M. L. BALINSKI, "On Maximum Matching, Minimum Covering
and Their Connections," n e.LctelnA gl Th Prlc
Ih.n.
g
.sosiua ga Matbheatical Pr aajJlng, (H. Kuhn, Ed.).
Princeton Univ.
Press, 303-3129 (197c).
CPP4.
M. L.
ALINSKI and R. E. GOMORY, "A Primal
Method for
·
the Assignment and Transportation Problems," .an ,.
1j, 578-593 (1964).
CPP5.
R. BELLMAN and K. COOKE,
Problem Generalized," & lt
1-7 (1969).
CPP6.
E. BELTRAMI and L. BODIN,
Networks and Vehicle Routing
for Municipal Waste Collectlon,"
jetw.orh,
_k 65-94
(1974).
CPP7.
C. BERGE,
Asag. I;j.
CPP8.
N. CHRISTOFIOES
"The Optlmum Transversal of a
.QMA, 1(6), 719-734 (1973).
CPP9.
Polytopes and a Hierarchy of
"Edmonds
V. CHVATAL,
Combinat or ia I Problems,"
LS CjtJ.Math.
A, 305-337
"The
Matching
Polytope,"
Konigsberg Bridges
LnalsIs
ADc.
apac 2.5(1),
D
"Tno Theorems in Graph Theory,"
U,.-I,
~, 842-844 (1957).
Proc.
A.L
Graph,"
(1973).
CPP1O.
'A
Graph-Theoretic
HAKIMHI,
J. F. DESLER and S. L.
Approach
to a Class of Integer Programming Problems,"
Qpns. .B.-, 1017-1033 (1969).
CPPll.
0. DE WERRA, "On Some Combinatorlal Problems Arising In
Scheduling,"
w, 8,A 165-175 (1970).
CPP12.
J.
i
EDMONDS, "Maximum
Vertices," Is BAe..
CPP13.
J.
1-
EDMONDS, "Paths,
449-467 (1965).
CPPj4.
J. EDMONDS, "An
Lecture Notes,
Matching and a Polyhedron with
L869B, 125-130 (1965).
Trees,
and Flowers,"
LanL
O0
atI.-,
Introduction to Matching, "Mlmeographed
Engineering Summer Conference, Univ. of
-27-
Deteralnistic Network Optlmizaton: A Bibliography
The Chinese Postman and Matching
Michigan,
Ann Arbor (1967).
CPP15.
J. EOMONOS,
Some Well-Solved Problems n Combinatorlal
Optlimzation," in CobtnatrCiaL
eo oraBJlll2n
H
gtSh
aJ Aollcatilons
(8. Roy, Ed.),
. Reldel Publ. Co.,
Dordrecht-Hol land, 285-301 (1975) .
CPP16.
J. EDMONOS,
U3
Suppl.,
"The
1 p.
Chinese Postman Problem,"
Ba.
Qons.
373 (1965).
CPP17.
J. EDMONOS and O. R. FULKERSON,
I C
i- *· 9 i P. 299, (1970).
CPP18.
J. EDMONDS and E. L. JOHNSON, "Matching
A Well-Solved
Class of Integer Programs," n Combinatorlal Structures
and their Applications, Gordon and Beach, N.Y., 89-92,
(1970).
CPP19.
J. EDHONOS and E. L. JOHNSO,9 "atching,
Euler
and the Chinese Postman,"
ath& EGrog. t
,
( 1973).
CPPzO.
J. EDMONDS, E. L. JOHNSON, and S. LOCKHART, "Blosso
A Code for Hatching," unpublished report,
IBM
T.
Watson Res. Center Yorktown Heights, N.Y. (1969).
CPP21.
J. EDHONDS and W. PULLEYBLANK,
Johns Hopkins, (to appear).
CPP22.
L.
EULER,
"The
Konigsberg
AeClcan, 66-70 (1953).
CPP23.
O. R. FULKERSON,
I.
GLICKSBERG,
and O. GROSS,
"A
Production Line Assignment Problem," The RAND Corp.,
RM-1102 (May 1973).
CPP24.
H. GABOWI,
An EfficLent
Impl ementation of Edmonds'
Algorithm for Maxlmum Matching on Graphs," JC,1,
23(2)
221-234 ( 1976).
CPPz25
F. GLOVER,
Finaing an Optlmal Edge-Covering Tour of
a
Connectea Graph," Tech. Report OC 67-13, Opers. Res.
Center, Univ. of Callf. at Berkeley, (1967).
CPP26.
F. GLOVER, "Maxlmum
Matching
Graph," 11aM.L
its Lo.. Q.* 1/
CPP27.
S. GOODMHAN and
Graphs," jSIJA
6L
CPP28.
S.
in
S.
&Ao
"Bottleneck
Qat2iU
ditilchloL
Br idges ,"
in a Convex
31L3-316(1967).
Extremra"
Tours,
88-124
Ihba.Cry
1ffi11u
Bipart ite
HEDETNIEMI,
'Eul erian Wal ks
. tAl,.v i.L 16-27 (1973).
GOOOMAh
S. HEDETRICMI,
Trees," IA
U Comut
It
J.
In
and R. TARJAN,
"b-Matchings
1(1)9 iO 4-108 (1976).
-28-
Deterministic Network Optimization
A Bibliography
The Chinese Postman and Matching
CPPZ9.
A
GORDON,
"The
Max lum latching Problem B. E.
the Edmonds and 3allnski Algorithms,"
Comparison of
of Rochester (1971).
Grad. School ot anagement, Univo
CPP30.
An
Bottleneck Assignment Problemt
"The
O.
GROSS,
Algorithin'" er_2ajjtd
~
Ba
[
uIa2I2sluI 92D altb1hemt.cal
erocarmiLa,
Rand Publication -35i1
(P. Wolfe. Ed.),
87-88 (1960) .
CPP3,.
M.
HALL
JR·.,
Representatives,"
(1956).
CPP32.
'A
n*(5/2)
Algorithm
J. E. HOPCROFT and R. M. KARP,
for
axlmum Matchings n Bipartite Graphs," Conflernce
gba
_g ]L
IMdL/iI
Annal 5L
yX.sA
on
.Ld
SLt.na
jAisoaaa Ihgrv. IEEE Computer Society, N.Y. (1971).
CPP33.
E.
L. JOHNSON,
"Networks,
Graphs,
and
Integer
Programming,"
Tech.
Report ORC 65-i, Opers.
Res.
Center, Univ. of Calif., Berkeley (1965).
CPP34.
Y.
R. KARP and S.
Assignment Problemt"
(1975).
An
aN.
Algorithm
for
Mlth, tjnj.lQ.,
6U
LI,
'"Two
;
LicrS
Distinct
716-717
Cases of the
Special
atliTh . ,
(2), 129-142
CPP35.
"Variants of the Hungarian Method for
H. W. KUHNt
Assignment Problems," aas. B.. LQA G.v 3, PP. 253-258
(1956).
CPP36.
H. W. KUHN, "The Hungarian Method
for the
Problems, Nav
sj L
Q.L 2?9 83-97 (1955).
CPP37.
M. K. KWAN, "Graphic
Programming
Using Odd or
Points" GhiLaqs/
athegmtic,
J.t 273-277 (1962).
CPP38.
T.
LEIBLING,
IgqQu naonjg.
Man ,
and Mathematical
(1970) .
.Graihen
Lecture
Systems,
Assignment
Even
iD
Pelann Inasiu
theora
Notes In Operations Research
2i9 Springer-Verlag,
Berlin,
CPP39.
D. MARKS and R. STRICKER, "Routing for Public Service
Vehicles," ASCE I.
li Urban EJaLning a
DeILo1ment
ling,
j65-J78 (1971)·
CPP40.
DO R. HORRISON,
&L
CPP41.
20-32
"Matching Algorithms," ,
Cb,
jhQrl,
(1969).
K. MURTY, "he
Symmetric
Report ORC 67-12, Opers.
at Berkeley (1967).
Assignment Problem,"
Tech.
Res. Center, Univ. of Calif.
-29-
Deterministic Network Optimization: A Blbliography
The Chinese Postman and Matching
'An
Algorithm
S
for a
q1. 9
CPP42
R. Z. NORMAN and M. O. RABIN,
Minimum Cover of a Graph," Proc.
315-319 (1959).
CPP43.
C. ORLOFF, "A Fundamental Problem in
L1tworksg i., 35-64 (1974).
CPP44.
M. PADBERG, "Simple Zero-One Problemsl
Matching ana Coverings n Graphs," Man.
ellon Univ. (J971).
No. 235, Carnegie-
CPP45.
D. PAUL,
an
of
Alabama
CPP46.
"The Faces of Matching
W, PULLEYELANK,
Ph.D. Thesis, Univ. of Waterloo (1974).
CPP47.
The
ehicle Routings
Sector
'Public
STRICKER,
R.
Deot. of
Masters Thesis,
Chinese Postman Problem,"
Elect. Eng. MIT (1970).
CPP48.
W. T. TUTTE,
LGndandal
CPP49.
W. T. TUTTE, "The Factors of Graphs,"
315-318 (1952).
CPP50.
W. T. TUTTE, "A Short Proof of the Factor Theorem
,i 347-352 (1954).
& : afh,
Finite GraphS," ul:
CPP51.
R. J. URQUHART,
Graphs," Ph.D.
CPP52.
"A Parametric Study of
L. J. WHITE,
Ph.D.
Weighted Graphs,"
Coverings in
Univ. of Michigan (1967).
CPP53.
"Modification
JR.,
ZAHN,
C. WITZGALL and C. T.
Algorithm for Maximum atching of Graphs,"
Edmonds'
fB
bWiL,
698, 91-98 (1965).
Aac iatl
Routing,'
Vehicle
Set Covering,
Scl. Res. Rep.
"A Heuristic Algorithm for Effective Coverage
University of
Thesis,
Arbitrary Network,"
n Huntsville (1974).
"The Factorization of Linear
,107-111,(1947).
Sl.
*Q ,
Polyhedra,"
Graphs,"
Jl
Ja
MA[k.
ath.,
for
"Degree Constrained Subgraphs of Linear
Dissertation, Univ. of Michigan (1967).
Matchings and
Oissertati or,
of
1,.
-30-
Determlnlstic Network Optimizationt A Bibliography
Travelling Salesman Problems and
Extensions (Vehicle Routing)
TSPI.
"A Heuristic
VEGA9 and R. PARKER,
J.
ASHOUR,
S.
Algorlthm for the Travel lng Salesman Problems" Ira.
187-j95 (1972).
.,
BaS.,
TSP2.
for
On an Integer Program
H. BALINSKI, and R. QUANOT,
(1964).
300-3C4
12(2),
Rs.L
Oons
a Oelivery Problems"
TSP3.
L.
BARACHET,
"Graphic
Salesman Problem," QgJn
Solution
BJ.,
(6)
of
Travel ing
the
841-845 (1957).
"The
PEi.L
TSP4.
HAMMERSLEY,
and J.
HALTON,
J.
BEAROWOOD,
J.
Shortest Path Through Many Points," Proc& Qasb,
Uaa, 11, 299 (1959).
TSP5.
D. BELL, ""The Resolution of Ouality Gaps
Report No. 81, Opers.
Tech.
Optimization
M.I.T. (Aug. 1973).
TSP6.
the
Treatment of
Programming
"Oynamic
R. BELLMAN,
JA.tj 9(1), 61-63 (1962).
Traveling Salesman Problemr"
TSP7.
S.
and
BELLMORE
H.
Problem
Multisalesmen
Salesman Problem," AGlI,
TSP8.
of
"Pathology
MALONE,
J.
and
BELLMORE
M.
Algorithns,"
Subtour-Elimination
Traveling-Salesman
278-307 (1971 .
(2),
BUa-,
Q2aDi
TSP9.
M. BELLMORE and G. NEMHAUSER,
A Survey," QP2J
Problems
(1968).
Oiscrete
in
Res. Center,
of
"Transformatlor
HONG9
the Standard Traveling
to
~j, (3), 500-504 (1974).
"The
Ba.
Traveling
fi(3)
9
Salesman
538-558
TSP1O.
E. BELTRAMI and L. BOOIN, "Networks and Vehicle Routing
65-94
4(1),
aste Collection," ItGCorksI,
for Municipal
(1974)
TSP11.
B. BENNETT,
Computer,"
and O. GAZIS,
TCransoortato
Bus Routing by
"School
317-325
&Pgj
g ,f 6(4),
(1972).
TSP12.
to
"A Heuristic Approach
BRADFORD,
W. BILES and J.
Constra int s ,"
OJ e-Date
with
Scheduling
Vehicle
Chicago,
Presented at the 1975 ORSA/TI S Meeting,
Illinois.
TSP13.
L.
"A Taxonomic Structure for Vehicle Routing
S.,
1'i
Qa3BIAL anJg IQa
Problems,"
and
Schedul lng
11-29 1975) .
BODIN,
-31-
A Bibliography
Oeterministic Network Optimization
Travelling Salesman Problems and
Extensions (Vehicle Routing)
TSPI4.
P. CAMERINI, L. FRATTA, and F HAFFIOLI, "The Travel ing
Salesman
Probl emr
Heuristical Iy Guided Search and
Modified Gradient Techniques," (n press).
TSP15.
A Multi-depot
P. CASSIDOY and H. BENNETT,
"TRAMP
Q..CA1ai.
Reasearh
Vehicle
Scheduling
System,"
Qul,
&J.frX9 (2), 151-163 (1972).
TSPJ6.
N.
Shortest Haml Itonian Chain
"The
CHRISTOFIDES,
of
a
.ath.
19,
689-696
TSP17.
N. CHRISTOFIDES9 "Bounds for the Travelling
,
1044-1056 (1972).
Problem Q2a. .BlS.,
Sa I es man
TSP18.
NATO
N. CHRISTOFIDES, "The Vehicle Rout ing Probl em,"
Conference on Combinatorial Optimization, Paris, (Sept.
Graph,"
iAL&t
D Annl.
journal
(1970).
1974).
TSP19.
and
the
Circul ts
N. CHRISTOFIOES9,
Hamil t onlan
A
Survey,'
in
Prob I es
Trave ling
Salesman
PCQorgammaia2
Qa.mblnatrcral
ed.), O. Reldl Publ.
(B.
Roy,
o. , Dordrecht, Holland
(1975).
TSP20.
Algorithm for
the
N. CHRISTOFIDES, and S. EILON, "An
Qer
nal
Dispatching Problem,"
Vehicle
Bfsta'cU
309 (1969).
Qsartely., Z
TSP21.
Algorithms for
N. CHRISTOFIOES. and S. EILON,
QluIartiCe.1/
Scale TSP's," 22eratjnal Re3a&.
Large
, .
511 (1972).
TSP22.
G.
CLARKE
and J.
WRIGHT,
"Scheduling
Central Depot to a Number of
568-581 (1964).
B91
* 1,9(4
TSP23.
G. CROESt "A
Problems,"
Method
for
O.nsa Bsi&,
L
(8),
of
Del ivery
Solving
Vehicles from a
Polnts,"
.g~t,,,,
Traveling
Salesman
791-812 (1958).
TSP24.
G. OANTZIG, O. FULKERSON, and S. JOHNSON, "Solution
of
a Large-Scale Travel ng Salesman Problem94,"
s. UBt1,
j(4), 393-410 ( 1954).
TSP25.
G. OANTZIG,
. FULKERSON, and S. JOHNSON, "On a Linear
Programming,
Combinatorial
Approach to the Travell ng
B,
Z7(1) , 58-66 (1959).
Salesman Problem," Qon.
TSP26 *
G. OANTZIG and J.
Problem," lan. VJ.,
" rhe
RAMSER,
a, 81-91 (1959).
Truck
01DsPatching
-32-
Deterministic Network Optimization A Bibliography
Travelling Salesman Problems and
Extensions (Vehicle Routing)
TSP27.
C. DERMAN and M. KLEIN, "Surveillance of Multicomponent
Systemst
A Stochastic Traveling Salesman's Problem,'
lay. Bt
,ai,
2A.
3.,
O03-.12 (966).
TSP28.
H.
EASTMAN,
"Linear
Programrmng
with
Pattern
Constraints," Ph.D. Thesis, Harvard University (1958).
TSP29.
S.
EILON,
C.
i.c.sltji.nl
WATSON-GANDY,
and
N.
CHRISTOFIOES,
t0naeejTj, Griffin. London (1971).
TSP30.
L. FEW,
"The
Shortest Path and the Shortest
Through N Points,"
athea.a.ita 2, 141-144 (1955).
TSP31.
M. FLOOD,
4(1),
"The Traveling Salesman Problem,"
61-75 (1956).
Qa.
Road
B.S.L
TSP32.
H.
GABBAY,
"An Overview of
Vehicular
Problems,"
Technical
Report
No.
103.
Research Center, MI.T. (Sept. 1974).
TSP33.
R. GARFINKEL, "On Partitioning the Feasible Set in
a
the
Asymmetric
Algorithm
for
Branch-and-Bound
Traveling-Salesman Problem," Qt)!,&L Rt.,
2(1),
340-342
(1973).
TSP34*
. GARVIN, H.
CRANDALL,
J.
JOAN,
and R.
in
of
Linear
Programming
"Applications
Industry," an, US;.
3(4), 407-430 (1957).
TSP35.
T.
GASKELL,
"Bases
QQeatonal BjtSaacb
for
Scheduling
Operatlons
SPELLMAN,
the Oil
Vehicle Fleet Scheduling,"
iLB,P. 281 (1967).
2uartlacL
TSP36.
B. GILLETT, and J. JOHNSON,
Sweep Algorithm
for the
Multiple Depot Vehicle Dispatch Problem," presented at
the ORSA/TIMS meeting San Juan,
Puerto Rico
(Oct.
1974).
TSP37.
B. GILLETT and L. MILLER, "A Heuristic
the Vehicle Dispatch Problem," Q2js Bj.
(1974).
TSP38.
P. GILMORE and R. GOMORY,
"Sequencing
a One-State
Variable Machine I A Solvable Case of the Traveling
Salesman Problem," Ons. .t,·,
12j, 655-679 (1964).
TSP39.
B. GOLDEN, "Vehicle Routing Problemst Formulations and
Heuristic Solution Techniques," Tech. Report No. 113,
Opers. Res. Center, M.I.T. (Aug. 1975).
TSP40.
8. GOLDEN,
"A Statistical Approach
to
Algorithm for
, 2
340-349
the
Travel I ng
-33-
Deterministic Network Optimization A Bibliography
Travelling Salesman Problems and
Extensions (Vehicle Routlng)
Salesman Problem,," Working Paper R-052-76,
Research Center, M.I.T. (April 1976).
Operations
TSP4I.
Impl ement ng
B. GOLDEN9 T. MAGNANTI, and H. NGUYEN9,
Report No. 115,
ech.
Vehicle Routing Algorithms,'
1975).
Opers. Res. Center, M.I.T. (Sept.
TSP42.
W. HAROGRAVE and G. NENtAUSER, "On the Relation Between
the Traveling Salesman and the Longest Path Problem,"
Qnnsl. fS.· .J(5)9 647-657(1962).
TSP43.
of the
"Improvements
K. HALBIG HANSEN and J. KRARUP,
Travelling
for the Symmetric
Algorithm
Held-Karp
Salesman Problem," Math.. ECr.L9 Z. 87 (1974).
TSP44.
M. HELD and R. KARP, "A Dynamic ro gramming Approach to
,l. 196-210 (1962).
Sequencing Problems," SIAM QJaunaI
TSP45.
M. HELD and R. KARPt "The Travell ing Salesman
s.
"Qa
Spanning Trees,
Minimum
and
1138-1162
TSP46.
Problem
±.(6),
(1970).
H. HELD and R. KARP, "The Travelling Salesman Problem
QL.go, 1,
l.JthL
Minimum Spanning Treest Part II,"
and
6-25 (1971).
"Validation of
,62-88 (1974).
TSP47.
H, HELD and P. WOLFE, and H. CROWDER,
Subgradlent Optimization," Math EP g.·
TSP48.
Scheduling
Vehicle
A
R. HOLHES and R. PARKER,
So lut ion
a
and
Savings
Upon
Based
Procedure
.I,
Z1(i),t
*seac._
DteratioaL
Scheme,"
Perturbation
83-92 (19 76) .
TSP49.
Models
J. HUDSON, O. GROSSMAN, and . MIRKS9 "Analysis
Engineering
Civil
MIT
for Solid Waste Collection,'"
Report No. R73-47 (Sept. 1973).
TSP50.
"A teuristic Approach
L. KARG and G. THOMPSON,
Travel ing Salesman Problems," inML SI.,
Solving
225-248 (1964).
TSP51.
P. KROLAK, . FELTS9 and G. MARBLE, "A Man-Machine
Salesman
Traveling
the
Solving
Toward
Approach
Problem,"
TSP52.
.
, 111,
to
Q{,
327-334 (1971).
"A Man-Machine
NELSON,
and J.
P. KROLAK, W. FELTS
Generalized
the
Solving
Toward
Approach
149-170
(2),
Truck-Dispatching Problem," ICan.L iScL..L
( 1972).
-34-
TSP53.
eterministic Network Optlmizatlonl A Bibliography
Travelling Salesman Problems and
Extensions (Vehicle Routing)
a
"On the Shortest Spanning Subtree of
the Traveling Salesman Problem," eP.o.L MU,
J. KRUSKAL,
Graph and
1
48-50
(956).
Salesman
"A Solvable Case of the Traveling
ilbAfrCQL, £, 267 (1971).
TSP54.
E. LAWLER,
Problem,"
TSP55.
J. LENSTRA and
of
Applications
Res
aair
QICr.aIZnal
TSP56.
S.
TSP57.
Effective Heuristic
"An
S. LIN and B. KERNIGHAN,
Algorithm for the Travel ng Salesman Problem," 22an&S
Zi. 498-516 (1973).
Balt.
TSP58.
J. 0. C. LITTLE, K. MURTY, 0. SWEENEY, and C. KAREL,
"An Algorithm for the Traveling Sa lesman Problem,"
QQ ats , 11(6), 972-989 (1963).
TSP59.
ZEHLIN,
R.
C. HILLER, A. TUCKER, and
Traveling
of
Formulation
Programming
Problems," [ACM, 7, 326-329 ( 1960 ) .
TSP60.
NEWTON,
R.
Multi-School
Simple
"*'Some
KAN,
RINNOOY
Travell ing Salesman Prob I e m ,"
(4), 717-733 (1975).
9..*
A.
the
"Computer Solutions of the TSP,"
2245-2269 (1975).
laSbnhicl Jo.rn.aUI . 4
LIN,
B&saarcb13
and
1.(2 ),
'Bus
H. THOMAS,
IAgLuters
System,"
213-222 (1974).
fJ.L l
"Integer
Sa Iesman
Routing
anne
ys&ta5
a
In
QQnera
Q£a
TSP61.
Vehicl e Routing Prob lems,"
"Mul ti-Oepot
H. NGUYEN,
anagement, MIT (1975).
Masters Thesis, Sloan School of
TSP62.
and
Manipulatlon
"Spanning Tree
A. OBRUCA,
rosuter j.rcnal,
Travelling salesman Problem," T.
374-377 (1968).
TSP63.
A Fundamental Problem
C. ORLOFF,
itwgrks 4t(1), 35-64 (1974).
TSP64.
C. ORLOFF "'Routing A Fleet of M. Vehicles to/from
(2 , 147-162 (1974).
Central Facility," NewoGrk,
TSP65.
C. ORLOFF and D. CAPRERA, "Reduct ion and Solutl on of
Large Scale Vehicle Routing Problems," Tech. Report
(July
75/TR-7, Transportation Program, Princeton Univ.
1975).
TSP66.
for Shortest
Bibl iography on Algorithms
A. PIERCE,
Spanning Tree, and Related Circuit
Shortest
Path,
1 29-150
(2)9
Routing Problems (1956-1974).'* Uitiorkg
n Vehicle
the
IJ,
Routing,"
a
-35-
Deterministic Network Optlization A Bbllography
Travelling Salesman Problems and
Extensions (Vehicle Routing)
(1975).
TSP67.
J.
PIERCE,
"Direct
Search
Algorithms
Truck-Dispatching Problems,
Part I,"
.a
UR3S.
1-42 (1969).
TSP68.
T. RAYMOND,
"Heuristic
Algorithm for the Traveling
Salesman Problem," IM Lgrra
2Q L Q
n Da.,t
la
"3(4),
400-407 (1969).
TSP69.
S. REITER and G. SHERMAN, "Discrete
AurDnal,
j, 864-889 (1965).
TSP70.
J. ROBBINS,
J.
SHAMBLIN,
W.
URNER,
and B. BYRD,
'Development
of and Computational
Experience with a
Combination
Tour
Construction-Tour
Improvement
Algorithm for Vehicle Routing Problems," Presented at
the 1975 ORSA/TIMS Meeting, Las Vegas, Nevada.
TSP71.
S. ROBERTS and B. FLORES,
the Traveling Salesman
269-288 (1966) .
TSP?2.
"Approximate
DO ROSENKRANTZ, R. STEARNS, and P. LEWIS,
Algorithms
for the Traveling Salesperson Problem,"
Eoca
a1
S g1 1n tht
&fiaL £IEEE 5ysxa2rLu ln
,Ltchlg
Mn Atoa.ata IJqearX
33-42 (1974).
TSP73.
R. RUSSELL, "An
Effective Heuristic
for the M-Tour
Traveling Salesman Problem with Some Side Conditions,"
Presented at the 1975 ORSA/TIMS Meeting,
Las Vegas,
Nevada.
TSP74.
O. SHAPIRO, "Algorithms for the Solution of the Optimal
Cost
Travelling
Salesman Problem,"
Sc.D. Thesis,
Washington University, St. Louis (1966).
TSP75.
J. SVESTKA and V. HUCKFELDT, "Computational
Experience
with an M-Salesmen Traveling salesman Algorithm," fJaD&
S,.. ,
19(T), 790-799 (1973).
TSP76.
F. TILLMAN and T. CAIN, "An
Upper Bounding Algorithm
for the Single and Multiple Terminal Delivery Problem,"
Jatnl
S&j.L, i.A(1L, 664-682 (1972)
TSP77.
W. TURNER, P. GHARE,
and L. FOUROS,
"Transportation
Routing ProblemA Survey, " ALIE IanAtian,
(4),
288-301 (974).
TSP78.
Mn TYAGI, "A Practical Method for the Truck Dispatching
Problem," Jo.nal
Jtt QQgMcs- Be&
/g
".sl.X
of J1Lh=A
for
3,
Optimizing,'" SA
"An Engineering
Problems,"
na
Approach
to
ScL
1.3(3),
-36-
Oeterministic Network Optimization: A Bibliography
Travelling Salesman Problems and
Extensions (Vehicle Routing)
J9, 76-92 (1968).
TSP79.
n.
EBB,
Relative Performance
of Some Sequential
Methods
of
P lanning Mu It iple
Delivery Journeys, "
QEeratonal R.eearch 2r9 21(3), 361-372 (1972).
TSP8O.
P. WEINER, S.
SAVAGE,
and A. BAGCHI,
"Neighborhood
Search
Algorithms
for
Findl ng Optimal
Travel ing
Salesman Tours Must be Ineffticlent,
_b
IiAC
Prac.,
207-213 (1973).
TSP8 .
Jo WIORKOWSKI
and K. MCELVAIN "
A Rapid Heuristic
Algorithm for the Approximate Solution of the Traveling
Salesman Problem," Icans
Ba-n9 3 181-185 (1975).
TSP82.
A. WREN and A. HOLLIDAY,
"Computer
Scheduling of
Vehicles
from One or More Oepo ts to a Number of
Oelivery Points," Qera.ltiQaal Rai.
t a.
i2
333- 344
(1972)
TSP83.
W. SZWARC,
The Truck Assignment
Luag 2G
t 529-557 (67).
TSP84.
S. VERBLUNSKY, "On the Shortest Path through a Number
of Points," Pgcoceeainas
.t Iba &h
aiCgn
athematlcal
A.QtI.9 2(6) (Oec. 1951) .
TSP85.
P. YELLOW9 "A Computational
odification to the Savings
Method of Vehicle Scheduling,"
QrjajlGa
&A.USL.Cg
.Q
X9artt
.ti. ?
p. 281 (1970).
Problem,'" UNaL
Ras
-37-
Deterministic Network Optimization
A Bibliography
Minimal Spanning Trees and Variants
MSTj.
Go BARON and W. MRICH,
On
Spanning Trees,"
g f4m"L.
MST2.
J.
BENTLEY
and J.
FRIEDMAN,
"Fast
Algorithms
for
Constructing
Minimal Spanning Trees In Coordinate
Spaces," submitted to EEE lan
Qan Qgm.
MST3.
N. BLACK,
the Maximal
Distance of
)gJI~y,
, 378-385 (1968).
"A Note on the Geometry
rGiSra&QhbiAL Aaljxi
of
Minimal
Trees,"
2_ 4-414 (970)
MST4.
F. BOCK, "An Algorithm to Construct a Minimum Directed
Spanning Tree in a Directed Network,"
vj
eloomanS l.
QeratiQo
BtLsearch
(B. Avl-tzak,
ed.),
Gordon and
Breach, 29-44 (1971).
MST5.
K. CHANDY ano T. LO, "The CapacLtated Mlnimum Spanning
Tree," "Latworks (2), 173-182 (973).
MST6.
N. CHOU and A. KERSHENBAUM, "A Unified Algorithm
for
Oesigning Multidrop Teleprocessing Networks" EgS. Qi.
QJaa.
CllaL /.
(Nov· 1973) .
NST7.
E. DIJKSTRA,
Graphs lU..l
HST8.
S. OREYFUS and R.
Graphs," etwaocS
MST9.
J. EDMONDS, "Optimum Branchings,"'
233-240 (1967).
"A Note on Two Problems in Connection with
atheaatikhs j, 269-271 (1959).
WAGNER,
"The
Stelner
1(3). 194-207 (97j).
ase.
Probl em
g
In
Z._,
MST10.
L. ESAU and K.
WILLIAMS,
"On
Design,
Part
II",
L
SAi.
S
(1966)
MST11.
F. GLOVER and DO KLINGHMAN,
"Fnding
Mlnimum Spanning
Trees with a Fixed Number of Links at a Node," In
Qld~!gat.QCJldl __gPcAars
Ma
e t n i.SJ a t
Ao
pl I tlsi
(B.
Roy, Ed.),
. Reidel Publ. Co., Dordrecht-Holland,
191-201 (1975).
HST12.
F. GLOVER and . KLINGMAN,
"Milnmum
Order-Constralned
One-Trees and the Travel ing Salesman Problem,
(to
appear).
MST13.
J. GOWER and G6.
ROSS,
"Hlnimum
Spanning Trees and
Single Linkage Cluster Analysis," A.1ZJL
SAatL§.QLi
iA(i), 54-64(1969).
MSTl4.
S.
HAKIMI,
"Steiners
Problem
Teleprocessing System
J1Q
Lau.
5(3),
±42-147
In
Graphs
and
its
-38-
Deterministic Network Optimization: A Bibliography
Minimal Spanning Trees and Variants
Bet[orst
ImplicationssI"
&(2) 13-133 (1971)e
Problem
j.(116),
MST15.
M. HELD and R. KARP, "The Travelling Salesman
B&s
n
jl.
Min imum Spanning Trees,"
and
1138-1162 (1970).
MST16.
The Travelling Saleman Problem
M. HELD and R. KARP,
r
" aitht. Proa.t
Treess Part II
Spanning
and Minimum
6-25 (1971).
NSTI7.
W. HOFFMHA
the N-th
( 1959).
MSTl8.
T. C HU, "The Maximum Capacity Route
898-900 (1961).
BA.,
MST19.
T C HU, "Optimum Communication Spanning Trees,
J.&. C;amoutiag, (3)9 188-195 (1974).
HST20.
R. KARP, "A Simple Derivation of Edmond's Algorithm for
Optimum Branchings,·" .tfaCkMl 1,* 265-272 (971).
MST21.
A. KERSHENBAUM, "Computing Capacitated Minimal Spanning
Trees Efficientl y,'" Ntworar .(4)9 299-310 (1974).
MST22.
Mlnlmum
"Computing
VAN SLYKE,
A. KERSHENBAUH and R.
1972
.Poeedinas,
&I.ZZ
Spanning Trees Efficiently,"
Computing
for
the Association
Annual Conference of
Machinery, 518-527 (1972).
MST23.
a
J. KRUSKAL, "On the Shortest Spanning Subtree of
Graph and the Travelling Salesman Problem," PrEreedn s
48-50 (1956).
QJtZ,
S.L
ti..
liericA
atha
.t jta &a
MST24.
"Historical
J. HURCHLANO,
Arboresscences," lit.wQrks
MST25.
and
Manipulation
Spanning Tree
OBRUCA,
A.
Travelling Salesman Problem," LA QI2uter ar.gcnalt
374-377 (1968).
MST26.
on Ago lthms for Shortest
A. PIERCE, "Blbliography
and Related Circuit
Spanning Tree,
Path, Shortest
129-150
tt1Gork_, 5.(2),
Routing Problems (1956-1974)."
(1975).
MST27.
and
Network
Shortest Connection
R. PRIM9,
,
ical l rnal.
IG
stietSa
Generali zatons," Bell
1389-1401 (957).
MST28.
J. ROGER,
and R. PAVLEY, "A Method for the Solution of
506-514
L.Qt b(4)
Best Path Prob lemt"
Probleme"
Note on Optimum
39 287-288 (1973).
"Updating a Minimum Spanning Tree,"
Qon.
"
Uj
Spanning
L.
the
l,
Some
BQ1L
-39-
Oeterministic Network Optimizatont A Bbliography
Minimal Spanning Trees and Variants
sta
(1971).
a.
*
ScL AllWag
SaQti,2l).
?..04(2),
204-206
MST29.
P. SPIRA and A. PAN, "On Fnding and Updating Spanning
t( 3 ),
and Shortest Paths," SILUA L 4mauiuDa,
Trees,
375-380 (1975).
MST30.
SUURBALLE, "lMnimal
J.
Dual Simplex Method,"
MST31.
in
G. SWEN, "Development of the Spanning Tree Concept
Graph Theory with Applications to the Shortest Route
Pi ttsburgh
University of
Thesis,
Ph.O.
Problem,"
( 1967)
NST32.
Y. YANG and O. WING9 "Suboptlmal Algorithm for a
JIJLF fTr.I,L-9 508 (1972).
Routing Probltem"
MST33.
for Finding
Algorithm
A. YA,0 "An O((E) loglog (V))
Spanning Trees," unnumbered Universlty of
Mlnimal
Illinois Report (Oec. 1974).
MST34.
C. ZAHN, "Graph-Theoretical Methods for Oetect ing and
ITrajan.atLoS gD
Describing Gestal t CI usters," 1LE
(1971).
Zl 1 68-86
QEqper,2
Spanning Tree Algorithms
P.ro.a., (to appear).
The
tA
Wire
A Bibliography
Deterministic Network Optimization
Location of Facilities on a Network
-40-
LOCI.
R. BALLOU,
Locating Warehouses in a Logistics System,"
iq 23-40 (1968).
Iba LoalstLcs Bdi3JkA
LOC2.
W. BAUMOL and P. WOLFE,
BjJ&s
i,
252-263
"A
Warehouse
"onU3s
Problem,
(1958).
LOC3.
R. BELLMAN 'An Application of Oynamic Programming to
7(1±)
B M evlew.
Allocation Problems,
Location:26-128 (1965).
LOC4.
W, ROWN "A 6enerelized Plant Location Problem," Ph.O.
Thesis, Department of Operations Resarch, Case Western
Reserve University (Jan. 1973).
LOC5.
N. CHRISTOFIOES and P. VIOLA,
Multi-Center on a Graph,"
145-154 (1971).
"The
Optimum Location of
uart.e 229
Re
nQaL.
LOC6.
A. CHAN and R. FRANCIS, "A Round-Trip Location Problem
j3J(1). 35-51 (1976).
on a Tree Graph," Trans, 5ji.L
LOC7.
J. COHEN, "Survey on the Warehouse Location Problem,"
Working Paper OR 022-73, Sloan School of anagement,
(1973).
M.I.T.
LOC8.
R. CONWAY and N. MAXWELL,
.
Faci lity Locat ion"
(1961).
LOC9.
L.
"A Note on the Assignment of
f.jD. - s jZ 34-36
. Idla.i
Location-Allocation Problems," O ns
COOPER,
U'9 331-343 (1963).
Reset
LOC1O.
for Location-Allocation
Heuristic Methods
L. COOPER,
(964).
37-53
.
s
Problems," SIA Rlviej
LOChl.
"An
and G. NEMHAUSER,
H. FISHER,
G. CORNVEJOLS,
the
for
Relaxations
and
Heuristics
of
Analysis
No.
Report
Technical
Problems"
Uncapacitated Location
of Operations Research, Cornell University
Dept.
27t
(August 1975).
LOC12.
CURRY
G6.
Algorithm
E
.1sL 1
and
for
Programming
Dynamic
"A
R. SKEITH,
Facility Location and Allocation," AIIE
133-138
(1969).
LOC13.
P. S. DAVIS and T L. RAY A Branch-Bound Algorithm for
the Capacitated Facilities Location Problem," LLay BEsaL
LQS Q-· 1(3)· 331-344 (1969).
LOC14.
P
M. DEARING and R. L. FRANCIS,
"A
Mniax
Location
-41-
A Bbliography
Deteralnistic Network Optimization
Location of Facilities on a Network
Problem on a Network," Tech. Report No.
Opers. Res., Cornell Univ. (1973) .
198,
Oept of
P-Medians Problemt
Management Science
LOCi5.
for the
Algorithm
G. DIEHR, "An
Working Paper No.
191, Western
Institute, UCLA (June 1972).
LOC16.
S. E. DREYFUS and R. A. WAGNER,
The Steiner Problem in
Graphs"' Netgaio
, 19 195-207 (1972.
LOC17.
n. A,
EFFROYMSON and T.
L.
RAY,
"A Branch-Bound
Algorithm for Plant Location" QS., &eZ.,
/,1 361-368
( 1966)
LOCi8.
Solving Fixed Charge
GRAY9,
ELLWEIN and P.
L. 8.
and
with
Capacity
Problems
Location-Allocation
Configuration Constraints," AIIE I ._ . J(4),
290-298
( 971 ).
LOC19.
A. N. ELSHAFEI and K. N. HALEY,
"Facilities Locatlons
Some Formulations,
Methods of Solution, Applications
and Computational Experlence," OR Report No. 91., North
Carolina State Unlv. of Raleigh (1974).
LOC20.
A. M. EL-SHAIEB, "A New Algorithm for Locating Sources
Among Oestinations"
n .5& .L.'
Zt 221-231 (1973).
LOC21i
D. G. ELSON,
Programming, "
"Site
.g
Onal. Besl
Location
qUacLt,
Via
2.3(1)
Mixed-Integer
31-43 (1972).
LOC22.
E. FELOMAN, F. LEHRER, and T. RAY, "Warehouse
Location
under Continuous Economies of Scale,"
an, Sl.9
Z
670-684 (1966).
LOC23.
"Some
R. FRANCIS9
Problem," 20nsw ma.S
LOC24.
R. L. FRANCIS and J. M. GOLDSTEIN,
Selective
B bliography,"
I
RDQns
(1974)
LOC25.
R. L. FRANCIS and J.
A.
WHITE9
Eacl i
L..Gca.QonL
JLlc
an
a
J
An
ai.r
Englewood Cliffs, N.J.
(1974).
LOC26.
LOC27.
Aspects of a Minimax
1(6)9 1163-1169 (1967).
M. FRANK,
"'Optimum Locat tons
Probabilistic Demands," Qg. s.U &.
Locat ion
A
"Location Theory
Re.,
22
400-410
on
kaoul
Prentice-Ha I
a
1r
anW
Graph
with
409-421 (960).
H. FRANK and I. T FRISCH, Comunjat.
TransMiss on
5g2 Tran soo rtation bJatr._lj
Addison-Wesley, Reading,
Mass. (1971).
-42-
Deterministic Network Optimizatlon A Bibliography
Location of Facilities on a Network
LOC28.
"The
and M. R. RAO,
R. S. GARFINKEL, A. . NEEBE,
Fac lity Location,"
Problemn
Bottleneck
m-Center
School of Management,
7414, Grad.
Working Paper No.
Univ. of Rochester (1974).
LOC29.
A. M. GEOFFRION, "A Guide to Computer-Assisted Methods
Sloan Management
for Distributlon System Planning,"
(2) (1975).
Review,
LOC30.
"Multicommodity
A. M. GEOFFRION and G. N. GRAVES9
Distribution System Design By Benders Decomposltion,"
an!s.sl. L, (5), 822-844 (1974).
LOC31.
C.
. GILLESPIE JR. ,"Locating Absolute 2-Centers of
Thesis, Naval Postgraduate
M. So
Undirected Graphs,
School, Honterey, Calif (1968).
LOC32.
A. J. GOLDMAN,
Network," Irfns
LOC33.
GOLOHAN,
A. J.
Networks, IcaAS.
LOC34.
A. J. GOLDMAN, "Optimum
-·
Network," kCaG s
LOC35.
S. HAFLIN, "On Finding the Absolute- and Vertex
J
of a Tree with Distances, " LC.fna.
(1974).
LOC36.
Switching
Distribution of
"Optimum
HAKIMI,
L.
S.
Centers in
a Communication Network and Some Related
Graph Theoretic Prob lems" 'QaJLn
.
· .3, 462-475
( 1965).
LOC37.
Switching Centers
S. L. HAKIMI, "Optimal Locations of
and the Absolute Centers and Medians of a Graph," QOQD^
Bft-l, 2,
Center Location
"Optimal
i(2), 212-221 (1971).
.SgL&,
50-459,
In
a
on
Mlnlmax Location of Facilities
(4), 407-418 (1972).
S1,
Simple
for Centers
Locations
. (2), 2-360 (1969).
a
in
Centers
, 75 -77
(1964).
Graph and
(1971).
Its
LOC38.
S. L. HAKIMI, "Steiner's Problem n a
etiasC
1 (2) , 113-133,
Implications,"
LOC39.
Locations of
'Optimum
MAHESHWARI,
S. HAKIMI and S.
in Networks," QLar2.L JB&.· Z2lnE 967-973 (1972)o
Centers
LOC4O.
In an
G. Y. HANDLER, "MIn1max Location of a Facility
Z., 287-293 (1973).
r[Cans, .i.,
Undlrected Tree Graph,"
LOC41.
Network Location Theory and
G. Y. HANDLER, "inlImax
Res.
107,
Opers.
Tech. Report No.
Applications,"
Center, MIT (Nov. 1974).
-43-
Oeterministic Network Optlmization A Bibliography
Location of Facilitles on a Network
Branch and
&tl..*
gnn.
LOC42.
P. JARVINEN, J. RAJALA, and H. SINERVO, "A
Bound Algorithm for Seeking the p-Median,"
Za(i), 173-182 (972).
LOC43.
Bound
Branch and
Ef ficient
"An
B. M. KHUHAWALA,
,
the Warehouse Location Problem,"
Algorithe for
i.lr.
11(12)
8718-B731
(1972).
Heuristic Program
2, 643-666 (1963).
LOC44.
A. A. KUEHN and . J. HAMBURGER, "A
for Locating Warehouses," tjn& SCl.
LOC45.
LEVY,
J.
Network,"
LOC46.
"Plant
A. S. MHANE,
Scale-Decentralizat on
11, 213-235 (1964).
LOC47.
F. E. MARANZANA, "On
Minimize Transport
261-270 (1964).
LOC48.
of
An Algorithm for Finding Almost All
R. E. MARSTEN,
of a Network," Discussion Paper No. 23,
the Medians
and
Studies in Economics
Center for Mathematical
Management Science, Northwestern Unrlv. (1972).
LOC49.
The r-Center Problem,"
INIEKA,
E.
138-139 (1970).
LOC50.
P. B. IIRCHANOANI, "Analysis of Stochastic Networks in
Report TR-15-75,
Tech.
Service Systems,"
Emergency
Opers. Res. Center, MIT (March 1975).
LOC51.
A. R. ODONI, "Location of Facilities on a
Survey of Results," Tech. Report No. 3-74,
Center, MIT (174).
LOC52.
A. PRITSKER and P. GHARE, "Locating
Respect to Existing Facilitles,"
1t(4), 290-297 (1970).
LOC53.
J. J. REED, "Two Algorithms for Finding the Absolute
of a Graph," M.S. Thesis, Naval Postgraduate
m-Center
Schoolt Monterey, Calif. (1971).
LOC54.
An
LIEBMAN,
C.
and J .
ARKS,
O.
C. S. REVELLE,
Models,"
Location
Sector
Public
and
Private
of
Analysis
lf, 692-707 (1970).
=9,
ia&
LOC55.
C.
S.
REVELLE
Location,"
for
(4),
"An Extended Theorem
naJaL Ress. QuartertcJLv
and
Location on a
433-442 (1967).
of
Location Under Economies
an. .;.,.
and Computations,"
the Location of Supply Points to
Costs'" QaJLIL B.S&S 2ILALAC.L, J,
R.
Geooraaical
SWAIN,
BeVale1Z,
SIAM
A
Networkl
Opers. Res.
New Facilities with
[AIE ITransactiQn,
"Central
.An1.als, Z(i),
Facilities
30-42 (1970).
-44-
Deterministic Network Optimization A Bibliography
Location of Facllities on a Network
A
Review,"
LOC56.
A. J. SCOTT,
Earalah1n lal
LOC57.
A. J. SCOTT, "Oynamic Location-AlI ocation Systems,
An
Planning Strategles," :lEyiroanmaent
Basic
Some
39 73-83 (1971).
El.nan,
LOC58.
A. J. SCOTT, "Operational Analysis of Nodal Hierarchies
25-37
Quart..- 22
"I&
eLnaL
in Network Systems,"
( 1971).
LOC59.
L. SCHRAGE, "Implicit Representation of Variable Upper
of
School
Grad.
Programing,"
in
Linear
Bounds
Business, Univ. of Chicago (1974).
LOC60.
Y. SEPPALA, "On
Problem," AIIE
LOC61.
S. SINGER, "Multi-Centers and Mu tl-Medians of a Graph
Warehouse Locatlon,"
with a Application to Optimal
unpublished paper, Dunlap and Associates, Inc., Darien,
Conn. (1968).
LOC62.
Facility Location with
R. SOLAND, "Optimal
373-383 (1974).
2(2),
*.L
S
,
QOn
,
Costs,"
LOC63.
K. SPEILBERG, "Algorithms for the Simple Plant Location
tIM-., JZ
Problem with Some Side Constralnts," QDML2
85-111 (1969).
LOC64.
K. SPEILBERG, "Plant Location with Generalized
.li165-178 (1969).
Origin,' Man, S.*
LOC65.
R. W. SWAIN, "A Oecompostlon Algorithm for a Class of
0. Olssertation,
location Problems," Ph.
Facility
Cornell Univ. (June 1971).
LOC66.
R. W. SWAIN, "A Parametric Decomposition Approach 'for
the Solution of Uncapacitated Location Problems," Oepto
of Industrial Eng. Ohio State Univ. (Dec. 1971).
LOC67.
M. R. TEITZ and P. BART, "Heuristic Methods for
Estimating the Generalized Vertex Medlan of a Weighted
"Location-Allocation Systems:
95-19 ( 70 ).·
Aoa/~ls,
a Stochast ic Multi-Facillty Location
Z(i), 56-62 (1975).
casac.tion,
Graph," QQan,. iAt3,
LOC68.
Search
955-961 (1968).
C. TORREGAS9 R. SWAIN9 C. REVELLE, and L. BERGMAN, "The
Bta.,
Location of Emergency Service Facilities," D2ns
192
LOC69.
/.,
Concave
1366-1373
(1971).
W. TRUSCOTT9 "The Treatment of Revenue Generation
Effects of Facility Location," ALiE Tralns.ai.iLD, Z(1),
-45-
Oeterministic Network Optimization A Bibliography
Location of Facilities on a Network
63-69 (19 5).
LOC70.
and
"An
AI gorithm
and
J.
ROGERS,
R.
VERGIN
Computational
Procedure
for
Locating
Economic
19 240-254 (1967).
FaclIltles," nn., S"=.-
LOC71.
Optlmal Locations on a
R. E. WENDELL and A. P. HURTER,
Network," kLraAS
. *9.,
Z(j1)
18-33 (1973).
LOC72.
On Cover Problems and the
J. A. WHITE and K. E. CASE,
Central
Facility
Locati on
Prob l em,"
orahbcalI
281-293 (1974).
AaLrslsa *l(3)9
LOC73.
J. YEE9 "DLspatching Policies on a Network," Operations
Research Center,
.I.T, S. M· Thesis (Janaury 1974).
-46-
Deterministic Network Optimization A Bibliography
Design of an Optimal Network
DES1.
the
for
Techniques
"Optimizing
S. K. AGARNAL,
Under
Networks
Transportation
of
Design
Interactive
Multiple Obectives," Ph.D. Thesis, Dept. of Civil Eng.
Northwestern Univ. (1973).
DES2.
"Opt imally
J. N. AYOUB and I. T. FRISCH,
IEEE
Networks,"
Directed Communication
Jah
, .ti=.l
.,-
484-
489
Invulnerable
raas., Ca
(1970).
OES3.
P. BANSAL and S. JACOBSEN, "An Algorithm for Optimizing
4JQIA
Network Flow Capacity Under Economies of Scale,"
2i(5)* 565-586 (1975).
OES4.
J. BILLHEIER and P. GRAY9 "Network Design with
SL.* 7
..
ILrans
Elements,"
and Variable Cost
(1973).
DES5.
of
Class
General
"A
BOESCH and A. FELZER,
F.
atworilt, .(3), 261-284 (1972).
Invulnerable Graphs,"
DES6.
Do BOYCE, A FARHI, and R. WEISCHEDEL, "Optimal Network
Problem A Branch and Bound Algorithm," .DyJaonm t IDJ
Eannina, 5 (4)9 519-533 (1973).
DES7.
An
with
Methods
Searching
"Tree
BURSTALL,
R.
li&Ghlna
Problem,"
Application to a Network Design
&, 65-85 (1967?).
InJtaiLgJ.aJ,
DES8.
Specified
Nets with
"Communication
E. BUTLER,
D.
Laboratory Report
Coordinated Sc 1.
Survivability,"
R-359 Univ. of Illinois (July 1967).
DES9.
for Funds
"Model
STOWERS,
R.
and J.
E. C. CARTER
Capacity
System
Highways
Urban
for
Al location
84-102.
ZU,
BecoQg
¢Lr
JiJg19u
Improvements,"
DES10o.
a
TI me Reduction in
Travel
"Optimal
CHAN9
P.
.
Network
of
Application
An
Network;
Transport
Research
Aggregation and Branch and Bound Techniques,"
M.I.T.
Engineering,
Civil
of
Report R 69-39, Department
(1969).
DESl.
R. T. CHIEN, "Synthesis of
a,&L A,
iBd 1[iof L a. an.J
OES12.
Communi cation
"Surv iv ab I e
N. CHOU and H. FRANK,
IEEE Irans..
Matrix,"
Capacity
Terminal
the
and
Networks
Uc
OES13.
Lhbrf
Y.. g-_ L
N. CHRISTOFIDES and P.
a Communication
311-320 (1960).
Fixed
49-74
Network,"
9192-197 (1970).
8ROOKER,
'Optimal
Expansion
of
-47-
Deterministic Network Optimizatlon
A Bibliography
Design of an Optimal Network
an
OES14.
Existing Network," HLl
Poa
Co.
197-21' (1974).
fa
A. CLAUS and D. J.
KLEITMAN,
"Heuristic Methods for
Solving Large Scale Network
ou ting Problemst
The
Telpacking Problem," tudliLA in
&aJ1d
Math.,
L
a,(1)
17-29(1975).
OES15.
J. EOMONOS, "Existence of k-Edge
Graphs with Prescribed
Degrees,"
Connected
Res,
Ordinary
L, 688,
73-74 (1964).
DES16.
L. FORD and D. FULKERSON9, FlJs
Univ. Press, Prlnceton, N J.
DES17.
I. T. FRISCH, "Optimization of Communication Nets with
Switching," I." ECranLnD mu.
lZIt 45-430 (1963).
DES18.
I. T. FRISCH,
Connectivityl,"
OES19.
I. FRISCH and 0. K. SEN, "Algorithms for Synthesis at
Oriented Communications
Nets," LE
ICan.L
circut
IhIarCX, QI.:1,
370-379 (1967).
DES20.
O. R. FULKERSON, "Increasing the Capacity of a Networks
The Parametric Budget Problem," d{t.& Sj., . . 472-483
'An
In trn
Ln =jQGJbS,
(1962).
Al gort ith
Ji Cogntr.l
Princeton
for
Vertex
Pair
6, 579-593 (1967)o
( 1959).
OES21i
O. FULKERSON and Lo SHAPLEY "Milnimal
Graphs,"
iJckst
1( 1) * 91-98 (t971).
0ES22.
R. GOMORY and T. C. HU, "An AplIcation of Generalized
Linear Programming
to Network Flows," JL.
IAfMl
I,
K-Arc
Connected
26-283 (1962)
DES23.
R. GOMORY and T. C. HU, "Multl-Terminal
.1. SIAM 9(4). 551-570 (961).
DES24.
R. GOMORY and T. C. HU, "Synthesis of
Network,"
SIA
12Z 348-369 (964).
DES25.
S. HAKIMI, "On the Realization of a Set of Integers as
Degrees of the Vertices of a Linear Graph," IA
L L
AQL. 1hAl.
* ·
135-147 (1963).
OES26.
S. HAKIMI, "An Algorithm for Construction of the Least
Vulnerable Communication
Network, EJ.E IJ.ans.. fI.rul
Ih2b LCT-,
i.
229-230 (1969).
OES27.
S.
HAKIMI and A.
Networks,"
AMIR,
"On
titgorthS 3(3),
the
21-260
Network Flows,"
a
Design
(1973).
Communication
of
Reliable
-48-
Deterministic Network Optimization A Bibliography
Design of an Optimal Network
DES28.
A. M. HERSDHORFER, "Optimal Routing of Urban Traffic,"
of City and Regional Planning,
Dept.
Thesis,
Ph.D.
M.I.T. (May 1965).
DES29.
T. C.
MIAJhL.
DES30.
T. C. H, "'Optimum Communication Spanning Trees,"
188-195 (1974).
33)
tDSaigi:
.& C
OES31.
W. KIM and R. CHIEN, Tooola
NetnorkCs
2. CoQ.IlaU.Ltin
New York (1962)
DES32.
0. J. KLEITMAN, "Methods for Investigating Connectivity
for Large Graphs," EEE Iransactiona gn Crcuit TLgharC,
'6, 232-233 (1969).
fj
DES33.
in
Number of Multiple Edges
"Minimal
O. KLEITMAN,
Realization of an Incidence Sequence without Loops,"
iAd l g A lLt Math. , 1'.(1) 25-28 (1970).
OES34.
for Constructing
O. KLEITMAN and . WANG, "Algorithms
Graphs and Olgraphs with Given Valences and Factors,"
(1) 7c-88 (1973).
,
.LscrJte lmh.
0ES35.
Logical Design of Electrical
"The
U. G W. KNIGHT,
Networks Using Linear Programming rethods," Ptrg.leno
.gZ, 306-314
nt9,
.±[ fo .t .
G2
±Ja InstIltution 29
(1960).
DES36.
'"Mathematical Programming Algorithms for
L. J. LEBLANC
Large Scale Network Equilibrium and Network Design
of Indust. Eng. and
Oept.
Thesis,
Problems," Ph.D.
Man. Sci., Northwestern Univo
DES37.
L. J. LEBLANC, "An Algorithm for the Discrete Network
9(3), 183-199 (1975).
Sj
Design Problem," Irans
DES38.
An
of an Expanding Network"Control
MAUCERI,
L.
(4), 287-298 (1974).
Operational Nightmare," Ji~ rkaj,
OES39.
F. OCHOA-ROSSO, "Application of Discrete Optimization
to Capital Investment and Network Synthesis Prcblems,"
(June
HIT
Eng.
of Civil
Tech. Report R68-42, Dept.
1968)
DES40.
Approac hes to
"Heuristic
A. PEARMAN,
Optimizat ion," Lngn.egcrng OQtii.zatgz dln,
( 1974).
DES41.
C. PINNELL and G. T.
HU, "Some
ecQ9. j.,
in Discrete
Problems
102-112, (1971).
Optimization,'
Uim
aang SynatbhS1
&a.Lys
Dca,
Columbia University Press,
SLATTERY,
"Analytic
Road Network
1(1), 37-49
ethods
in
-49-
Deterministic Network Optlmizationt A Bibliography
Design of an Optima Network
Transportation:
Systems
Analysis for Arterial
J& Ql Enos tirhooars
Operatlon ."
Street
ASCI E,
alulQlsg*
A
62-95 (1963).
OES42.
and
of Transportation
R. E. QUANOT, "Models
Network Construction," J& °t
lonal
27-45 (19 60) .
IL.
Optimal
.2()
"Investment In a Network to Reduce the
Shortest Route," EPe ;gld9nsa
.t tMa I 3.J
SymgoSlu u=
lh JLt JQr U1 IfJ;
F.E J
York, 235-263 (June 1965).
OES43.
. H. RIOLEY,
Length of a
IntIernkt onal
ElsevgL. New
DES44.
T. M. RIULEY, "An Investment Policy to Reduce
Time In a Transportation Network," Trang Rs.
409-424 (1968).
DES45.
T. N. RIDLEY, "Reducing the Travel Time n a Transport
,udsID Reignal Salagans, (A. J. Scott,
Network," In t
ed.), Pon Ltd., London (1969).
DES46.
R. ROBERTS and M. FUNK, "Toward Optimum Methods of Link
Addition in
Transportation Networks," Dept. of Civil
Eng-, MI.T. (Sept. 1964).
DES47.
B. ROTHFAR8 and M. GOLDSTEIN, "The One-terminal
s 156-169 (1971).
Problem," Qanjzr i&Ba..
OES48.
J. G. SCHWARTZ, "Network Flow and Synthesis Models for
Transportation Planning A Survey," Tech Report R68-49,
Oept. of Civil Eng.,
.I.T.
(June 1968).
OES49.
A. J. SCOTT, "A Programming Model
of
aoers, Bega
Transportation Network,"
215-222 (1967).
0ES50.
SCOTT,
A. J.
Computat iona I
( 1969).
DES51.
A.
J.
Network
"The
Optimal
Procedures,"
IA._ ·
&
Cgoboiat oclg
aoa Ej.annIng, Methuen,
SCOTT,
Analys.L
Tel pak
an Inte rated
i.. Asse, ±3L
Some
Problem:
.,
,
201-210
eCagcaiio
Lna
London
Travel
(4),
Saal
(1971).
DES52.
Nets,"
O. K. SEN, "Synthesis of Oriented Communication
Ph.D. Thesis, Univ. of Calif. at Berkeley (1966).
0ESi3.
FRISCH,
SEN and I.
O. K.
Nets,'"
n
Communication
umsi
s
nl O Signal I.asNlsi
YQ
Columbla Universltye New York,
DES54
S
STAIRS,
"Synthesis of Oriented
.tJhatd
,T,EE
iPro2t~
n
al ±965
2l).
a
90-10i(May 1965).
"Selecting An Optimal
Traffic
Network,"
L
-50-
Oeterministic Network Optimization A Bbliography
Design of an Optimal Network
1
DES55.
L.ans.orCt
P.aoiL,
Z,
218-231 (1968).
P. A
(1974).
STEENBRINK,
QlIa.iLa±jlgsD
John Wiley and Sons,
DES57.
as
P. A. STEENBRINK,
Transport Network Optimization In
the Dutch Integral Transportation Study," Tran.i iEt. 9
At 11-27
OES56.
£gnamiLLS
New York
t
Lr ansrQ
tat.t St
(1974).
K. STEIGLITZ9 P. WEINER, and D. J. KLEITHAN,
Minlmum Cost Survivable Networks,"
EE
crcuiL
J..lh
"Design of
Irans
QA
r CT I& 455-460 (969).
DES58.
D. T. TANG, "Communicatlon Networks
with
Flow Requirements,'" IEE[ rans,
LClIt
(1962)
Simultaneous
lfortC.Y_± C3
DES59.
R. WONG, "A Survey of Some
Norking Paper OR-053-76,
H.I.T. (May 1976).
DES60.
N. ZADEH9, Construction of Efficlent Tree Networkst The
Pipeline Problema" NaeirkSqi
3(1), 1-32 (1973).
DES6j.
"On Bul ding Minlmum Cost Communication
N. ZADOEHt
Networks over Time," JetGrk. s
(1),
19-34 (1974).
Network Design Problems,"
Operations Research Center,
-51-
Deterministic Network Optlmizatlon A Bibliography
Implementation Issues
IMPi·
"Solving Large Scale
MAGNANTI,
H. AASHTIANI and T.
Network Optimization Problems," QS JuLLLaDn Z3 (1),
B-71 (1975).
IMP2.
M. BALINSKI and R. GOMORY, "A Primal
Method for
Assignment and Transportation roblem,"
.. Sl
,
578-593
the
1Q
(1964).
IMP3.
"An
Improved
KL INGMAN,
and 0.
GLOVER,
R. BARR, F
Version of the Out-of-Kilter Method and a Comparative
Study of Computer Codes," Math
erg.
Z (1),
60-87
(1974).
IMP4..
G. BENNINGTON9
"An
Algorithm," Mm* ,S.t
IMP5.
G. BRADLEY, "Survey of Deterrministic
_ICansactlnt
(3), 222-234 (1975).
IMP6.
G. BRADLEY, G BROWN, and G. GRAVES, "A Comparison of
Some
Structures
for Primal
Network Codes,"
QBSA
Bu ILLtin
3(1)
(1975)
IMP7.
A. CHARNES and W COOPERt "The Stepping Stone Method of
Explaining
Linear
Programming
Calculations
in
Transportation Problems,"
KLO.& SlJ
1 49-69 (1954).
IMP8o
A. CHARNES, F. GLOVER, DO KARNEY9 D. KLINGMAN,
and J.
and Future of Large Scale
"Past,
Present,
STUTZ,
Transshipment
Computer
Codes
and
Apo I cat ions,"
C2GmQMDuZJ
MI gXcatIoE Besearch.
2(2). 71-81 (1975).
IMP9.
R. CLASEN, "The Numerical Solution of Network Problems
Using the Out-of-Kilter
Algorithm," RAND Corporation
Memorandum RM-5456-PR, Santa Monica, California, (March
1968).
Efficient
Minimal
Cost
.(9)
1021-1051 (1973).
Networksg"
F low
AIE
IMP10.
"Theoretical
J. EOHONDS and R. KARP,
Algorithmic Efficiency for Network
x[
9 19, 248-264 (1972).
in
Improvements
Flow Problems,"
IMPil.
n. FLOOD,
I.
s I La.
IMP12.
M. FLORIAN and M. KLEIN, "An Experimental Evaluation of
fQaD Q0a
Some Methods of Solving Assignment Problems,"'
1i01-10 8 ( 197 ).
,GUC-. ,
B·.
Sr
IMP13.
for
L. FORD and D. FULKERSON, "A Primal-Dual Algorithm
the Capacitated Hitchcock Problem," t[Y .R B.s. L.S -.,
"A Transportation Algorithm and
Q
, 257-276, (1961).
Code,"
hyr
-52-
Deterministic Network Optllizatlon
A Bibliography
Implementation Issues
,
47-54
(1957).
IMP14.
0. FULKERSON,
"An Out-of-Kilter
Minimal
Cost Flow Problems,"
tj
2, 18-27 (961).
IMP15.
J. GILSINN and C. WITZGALL,
A Performance Comparison
of Labeling Algorithms
for Calculating Shortest Path
Trees," National Bureau of Standards Technical Note 772
(1973).
IMPj6.
F. GLOVER, O. KARNEY, and 0. KLIIG4AN,
"The Augmented
Predecessor
Index Method for Locating Stepping Stone
Paths and Assigning Dual
Prices
in
Distribution
Problems," Lans. Sl.,
(i),
171-180 (1972).
IMP±7.
F. GLOVER, O. KARNEY, and O. KLINGHAN,
"Implementation
and Criteria
for a Primal Network Codes"
Wbk!jGrCJhs iAt
191-212,
Method
for Solving
L f. ALl.ed Mat.l
(1974).
IMP18.
F. GLOVER,
. KARNEY, D, KLINGMAN, and A. NAPIER,
wA
Computational
Study on Start Procedures, Basis Change
Criteria and Solution Algorithms
for Transportation
Problems," anlj.,
(5 ),
793-819 (1974).
IHP19*
F.
GLOVER and D.
Solution of Large
Problemst"
1o.al
Ji.
Co tggLLga
KLINGMAN,
"New
Advances in
the
Scale Network and Network-Related
"hnatl±j
Sniltia
s
J1an
North Holland Publishing Company (1975).
IMP2C.
F. GLOVER and 0.
KLINGMAN,
"Network
Applications in
Industry and Government," University of Texas (December
1974)
IMP21.
F. GLOVER,
. KLINGMAN,
Finding All
Shortest
(1974)
IMP22.
F.
GLOVER,
O. KLINGMAN,
and J.
STUTZ,
"Augmen ted
Threaded Index ethod for Network Optimization," INEQB,
12(3), 293-298 (1974) .
IMP23.
B. GOLDEN, "Shortest Path Algorithmst
A Comparison,"
Working Paper OR 044-75, Opers. Res. Center, MIT, Oct.
1975 (to appear In DQJ
. BR[l).
IMP24.
B. GOLDEN, T.
AGNANTI, and H.
NGUYEN,
" Implementing
Vehicle Routing Algorithms,"
ech.
Report No. 15,
Opers. Res. Center, MIT (Sept. 1975).
IMP25.
N. HSIEH and A. KERSHENBAUM,
"Constrained
Routing
In
Large Sparse Networks,"
ernoceeSjtAL
.n Int cna tilona
and A.
NAPIER,
"A Note on
Paths," Lra. .*,.s(i
(),
3-13
-53-
Deterministic Network Optlmizationt A Bibliography
Imlementatlor Issues
GQ
(1975).
suto oXEQ2s1lUmi
August
20-22,
Taipei,
IlP26.
E. JOHNSON, "Networks and Basic Solutions,"
Z_1(4), 619-623 (1966).
IMP27.
E.
JOHNSON,
EProceeda.ngS
(Aug. 1972).
Shortest
"On
g.l
192
I,
Paths
Con.gIacrta
and
Taiwan
Ons.
ft,
Sorting,"
Boston,
510-517
IMP28.
A. KERSHENBAUHt,
Computing CapacLtated Mlnmal Spanning
Trees Efficlentlyt" NetwLor
i
(4), 299-310 (1974).
I1MP29.
A. KERSHENBAUM and R.
VAN SLYKE,
"Computing Minimum
Spanning Trees Efficlently," [aZ.Z2 P..QUe Jdr
1972
Annual Conference of
the Association for Computi ng
Machinery, 518-527 (1972).
IMP30.
O.
KLINGHAN,
A.
NAPIER,
and
J.
STUTZ,
"NETGEN-
A
Program
for Generating Large Scale (Un) Caoacitated
Assignment,
Transportation
and Minimum
Cost
F low
Network Problems," an.
jI.1. 2(5) 814-822 (1974).
IMP31.
T. MAGNANTI,
Report No.
1975).
TMP32.
J. MULVEY, "Network Relaxations fop Set Covering,
Set
Partitioning and Other Integer Programming Problems,"
Research Report
(to appoear Center
for
Cybernetic
BEB-613, Austin, Tex,
Studies,
University of Texas,
78765).
IMP33.
J. MULVEY, "Special Structure in
Associated
Applications," Ph.D.
(August 1975).
IMP34.
of
Efficiency
and
"Implementation
PAPE,
U.
Moore-Algorithms for the Shortest oute Problem," Ma.tL
E:C2.
ZI, 212- 222 (1974).
IMP35.
J. PLA, "An Out-of-Kilter Algorithm for Solving Mlnimum
Cost Potential
Problems,"
MatL
rG.*.,
1s 2 75-290
(1971 )
IMP36.
V. SRINIVASAN and G. THOMPSON, "Accelerated
Algorithms
for Labeling and Relabeling of Trees with Appllcatlon
for Distribution Problems,"
J&.t.
j (4),
712-726
(1972).
IMP37.
Analysis
'Benefit-Cost
V. SRINIVASAN and G. THOMPSON,
of Coding Techniques for
the Primal Transportat 1on
"Optimization for Sarse Systems,"
119,
Opers.
Res.
Center,, M.I.T.
Tech.
(Nov.
Network Models and
Dissertation,
UCLA
-54-
Deteralnistic Network Optimilzatlont A Bibliography
Implementation Issues
Algorithm," JACI4 21,
IMP38.
194-213 (1973).
J. YEN, "Fining the Lengths of All Shortest Paths in
N-Node Nonnegative Distance Complete Networks Using 1/2
N++3 Additions and- Nxx3 Comparlsons,"
JAL 9 (3),
423-424 (1972g.
-55-
Deterministic Network Optimizatlion
Complexity Theory
COMPl.
A. AHO, J.
AnIx.aMi=
Reading,
HOPCROFT, and
2f
agluter
Mass.,
J.
A Bibliography
ULLMAN,
Al 0a0rLnS ,
(974).
lbo
Ds5ign a.
Addison-eslIey,
COMP2.
A.
BORODIN,
"Computational
Complexity-Theory
and
Practice,"
in
=urrCntC
% in
n lhaL X Q
geutins 9 (A,
Aho, ed.), Prentice- Hall,
Englewood Clifts,
N.
J.,
35-89 (1973)1.
COMP3-
W. CHEN,
"Topological
Formulations and
Order
of
Complexity of Active Networkst
A Unified Survey,"
tietworks, i(3),
237-260 (1972).
COMP4.
S.
COOK,
"The
Procedures,"
heQry 2 t
Complexity
Proc.
GE".jlin,
LL
of
the
It& it flclr_
Theorem-Proving
AO
Symp
ium
151-158 (1971).
COMP5.
G. OANTZIG, W. BLATTNER,
and M. RAO,
I I Shortest
Routes from a Fixea Origin in
a Graph," Theory of
Graphs,
International
Symposium.
Rome,
July
1966.
Proceedings published by Gordon and Breach, New York,
85-90 (1967).
COMP6.
E. DINIC, "Algorithm
for Solution of
a Problem of
Maximum Flow In a Network with Power Estimation, ".'iQ
!1sb
Ohl.
l
11,
,
1277-1280 (1970 )
COMP7.
J. EDMONDS and R. KARP,
"Theoretical
Algorithmic Efficiency
for Network
JAL.
129, 28-264 (1972).
COMP8
S.
EVEN,
ACl gothL
York, (1973).
COMP9.
R. FLOYO,
"Nondeterminist ic
636-644 (1967).
Cg
hnatL~.i,
Improvements
in
Flow Problerms,'
Macmillan,
Al gori thms,"
.
A.CM
CO P.
H. GABOW,
"An
Efficient
Implementation of
Maximum Matching Algorithm,"
Tech.
Report
Stanford Digital Systems Laboratory (1972).
COMPJ.,
M. GAREY and
D.
JOHNSON,
"The
Complexity
Near-Optimal Graph Coloring," JAt, (to Appear).
COMP12.
Mo GAREY,
Slmplified
BI S.XMg
COMPj3.
D. JOHNSON,
NP-Complete
u
= ItQgDr
R.
L.
GRAHAM,
"Bounds on
Anomalies," TJiA 1J&g.[ AJL
1i,
Edmonds'
No.
31,
and L.
STOCKMEYER,
Problems,"
ProQ. Qt lh
E
of Com.wuLa,
New
of
"Some
Itb
47-63 (1974).
Multiprocessing
Timing
b.
1,
416-429 (1969).
-56-
A Bibliography
Deterministic Network Optlmizatlont
Complexity Theory
COHP14.
J
HOPCROFT and R. KARP,
Maximum
Matchings in
Algorithm
N**(5/2)
"An
Bpartlte Graphs,"
.I5AI
J
for
. .Q
?, 225-231 (1973).
COMP15.
for
Algorithms
372-378,
J1 (6 ,
"Efficient
J. HOPCROFT and R. TARJAN,
QWm!& &&,
Manipulation,"
Graph
(1973).
COMPj6.
F. HWANG, "On Steiner Miniwal Tree With Rectl linear
Distance," IAM JA g.i Ad1i. 1ah. (to appear).
COMPI7?
Problems and
"P-Complete
IBARRA and S. SAHNI,
.
74-5,
Report
Technical
Approximate
Solutions,"
University oif Minnesota (197 '4).
COMPI8.
"Near
D. JOHNSON,
Thesls,
Doctoral
COMP19.
"Fast Algorithms f or Bin
O. JOHNSON,
, 272-314 (1974).
.SU;L,
CaQlALut. Syi.,
COMP20.
Approximatior Algorithms for Combinatorial
O. JOHNSON,
, 256-278 (1974)
Probleas," t[. Coogu.t Syt.iatL, 1S
COMP21.
and R.
M. GAREY,
ULLMAN,
O. JOHNSON, A. DEMERS, J.
Simple
for
Bounds
Perf ormance
"Worst-Case
GRAHAM,
aIm
th
ms,"
AI
gorL
Packing
J 2
One-Dimensional
, , 299-325 (1974).
QoUtjgg,
COMP22.
R. KARP,
COMP23.
Computatlonal
the
"On
R. KARP,
Combinatorial Problems," Netwgrks., 3,
COMP24.
the Simplex
is
Good
"How
V. KLEE and G. MINTY,
Boeing Scientific
643,
Note No.
Math.
AI gorithm,"
Research Laboratories (1970).
COMP25.
Analysis of Computer Scheduling with Memory
K. KRAUSE,
Science
Computer
Thesis,
Doctoral
Constraints,"
Department, Purdue University (973).
COMP26.
Graphs,
"Algorithms,
LAWLER,
E.
(1975).
i,5(1i), 89-92
t.SI,
COMP27.
S.
Packing,"
JJL
Prob lems,"
"Reducibillty Among Combinatorial
and J.
Coa tati a1l (R. M Iler
91 "miput
G.QGmJLjIraL
Thatcher, ads.), Plenum Press, New York, 85-104 (1972).
LIN,
"Heuristic Programming as
Design,"
COMP28.
Bin Packing Algorlthmst"
Opt lmal
Dept. of Mathema t ics, M.I.T. ( 1973).
.
MATULA,
9NatHoQ
.(1),
G. MARBLE,
33-44
and J.
Com;l exit V
45-68 (1975).
and
an
Aid
of
Complexity,'"
to
Network
(975).
ISSACSON,
"Graph
Coloring
-57-
Deterministic Network Optimizationt
Complexity Theory
A Bibliography
(ed.).
Read
In R.
Algorithms,"
m2irsoia.g, Academic Press, New Yorl,
COMP29.
.aD
"Approximate
O. ROSENKRANTZ, R. STEARNS, and P. LEWIS,
the Traveling Salesperson Problem,"
for
Algorithms
lt~rchi~n
Annual
15
.b
j t
of
Erca,ln_"
COMP30.
IfLigry
zCatJ
109-122 (1972).
aG AuJmanit
JTJ
1htQr,
iLfL
Jmpslum
from Network Flows,
Related Problems
rence
and Integer Programming,'" Coni
S. SAHNI, "Some
Theory,
Game
i11 Annual JyaoSLima
BSodo 1faL
Ajltomana IhbsCr,130-13 8 (1972).
Qn
5Ltdhig
S. SAHNI, "Approximate Algorithms for the 0-i
Z2, 15-124 (1975).
Problem," JAC
COMP32.
S. SAHNI, "Some Related Problems from Network
21. b. i tb
Game Theory, Solutions," Proedina
SIaa2Ls
SD Swnitcin
AaA &U
inq
an
Knapsack
COMP31.
IJ
on
33-42 (1974).
Flows,
A!nual
ata Iheory, 28-32,
(1974).
COMP33.
Shortest
for Finding All
P. SPIRA, "A New Algorithm
Time
n
Average
Arcs
Positive
of
a
Graph
n
Paths
28-32 (1973).
(1),
,
0((NlogN)+2)," JSIAM Lg Q.j1j..,l
COHP34*
R. TARJAN,
Algorithms,"
COMP35.
N. ZADEH, "Theoretical Efficiency of the Edmonds-Karp
,JAC, 19,
Flows,"
MaximaI
Algorithm for Computing
184-192 (1972).
COMP36.
N. ZADEH,
Problems,"
COMP37.
"Depth
SIAM
Graph
First Search and Linear
(1972).
L Q.gauting, 1.(2) 146-160
"More Pathological Examples for Network
Iath,
PCQ.G
5,
217-224
Flow
(1973).
N. ZADEH "A Bad Network Problem for the Simplex Method
.Qg.G,
and Other Minimum Cost Flcw Algorithms," ath.
i,
255-266 (1973).
-58-
Deterministic Network Optimization A Bibliography
Matrolds and Graph Theory
NATRI.
T. AOLER, "On BounDs for Complementary Trees in a
Graph,'
Tech. Report No. 69-13, Dept. of Opers. Res.
Stanford Univ.
(Dec. 1969).
MATR2.
J. BRUNO, "Matrolds, Graphs, and Resistance Networks,"
Ph.D.
Dissertation n Elect. Eng. City College of the
City Univirsity of New York (11968.
MATR3.
J.
BRUNO
and
L.
WEINBERG,
"A
Constructual
Graph-Theoretic
Solution of the Shannon Switching
Game," PeC.G
jLgs
Sixth noAuaL &ALIertn onterence 2
fCIRCit anLt 5IZtjD Thelorv Univ. of Illinois (1968).
MATR4.
H. H. CRAPO and G. C. ROTA,
Qa[ Xf
fumiQnatoil
Lo
UQQI
inatf
rLL
Press, Cambridge, Mass.
(1970) .
EfnIlatioQrs
GoQmetrles,
MATR5S
G. B. DANTZIG,
"Complementary
Spanning Trees,"
ID12gaC a
Ngnllnea
ur E.qCagian (J. Abadle, Ed.
North-Holland Press, 449-505 (1970).
MATR6.
J.
EDMONOS,
"Edge-Dis lont
Branchings,"
Algor thZ,
(R.
Rustin,
Algorithmics Press, New York, 1972).
iQblinatorlaI
Q.
MI T
in
).
In
Ed.),
MATR7.
J. EDMONDS, "Lehman's Switching ame and A Theorem of
Tutte and Nash-Willllams," L
I of s .BS,
bfa.,q 73-771,
( 1965 ) .
HATR8.
J.
EDMONDS, "Matrolds and the Greedy Algorithm,"
1, 127-136 (1971).
ErCg.
-tb.
MATR9.
J.
EDMONDS,
"'*Minimum Partition
of a Matrold into
Independent Subsets," h. Qf Res b[a
67-72 (1965).
MATR10.
J.
DMONOS, "Submodular Functions, Matrolds and Certain
Polyhedra,"
IL Cgmb na.tCra
5ructiur
n. I
r
Aoollca1
ins&
nLarser.z
roceeglngs
**orQc
an
[ l gQJAlar_
.A.t. L.. Y.
Internaton]
69-87 (1970 ) .
MATRI .
J. EODMONDS and 0.
R.
Matrold Partition," J
( 1965).
MATR12.
D. GALE, "Optimal Assignments n an Ordered
Application of Matrold Theory,"
,
]mB
176-180 (1968).
MATR13.
C.
GREENE,
O.
"Comp I ementary
FULKERSON,
Q9t fts.
J.
KLEITMAN,
Trees
and
"Transversals
and
,,
69B,
147-153
Set:
Ihb.,
An
.,
and
T. L.
MAGNANTI,
Independent Matchings ,"
-59-
Deterministic Network Optmluzatlon A Bibliography
Matroids ana Graph Theory
Siu
t
in &nn.L.2
2
a ,
MATR14.
C. GREENE and T.
A l gorithms,"
2i
( 1975).
MATR15.
P. HALL,
"On
Na=& .S.E
MATR16.
P. JENSEN,
1,,
L
f. (1),
MAGNANTI, "Some
4L. AL.L& jdt., ..
Representations
11,
26-30
"Optimal
57-64 (1974).
of
Abstract Plvot
5 30- 539
q (1)
Subsets,"
LGadon
(1935).
Be..,
Network Partitioning," Qers.
916 (1971).
Heuristic
"An Ef ficient
Graphs," BIL Sst. TiSh,
MATR17.
and S. LIN,
B.
KERNIGHAN
Procedure For Partitloning
J.LL&, !9, 291 (1970).
MATR18.
G. KISHI and V. KAJITANI, "On
F.Et[h Annjnl
Trees," PCoceedings
01, .ircul .ngt i ssa
LTher.y, Univ.
MATR19.
D. J. KLEITMAN,
in A.LiIg athU,
MATR20.
S. KUNOU and E. L. LAWLER, "A Matrold Generalization of
a Theorem of Mendelson and Oulmage,"
J21s. t lfl., I,
159-163 (973).
MATR21.
E. L.
PFrQ.G
MATR22.
Matrold Intersections,"
in
E. L.
LAWLER,
"Optimal
Caiomblnatoclal
Structurces
ad
Their A licatlons.
!r:eedlns g/n. l
iGa.Lari In tara.Lt nal
.gnaiarlnce
Gordon and Breach, N. Y. (abstract only) p. 233 (1970).
MATR23.
A. LEHMAN,
1St AMll
MATR24.
T. L.
QLs
MATR25.
Foundations of
MINTY, "On
the Axiomatic
G. J.
Mat
of Directed Linear Graphs,"
Theories
.echanLs,19 485-520 (1966).
MATR26.
L. MIRSKY, Iransversal
(1971).
MATR27.
C. S J. A. NASH-WILLIAMS, "An ADI lcation of Matrolds
to Graph Theory," in IJhag.c
Qf
Ch1
e.
Gordon and
Maximal y Distinct
ALLerIgn Cnfrance
of Illinois ( 1967).
"Finding Uncoaplemented Trees," .ugj,,S
,5 (3),
309-310 (1972).
LAWLER, "Matrold Intersection Algorithms,"
., ()), 31-56 (1975).
A Solution to the Shannon Switching
MItb., ,Z 687-725 (1964).
AGNANTI,
Mathb.
,
3asis
"Complementary
355-361 (1974).
Breach, New York (1967).
of
a
.heqJy, Academic Press,
atLahJ
Game,"
Matrold,"
the
aM.4C
New York
-60-
Deterministic Network Optimization
A Bibliography
Hatrolds and Graph Theory
MATR28
C. ST. J. A. NASH-WILLIAMS9
"Decomposition
Graphs into Forests"
a Lalga d{tuL a-v,
(1964)·
MATR29.
C. ST. J.
A.
NASH-WILLIAMS9
"Edge-DOisjoint
Spanning
Trees of Finite Graphss,
I.J Lndogn k111&
/
Q
39,
U.
445-450 (61).
MATR30.
C. E
[/st.
HATR31.
R. TARJAN,
Branchings,"
HATR32.
W. T. TUTTE, Intoduct
ion ±. Ito
Lhaerx
American Elsevier, New York (1971).
MATR33.
W. T. TUTTE, "Lectures on Matrolds,"
698, 1J-48 (1965).
MATR34.
W. T. TUTTE, "On the Problem of Decomposing
a Graph
into a Connected Factors," J. Lndon taJ31 L%ML,
3,
Playing
SHANNON, "Game
2.
447-453 (955).
221-230,
0. J.
of
39
"A Good
Algorithm
(to aPPear).
for
LL
Fan.J1,n
L
Machines,"
Finite
o 12v
Edge-D solnt
1
.t
UtlroLsg,
Ross&
t",
(1961).
MATR35.
WELSCH, "Kruskal s
Theorem
for Matrolds,"
gCPad9l13
faxJLg.2t EJ.i[& i.sP.o
§.,. 34 (1968)
MATR36.
0. J. A. WELSCH, "On Matrold Theorems
of Edmonds
Rado," J Ldon ]atlt jgS. , 3t
251-256 (1970).
MATR37.
L.
J. WHITE,
"Minimum
Partitions and
Switching Game," unpublished Tech. Report,
Lab., Univ. of Michigan, (July 1967).
MATR38.
H. WHITNEY,
Dependence,
A.
"On
the Abstract
Ar _. "La. M
, 5t'
and
the Shannon
Systems Eng.
Properties of
509-533 (1935).
Linear
-61-
Deterministic Network Optimization
A Bibliography
Index of Authors
AASHTIANI, H., IMPi
ACHIM, C., EQUIL9
ADLER T., MATRj
AGARWAL, S. K., DESI
AGRAWALA, A., GEN33
AHO, A.,
COMPI
AHIN, A., RELI
AMIR, A., OES27
ASHOUR, S., TSPI
ASSAD, A., HULTI
AYOUB, J. N., DES2
BAGCHI, A., TSP80
BALAS, E.,
ULT2
BALINSKI, M. L,
CPP1, CPP2, CPP3, CPP4, TSP29 IMP2
BALL, M., REL1
BALLOU· R., LOCI
BANFORO, T.· EQUIL38
BANSAL, P., DES3
BARACHET, L., TSP3
BARLOW, R,
REL2
BARON, G,
MST1
BARR, R., IP3
BART, P., LOC67
BAUMOL, W., LOC2
BAZARAA HM., SP.
BEALE, E.
. L., MULT3
BEAROWOOD, J., TSP4
BECKENBACH (ed.). E., GEN1
BECKMANN, M. J., EQUIL1, EQUIL2
BELL, O., TSP5
BELLMAN, R., SP2, CPP5S TSP6, LOC3
BELLMORE, H., REL39 REL4, RELI7,
ULT4, MULT5, TSP7,
BELTRAMI, E., CPP6, TSP1O
BENNETT, B., TSPIl
BENNETT, H., TSP15
BENNINGTON, G. E., MULT4, MULT6, IMP4
BENTLEY, J., MST2
SERGE, C., CPP7
BERGMANs L., LOC68
BHATT, K., EQUIL3
BILES, W., TSP12
BILLHEIMER, J., DES4
BLACK, H., MST3
BLATTNER, H., COMP5
BOCK, F., MST4
BODIN, L., CPP6 TSPiO, TSP13
BOESCH, F., DES5
BORODIN, A., COMP2
BOYCE, D., DES6
BOZOKI, G., HULT7
BRADFORD, J., TSP12Z
TSPB8
TSP9
-62-
BRADLEY,
A Bibl ograohy
Oeterministic Network Optimizatlon
Index of Authors
G.,
GEN2,
IMP5,
IMP6
BRADLEY, S. P., MULT8
BROOKER, P., OES13
BROOKS, R., EQUIL4
BROWN, D., REL5
BROWN9 G., IMP6
BROWN, J., SP3
BROWN, WH. LOC4
BRUNO, J., MATR2, MATR3
BURSTALL, R., DES7
BUSACKER, R., GEN3
BUTAS, L., SP4
BUTLER, O. E., DES8
BYRD, B., TSP70
CAIN, T., TSPT6
CAMERINI, P., TSP14
CANTOR, O. G., MULT9
CAPRERA, O., TSP65
CARTER, E. C., DES9
CASE, K. E.· REL20, LOC72
CASSIDY, P., TSPi5
CERF, V., SP5
CHAN, A., LOC6
CHAN, Y P., DESIO
CHANOY, K., MST5
ULTii, EQUIL5, IP7, IMP8
CHARNES, A., MULTiO,
CHEN, S., MULT12
CHEN, W., COMP3
R T., DES11i OES3i
CHIEN
CHOU, W., MULT31, MST6, DES12
CHOW, W., REL6
TSP18,
CHRISTOFIDES, N., GEN4, CPP8, TSP16, TSPI7
LOCS, DES13
TSP21, TSP29
CHVATAL, V., CPP9
CLARKE, G., TSP22
CLASEN, R., IMP9
ES14
CLAUS, A·.,
LOC7
COHEN, J
CONWAY, R., LOC8
COOK, S., COMP4
COOKE, K., SP6, CPP5
COOPER, L., LOC9, LOCIO
COOPER, W. W., MULTjO, MULT11, EQUIL5, IMP7
CORNVEJOLS. G., LOCIh
COWAN, D., SP5
CRANDALL, H., TSP34
CRAPO, H. H., MATR4
CREMEANS, J. E., MULT13
CROES9 G., TSP23
CROWDER, H·, TSP47
CURRY, G., LOCi2
EQUIL8
DAFERMOS, S. C., EQUIL6, EQUIL7?
TSPI9,
TSP20,
-63-
A Bibliography
Deterministic Network Optimization
Inoex of Authors
ULTI4,
G B., GEN5, SP7t,
TSP26, COMP59 MATR5
P S., LOC13
DAVIS
DE WERRA, O., CPPIl
DEARING, P. M., LOCi4
DEMERS, A., COMP21
B., MULT17
J
DENNIS
DERMAN, C., TSP27
OESLER, J. F., CPP10
DIEHR· G., LOC15
DIJKSTRA, E., SP8, MST7
OANTZIG
DINIC,
MULTi5,
MULTI69
TSP24,
TSP259
E., COMP6
OREYFUS, S. E., SP9, MST8, LOC16
ULTl9
DWYER, P. S., MULTj8,
., TSP28
EASTMAN,
CPPI79
CPPI6·
CPPj15
CPPI3, CPPI4,
MULTZO, CPP312
EDMONDS, J.·
IMP10, COMP7,
CPPi9, CPP2O, CPP21, MST9, DES5
CPP8,9
ATR9, MATRI0, MATRI1
ATR7, HATR8,
MATR69
EFFROYHSON, H. A., LOC17
TSP2i, TSP29
EILON, S., TSP20G
A. M., LOC20
EL-SHAIE8
P., MULT21
ELIAS
ELLWEIN, L. B., LOCi8
ELMAGHRABY· S., GEN6
ELSHAFEI, A. N., LOC19
ELSON, D. G., LOCZ2
ESAU, L., MSTiO
EULER, L., CPP22
GEN7, COMP8
EVEN, S
FARHI, A., DES6
A., MULT21
FEINSTEIN
FELOMAN, E., LOC22
FELTS, W., TSP51, TSP52
FELZER, A., DES5
FERLAND, J., EQUIL9, EQUIL12
FEW, L., TSP30
FISHER, M., LOChi
ULT229 TSP31, IMPII
FLOOD, H. H.,
FLORES, 8., TSP71
FLORIAN, M., EQUIL9, EQUIL,09 EQUILli, EQUIL12, IMPi2
R., SPIO, COMP9
FLOYDO
MULT27,
MULT26,
MULT25
MULT249
MULT239
GEN8,
FORDO L. R.,
IMPJ3
OES16,
MULT28, MULT29. MULT30,
FOURDS, L., TSP77
FOX, B., SPII
FRANCIS, R. L., LOC6, LOC14, LOC23, LOC4, LOC25
REL 38,
REL3,
REL36,
SP12, REL6, REL7,
FRANK, H., GEN9, GENlO1
MULT31, MULT329 LOC26, LOC27 DES12
FRATTA, L., EQUILi3, TSP14
MST2
FRIEDMAN, J.,
GENI1
FRISCH (ed.). I.,
MULT85,
FRISCH, I. T., GEN9, GENIO, REL7, REL31, MULT32, MULT33,
-64-
Deterministic Network Optlmization: A Bbliography
Index of Authors
MULT869 LOC27,
ES29 OES179 DES8
DESI9
ES53
FU, Y., REL8
FUJISAWA, T., MULT34, MULT35
FULKERSON,
. R.9 GEN8,
GEN129
REL9,
MULT159
MULT23,
MULT24,
MULT259 MULT26,
ULT27 MULT28,
ULT29, MULT3O, MULT36,
MULT37
MULT38,
CPP17,
CPP23,
TSP24,
TSP259 OES16,
OES20,
ES21, IMPI3 IMP14, MATR11
FUNK, M., OES46
GABBAY, H., TSP32
GABOW9 H., CPP24, COMP10
GALE
O0., MULT39, MULT40, MATRi2
GAREY9 M., COMHPll CONP±2Z
COMP21
GARFINKEL, R. S., GENI3, TSP33, LOC28
GARTNER
N., EQUIL14
GARVIN,
., TSP34
GASKELL, T., TSP35
GAVURIN, M. K., MULT62
GAZIS, O., TSPll
GEOFFRION, A. M., LOC29, LOC30
GERLA, N., MULT9, EQUIL13
GHARE, P., REL20. TSP779 LOC52
GIBERT, A., EQUIL15, EQUILi6
GILLESPIE JR.
C. M., LOC31
GILLETT, 8., TSP36, TSP37
GILMORE, P., TSP38
GILSINN, J., SP13, IMP15
GLEYZAL A. N., MULT4I
GLICKSBERG, I.,
CPP23
GLOVER, F.·
SP4· MULT42, MULT43,
CPP25,
CPP26,
MSTIl,
MST12,
IMP3,
IMP
IMPi68 IMP17, IPI, IMPi9, IMP20, IMP21·
IMP16
IMP22
GOLOEN, B., SP5, MULT44, TSP39, TSP40O
TSP4j, IP23, IMP24
GOLDMAN
A J
SP16, LOC32, LOC33, LOC34
GOLDSTEIN, J. M., LOC24
GOLOSTEIN, M., DES47
GONORY, R E., CPP4, TSP38, DES22 0ES23, DES24. IMP2
GOOOMAN, S., CPP27, CPP28
GORDON, 8. E., CPP29
GOWER, J., MSTI3
GRAHAM, R. L., COMP13, COMP2I
GRAVES, 6.
.,
LOC30, IMP6
GRAY, P., LOC18, DES4
GREENE, C., MATRI3, MATRi4
GRIGORIADIS, M. 0.,
ULT45, MULT46
GRINOLD, R. C., MULT47
GROSS, O., CPP23, CPP30
GROSSMAN, D., TSP49
HAFLIN, S., LOC35
HAKIMI, S. L., SPI7, REL10, RELli, MULT48, CPPiO,
MST14,
LOC36,
LOC37, LOC38, LOC39, OES25
OES26, OES27
HALBIG HANSEN, K., TSP43
HALEY, K. N., LOCI9
-65-
Deterministic Network Optimizationt A Bibliography
Index of Authors
HALL JR., M., CPP31
HALL, H H., EQUIL17
HALL, HM A., EQUIL18
HALL, P., MATR15
HALPERN, J., SP18
HALSEY, E., SP6
HALTON, J., TSP4
HAMBURGER, M. J., LOC44
HAMMERSLEY, J., TSP4
HANOLER, G. Y., LOC40, LOC4i
HANSLER, E., RELI2, RELi3
HARARY, F., GENI'4
HARDGRAVE, W., TSP42
HARRIS (ed.), B., GEN15
HART, P., SPJ9
HARTHAN, J., MULT49
HEADY, E 0.,
EQUIL1?
HEDETNIEMI, S., CPP2?
HEOETRICHI, S., CPP28
HELD, H,
TSP44, TSP45, TSP46, TSP47, MSTj5. MST16
HELLER, I.,
MHULT50
HERSHOORFER, A. M.,
ES28
HITCHCOCK, F. L., MULT51
HITCHNER, L., SP20
HOFFMAN, A. J., SP21, MULTI6
HOFFMAN, W., SP22, MSTI7
HOLLIDAY, A., TSP82
HOLMES, R., TSP48
HONG, S., TSP7
CPP32, COMPi, COMPI4 COMP15
HOPCROFT, J. E
REL14, RELi5
HSIEH,
., SP23, IMPZ5
SP24,
SP25,
REL16,
MULT52
HU, T. C., GEN16,
GENI7,
GEN18,
MULT53,
MULT59
HMST18,
MST19,
OES22,
0ES23,
ES24,
DES29, DES30
HUCKFELOT, V., TSP?5
HUOSON, J., TSP49
HURTER, A P., LOC71
HWANG, F., COMP16
IBARRA, O., COMPI7
IMRICH, W.r HST1
IRI, M., HULT55
ISSACSON, J., COMP28
IVANESCU, P. L., MULT2
JACOBSEN, S., OES3
JARVINEN, P., LOC42
JENSEN, P., REL4, RELI7, RELI18 MATR16
JEWELL,
. S., MULT56
HULTS?, HULT58, MULT59
JOHN, J., TSP34
COMP20,
COMPi12
COMP18, COMP19,
JOHNSON, D., SP27, SP28. COMPl11
COMP21
IMP26,
JOHNSON, E L., SP29, HULT60, CPP18, CPP19, CPP20, CPP33,
IMP27
-66-
eterminlstic
Network Optimizationt A Blbllography
Index of Authors
Jg., TSP36
JOHNSON
S., TSP24, TSP25
JOHNSON,
SP26
JOKSCH, H,
N. O., EQUIL19
JORGENSON,
JR.,, CPP53
JUDGE, G. G., EQUIL34, EQUIL35
KAJITANI, V., MATR18
L., HULT61, HULT62
KANTOROVITCH,
KAREL9 C., TSP58
KARG, L., TSP50
IMP17, IMP18
O., IMP89 IMPI6,
KARNEY,
MSTJS5
TSP46,
TSP45,
t., MULTZOv CPP329 CPP34, TSP44,
KARP, R.
COMP23
COMP22,
COMP4,
COMP7,
IMP10,
MST16, MST2O,
ULT63
Jo,
KENNINGTON,
B., TSP57, HATR17
KERNIGHAN,
IMP25,
MST22,
MST21,
MST6,
A., SP23, REL19, REL38,
KERSHENBAUMH
IMP28, IMP29
8. M., LOC43
KHUMAWALA,
KIM, n., DES31
KIM9 Y., REL2O
KIRBY, R., SP30
KISHI, G., MATR18
GEN19
P.,
KIVESTU,
KLEE9 V., SP31, COMP24
IMP12
KLEIN, H., MULT64, TSP27,
KLEINROCK9 L., EQUIL,3
DES57,
OES34,
DES33,
0ES329
DES14,
MULT65
KLEITMAN, O. J.,
MATR13, MATR19
MULT66
.,
KLESSIG, R.
STI2,
KLINGMAN, O., SP1., MULT4Z9 MULT43, MULT67, MULT68, MST1I,
IMP2I,
MP20
IMP1q,
IPIB9
IMP87
IP16, I
IMP89
IMP3,
IMP22, IMP30
., DES35
KNIGHT9 U. G.
GEN21
KNUTH, 0., GEN2O,
T. C., MULT69
KOOPMANS,
TSP43
KRARUP, J.,
COMP25
K
KRAUSE
TSP59, TSP52
P.,
KROLAK,
ST23
TSP53,
KRUSKAL, J.,
KUEHN, A A., LOC44
CPP35, CPP36
HULT7j1
KUHN9 H. W., MULT70,
KULASH9 0., EQUIL20
S., SP40
KUMAR,
KUNDU, S., MATR20
KWAN, H. K., CPP37
SPI
R
LANGLEY
LASOON, L., MULT49
MATR22
MATR21,
LAWLER9 E. L., GEN22, TSP54l, COMP269 MATR20,
OES36, DES37
EQUIL21, EQUIL22,
LEBLANC, L. J.,
J.,
REL21
LEGGETT,
LEHMAN, A., MATR23
LEHRER. F., LOC22
-67-
Deterministic Network Oplimizaton
A Bibliography
Index of Authors
LEIBLING, T,
CPP38
LENSTRA, J.,
TSP55
LEVENTHAL, T., EQUIL23
LEVY, J.,
LOC45
LEWIS, P., TSP72, COMP29
LI S. Y., CPP34
LIEBMAN, J. C., LOC54
LIN, S., TSP56, TSP57, COMP27, MATRi?
LITTLE, J
D. C., TSP58
LIUV C., GEN23
LO, T., MST5
LOCKHART, S., CPP2O
LUBORE, S., MULT4
MAFFIOLI, F., TSPI4
MAGNANTI, T. L.·
TSP41
IMP1,
IMP249
MATR24
MAHESHWARI, S., LOC39
MAIER, S, MULT72, MULT73
HALONE, J.,
TSP8
MANHEIM, M., EQUIL24
MANNE
A S., LOC46
MARANZANA, F. E., LOC47
MARBLE, G., TSP51, COMP28
ARKOWITZ, H., SP21
MARKS, 0., CPP39, TSP49, LOC54
MARSTEN, R. E., LOC48
MARTIN, B., EQUIL24
MATHEMATICA, GEN24
MATULA, D., COMP28
MAUCERI, L., OES38
MAXWELL, M., LOC8
MAYEDA, W., REL22, MULT74
MCAULIFFE, G., REL13
MCELVAIN, K., TSP81
MERCHANT, O. K., EQUIL25
MILLER, C., TSP59
MILLER
L., TSP37
MILLS, G., SP32, SP33
MINIEKA, E., LOC49
MINTY, G. J., COMP24, MATR25
MINTY, J.,
MULT75
MIRCHANDANI, P. B
REL23, LOC50
MIRSKY
L., MATR26
MISRA, K., REL24, REL25
MOORE, E., REL26
MORLOK, E., EQUIL22
MORLOK, L. J.,
EQUILZ1
MORRISON, O. R., CPP40O
MOSKOWITZ, F., REL27
MOTZKIN,
. S., MULT16
MUARRAS, J. F., MULT77
MULLIN
R., SP5
IMP319
MATRI3,
MATR14,
-68-
A Bibliography
Deterministic Network Optlmizatlon
Index of Authors
IMP32, IMP33
MULVEY, J.,
MUNKRES, J., MULT78
J. 0., REL28, REL29, REL30, EQUIL26, MST24
MURCHLANOD
MURTY, K., CPP41, TSP58
McGUIRE, C. B., EQUILZ
NAPIER, A., SPl4, IMP18, IMP21, IMP30
NASH-WILLIAMS, C. S. J. A., MATR27
NEEBE, A. W., LOC28
J.,
TSP52
NELSOI,
EQUIL25,
EQUIL 239
SP34,
GEN13,
SP16,
NEHAUSER, G. L.
TSP42, LOCi1
NEWTON, R., TSP60
NGUYEN, H., TSP4I, TSP61, IMP24
EQUILIO, EQUILi, EQUILI2, EQUIL27, EQUIL28
NGUYEN, S.
NIJENHUIS, A., GEN26
NILSSON, N., SP19
NORMAN, R. Z., CPP42
OBRUCA, A., TSP62, MST25
OCHOA-ROSSO, F., DES39
ODONI, A. R., LOC5i
OLIVER, R. M., GEN27, SP38, EQUIL3i
ONAGA, K., MULT79
MULT1.06
ORDEN, A., HULT80
ORE, 0O. GEN25
ORLOFF, C., CPP43, TSP63, TSP64, TSP65
PADBERG. M., CPP44
PAN, A., SP45, MST29
SP35, IMP34
PAPE, U,
PARIKH, S., REL31
PARKER, R., TSPt, TSP48
D., CPP45
PAUL
PAVLEY, R., SP22, MSTV7
ES40
PEARMAN, A.,
PETERSON, E. L., EQUIL18. EQUIL29
PIERCE, A., SP36, TSP66, MST26
TSP6?
PIERCE, J.,
., EQUIL2
PIERSKALLA,
PINNELL, C., EQUIL30, DES4I
IMP35
PLA, J. M., MULT81,
SP37
POHL, I.,
GEN27, SP30 SP38, EQUIL3i
POTTS R B,
SP18
PRIESS, I.,
PRIM, R., MST27
PRITSKER, A., LOC52
PROSCHAN, F., REL2
PULLEYBLANK, W., CPP21, CPP46
QUANOT, R. E., TSP2, OES42
RABIN, H. 0., CPP42
RAJALA, J.,
LOC42
TSP26
RAMSER, J.,
RAO, M. R., MULT82, LOC28, COMP5
RAO, T., REL25
TSP9,
-69-
Deterministic Network Optimization
A Blbliography
Index of Authors
RAPHAEL
B., SPJ9
RATLIFF, H., MULT5
RAY, T Lt, LOC17, LOC22
RAYMONO, T.
TSP68
READ (ed.), R., GEN28
REED
J J.
LOC53
REED, Ho. REL33
REITER, S., MULT699, TSP69
REVELLE, C. S., LOC54, LOC55, LOC68
RIDLEY, T. M., DES43, DES44, DES45
RINNOOY KAN, A., TSP55
ROBACKER, J
T., MULT83
ROBBINS, J., TSP70
ROBERTS, R,
DES46
ROBERTS, S, TSP7i
ROGER, J., MST28
ROGERS, J., LOC70
ROSENKRANTZ
0
TSP72, COMP29
ROSENTHAL, A.· REL32
ROSS, G. R., MULT43, MST13
ROSS, G. T., MULT67
ROTA, G. C., MATR4
ROTHFARB, B.,
ULT84, MULT859 MULT86, OES47
ROTHSCHILDO,
B.
MULT87, MULT88
RUITER
E. R
EQUIL32
RUSSELL, R., MULT68, TSP73
SAATY T L, GEN3, GEN29
SAHNI, S., CONPiJ7
COMP30, COMP3I, CONP32
SAIGAL, R.,
ULTi2, MULT89
SAKAROVITCH, N., SP39, MULT90, MULT9I
SAKSENA, J., SP40
SALKIN
H., GEN30
SAMUELSON, P. A., EQUIL33
SATTERLY, G., EQUIL30
SAVAGE, S., TSP80
SCHRAGE, L., LOC59
SCHWARTZ, J. G., DES48
SCOTT, A. J., GEN3i, LOC56. LOC57, LOC58,
ES49,
SEN, O0 K., DES19
ODES52
ODES53
SEPPALA, Y., LOC60
SESHU, S., REL33
SHAMBLIN. J., TSP70
SHANNON, C. E., REL26,
ULT2I, MATR30O
SHAPIRO, D., TSP74
SHAPIRO, J
F
SP41, MULT92
SHAPLEY, L. S, REL9. MULT93,
ES2I
SHEIN
N P., MULT86
SHERMAN, G,
TSP69
SHIER, DO,
SP42, SP43, REL30
SIMPSON, R,
GENi9
SINERVO, H., LOC42
SINGER, S., LOC6j
DESSO,
OES51
-70-
Deterministic Network Optlmizatlon
A Bibliography
Index of Authors
SKEITH, R., LOCi2
SLATTERY, G. T., DES4i
SIITH, R., MULTI3
SOLAND9 R,
LOC62
SPEILBERG, K., LOC639 LOC64
SPELLHAN, R., TSP34
SPIRA, P., SP44, SP459 MST29,
COMP33
SPOSITO, V. A.9 EQUIL17
SRINIVASAN, V., IHP36, IMP37
ST. J. A, NASH-WILLIAMS, C., MATR289
STAIRS, S., OES54
MATR29
STANTON, R., SP5
STEARNS9 R., TSPT2t COMP29
STEENBRINK, P. A., DES55, OES56
STEFANEK, R., EQUIL39
STEIGLITZ9 K., OES57
STOCKMEYER, L., COMP12
STOECKER, A., EQUILI?
STOWERS, J. R., DES9
STRICKER9 R., CPP39, CPP47
STUTZ, J,
IMP89 IMP229 IMP30
SUURBALLE, J., REL34 MST30
SVESTKA, J., TSP75
SWAIN, R. n., LOC55, LOC65, LOC669 LOC68
SWEENEY, D., TSP58
SWEN, G.,
ST31
SWOVELAND, C., MULT94
SZWARC,
., ULT95
ULT96, MULT97, TSP83
TAKAYAMA, T.9 EQUIL34, EQUIL35, EQUIL36
TANG, O. T.,
ULT989 HULT99, MULT100, DES58
TARJAN, R
RELl4, RELI5, REL35, CPP28, COMPj5, COMP349 MATR3i
TEITZ, H. R., LOC67
THOHAS9, n. TSP60
THOMPSON, G., TSP50, IMP369 IMP37
TILLMAN, F., TSP76
TOMIZAWA, N., MULT101
TOMLIN, J. A., MULTO02, MULT103
TORREGAS, C., LOC68
TORRES, W., SP25
TROTTER, L,
EQUIL23
TRUSCOTT, WN, LOC69
TUCKER, A. W., MULTlO4, TSP59
TURNER, W., TSP70, TSP77
TUTTE, N, T., CPP48, CPP49, CPP50, MATR32, MATR33, MATR34
TYAGI, H., TSP78
TYNOALL, G., MULTi3
ULLMAN, J., COMPI, COMP21
URQUHART, R. J., CPP51
VAN SLYKE, R., REL1. REL19, REL36, REL379 REL38, MST22, IMP29
VAN VALKENBURG, H. E., MULT74
VEGA, J,
TSPj
VERBLUNSKY, S., TSP84
-71-
Deterministic Network Optimization
A Bbliography
Index of Authors
VERGIN R
LOC70
VIOLA9 P., LOC5
VON NEUMANN, J.,
MULTO05
VOTAW Jr.,
D. F., MULT106
WAGNER9 H.
., MULT107
WAGNER, R. A., MST8, LOC16
WANG,
.9 DES34
WATSON-GANDY, C., TSP29
WEBB HM., TSP79
WEINBERG, L., MATR3
WEINER, P., TSP809 OES57
WEINTRAUB, A., SP46
WEISCHEDEL, R., DES6
WELLS9 H., GEN32
WELSCH, D. J. A., MATR35, MATR36
WENDELL, R. E.
LOC71
WHINSTON, A.,
ULT87,
ULT88
WHITE, J. A., LOCZ5, LOC72
WHITE, L J
CPP529 MATR37
WHITE, W. W.9
ULT459 MULT46, MULT109
WHITNEY, H., MATR38
WIGAN, M., EQUIL37, EQUIL38
WILF, H., GEN26
WILKIE, 0., EQUIL39
WILKOV9 R., REL13, REL39
WILLIAMS, A. C., MULT108
WILLIAMS, K.,
STO
WILLIAMS, T., SP47
WILSON, A., EQUIL4O
WING, O., REL40, HST32
WINSTEN, C. B8,
EQUIL2
WIORKOWSKI, J,
TSP81
WITZGALL, C., SP13, CPP53
IP15
WOLFE, P,
TSP47, LOC2
WOLLMER, R. O., MULTIIG
WONG9 R., OES59
WOOLAN0, A. D., EQUIL36
WREN, A., TSP82
WRIGHT, J., TSP22
YAGE0, B., MULT111
YANG, Y., MST32
YAO, A,
MST33
YAU9 S., REL8
YEE J
LOC73
YELLOW, P., TSP85
YEN, J.,
SP48, SP49, SP50, IMP38
ZADEH
N.,
ULTl12, HULTI13, OES60
DES61,
ZAHN, C. T., CPP53, MST34
ZANGWILL, W. I.,
MULTJ4
ZELKOWITZ, M., GEN33
ZEMLIN, R., TSP59
ZIONTS
S., MULT82
COMP35,
COMP36
COMP37