% This file was created with JabRef 2.7.2.
% Encoding: Cp1252

@STRING{DECA = {Decision Anal.}}

@STRING{EJOR = {Eur. J. Oper. Res.}}

@STRING{IJOC = {INFORMS J. Comput.}}

@STRING{INTE = {Interfaces}}

@STRING{ISRE = {Inform. Systems Res.}}

@STRING{JOTA = {J. Optim. Theory Appl.}}

@STRING{LAA = {Linear Algebra Appl.}}

@STRING{MC = {Math. Comput.}}

@STRING{MNSC = {Management Sci.}}

@STRING{MOOR = {Math. Oper. Res.}}

@STRING{MP = {Math. Programming}}

@STRING{MPA = {Math. Programming, Ser.˜A}}

@STRING{MPB = {Math. Programming, Ser.˜B}}

@STRING{MPS = {Math. Programming Stud.}}

@STRING{MSOM = {Manufacturing Service Oper. Management}}

@STRING{NUMMATH = {Numer. Math.}}

@STRING{OPRE = {Oper. Res.}}

@STRING{ORSAC = {ORSA J. Comput.}}

@STRING{ORSC = {Organ. Sci.}}

@STRING{SIAPM = {SIAM J. Appl. Math.}}

@STRING{SIC = {SIAM J. Comput.}}

@STRING{SICON = {SIAM J. Control Optim.}}

@STRING{SINUM = {SIAM J. Numer. Anal.}}

@STRING{SIOPT = {SIAM J. Optim.}}

@STRING{SIREV = {SIAM Rev.}}

@STRING{SISC = {SIAM J. Sci. Comput.}}

@STRING{TOMS = {ACM Trans. Math. Software}}

@STRING{TR = {Transportation Res.}}

@STRING{TRA = {Transportation Res. A}}

@STRING{TRB = {Transportation Res. B}}

@STRING{TRC = {Transportation Res. C}}

@STRING{TRSC = {Transportation Sci.}}

@BOOK{ahuj.magn.ea93,
  title = {Network Flows},
  publisher = {PrenticeHall, Inc},
  year = {1993},
  author = {Ahuja, R. K. and Magnanti, T. L. and Orlin, J. B.},
  address = {Upper Saddle River, NJ, USA}
}

@TECHREPORT{alon91,
  author = {Noga Alon and Zvi Galil and Oded Margalit},
  title = {On the Exponent of the All Pairs Shortest Path Problem},
  institution = {Tel Aviv University},
  year = {1991}
}

@MISC{barn.john.ea96,
  author = {C. Barnhart and E. Johnson and G. Nemhauser and M. Savelsbergh and
	P. Vance},
  title = {Branch-and-price: Column generation for solving huge integer programs},
  year = {1996},
  text = {Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W.
	P.,
	
	
	 and Vance, P. H. Branch-and-price: Column generation for solving
	huge integer
	
	
	 programs. Opns. Res. (1996).},
  url = {citeseer.ifi.unizh.ch/barnhart96branchprice.html}
}

@BOOK{baza.jarv.ea90,
  title = {Linear Programming and Network Flows},
  publisher = {John Wiley \& Sons},
  year = {1990},
  author = {Bazaraa, M. S. and Jarvis, J. J. and Sherali, H. D.}
}

@ARTICLE{bell58,
  author = {Bellman, R.},
  title = {On routing problem},
  journal = {Quarterly of Applied Mathematics},
  year = {1958},
  volume = {16},
  pages = {87--90},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@BOOK{bell57,
  title = {Dynamic Programming},
  publisher = {Princeton University Press},
  year = {1957},
  author = {R. Bellman},
  address = {Princeton, New Jersey}
}

@ARTICLE{bend62,
  author = {Benders, J.},
  title = {Partitioning procedures for solving mixed-variables programming problems},
  journal = {Numerische Mathematik},
  year = {1962},
  volume = {4},
  pages = {238--252},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@BOOK{bert95,
  title = {Dynamic Programming and Optimal Control},
  publisher = {Athena Scientific},
  year = {1995},
  author = {Bertsekas, D.},
  address = {Belmont, Massachusetts}
}

@ARTICLE{bert.tsit91,
  author = {Bertsekas, Dimitri P. and Tsitsiklis, John N. },
  title = {An Analysis of Stochastic Shortest Path Problems},
  journal = {Mathematics of Operations Research},
  year = {1991},
  volume = {16},
  pages = {580-595}
}

@BOOK{bert.tsit97,
  title = {Introduction to Linear Optimization},
  publisher = {M.I.T.},
  year = {1997},
  editor = {Athena Scientific, Belmont, Massachusetts},
  author = {Dimitris Bertsimas and Tsitsiklis, John},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.27}
}

@MANUAL{tran85D,
  title = {Lineamientos para el dise{\~n}o de un nuevo sistema de rutas de transporte
	p{\'u}blico para la ciudad de Santa F{\'e} de Bogot{\'a}. Informe
	Final},
  author = {Bocarejo H., Pablo E.},
  organization = {Alcald{\'\i}a Mayor de Bogot{\'a}. DNP, BCEOM. Ingenieros Consultores
	\& Cia.},
  month = {Febrero},
  year = {1998},
  howpublished = {0085D},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.18}
}

@ARTICLE{braum.shier89,
  author = {J. Brumbaugh-Smith and D. Shier},
  title = {An Empirical Investigation of Some Bicriterion Shortest Path Algorithms},
  journal = {European Journal of Operational Research},
  year = {1989},
  volume = {43},
  pages = {216-224}
}

@TECHREPORT{char00,
  author = {Peerayuth Charnsethiku and Krit Virojsailee},
  title = {The Linear Constrained Maximun Capacity Path Problem},
  institution = {Industrial Engineering Departament, Kasetsart University},
  year = {2000},
  address = {Bagkok, Thailand}
}

@CONFERENCE{dant67,
  author = {Dantzig, G.},
  title = {All shortest routes in a graph},
  booktitle = {in theory Graphs (international symposium, Rome)},
  year = {1967},
  pages = {91--92},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@ARTICLE{dant.wolf61,
  author = {Dantzig, G. and Wolfe, P.},
  title = {The descomposition algorithm for linear programs.},
  journal = {Econometrica},
  year = {1961},
  volume = {29},
  pages = {767--778},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@ARTICLE{dijk59,
  author = {Dijkstra, E.},
  title = {A note on two problems in connection with graphs},
  journal = {Numerische Mathematik},
  year = {1959},
  volume = {1},
  pages = {269--271},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@ARTICLE{evan83,
  author = {Evans, J.},
  title = {A network decomposition, agregation procedure for a class of multicommodity
	transportation problem.},
  journal = {Networks},
  year = {1983},
  volume = {12},
  pages = {197--205},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@ARTICLE{evan81,
  author = {Evans, J.},
  title = {The multicommodity assigment problem: a network aggregation heuristic.},
  journal = {Computer \& Mathematics with Applications.},
  year = {1981},
  volume = {7},
  pages = {187--194},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@BOOK{evan.gari92,
  title = {Measure theory and fine properties of functions},
  publisher = {CRC Press},
  year = {1992},
  author = {Evans, Lawrence C. and Gariepy, Ronald F.},
  pages = {viii+268},
  address = {Boca Raton, FL},
  isbn = {0-8493-7157-0},
  mrclass = {28-02 (26-02 26Bxx 46E35)},
  mrnumber = {93f:28001},
  mrreviewer = {R. G. Bartle}
}

@TECHREPORT{ford56,
  author = {Ford Jr, L.},
  title = {Network Flow theory},
  institution = {Santa Monica, California: The RAND Corp.},
  year = {1956},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@BOOK{ford.fulk62,
  title = {Flows in networks},
  publisher = {Princton University Press.},
  year = {1962},
  author = {Ford Jr., L. R. and Fulkerson, D. R.},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@MISC{guro14,
  author = {{Gurobi Optimizaton}},
  title = {Gurobi Optimizer Reference Manual},
  year = {2014},
  url = {http://www.gurobi.com}
}

@MISC{cple15,
  author = {{CPLEX Optimizer}},
  title = {Gurobi Optimizer Reference Manual},
  year = {2015},
  url = {http://www-03.ibm.com/software/products/en/ibmilogcpleoptistud}
}

@ARTICLE{karp75,
  author = {Karp, R.},
  title = {On the computational complexity of combinatorial problems},
  journal = {Networks},
  year = {1975},
  volume = {5},
  pages = {45--68},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@BOOK{lasd70,
  title = {Optimization theory for large system},
  publisher = {Dover Publications},
  year = {1970},
  author = {Lasdon, L. S.},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@PROCEEDINGS{moor57,
  title = {The shortest path through a maze},
  year = {1957},
  editor = {Proceedings of the international symposium on theory of switching.
	Part II},
  publisher = {The annals of the computation laboratory of Hardvard University},
  author = {Moore, E.},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@INPROCEEDINGS{saun.taka05,
  author = {Shane Saunders and Tadao Takaoka},
  title = {Efficient algorithms for solving shortest paths on nearly acyclic
	directed graphs},
  booktitle = {CRPIT '41: Proceedings of the 2005 Australian symposium on Theory
	of computing},
  year = {2005},
  pages = {127--131},
  address = {Darlinghurst, Australia, Australia},
  publisher = {Australian Computer Society, Inc.},
  isbn = {1-920682-23-6},
  location = {Newcastle, Australia}
}

@ARTICLE{seym81,
  author = {Seymour, P.},
  title = {Matroids and multicommodity flows},
  journal = {European Journal of combinatorics},
  year = {1981},
  volume = {2},
  pages = {257--290},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@ARTICLE{shap96,
  author = {Shapiro, Alexander},
  title = {Simulation-based optimization---convergence analysis and statistical
	inference},
  journal = {Comm. Statist. Stochastic Models},
  year = {1996},
  volume = {12},
  pages = {425--454},
  number = {3},
  coden = {CSSME8},
  fjournal = {Communications in Statistics. Stochastic Models},
  issn = {0882-0287},
  mrclass = {90C15 (62L20 65K05)},
  mrnumber = {97m:90062},
  mrreviewer = {C. Bergthaller}
}

@ARTICLE{toml66,
  author = {Tomlin, J.},
  title = {Minimun costo multicommodity network flows.},
  journal = {Operations reseach},
  year = {1966},
  volume = {14(1)},
  pages = {45--51},
  owner = {Juan Camilo Acero},
  timestamp = {2005.12.14}
}

@comment{jabref-meta: selector_author:mass.whit93;}
