%===========================================================================%
%                                                                           %
% This file is part of the documentation for the SYMPHONY MILP Solver.      %
%                                                                           %
% SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and         %
% Laci Ladanyi (ladanyi@us.ibm.com).                                        %
%                                                                           %
% (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved.                  %
%                                                                           %
% SYMPHONY is licensed under the Eclipse Public License. Please see         %
% accompanying file for terms.                                              %
%                                                                           %
%===========================================================================%

\begin{thebibliography}{9}

%\bibitem{amdahl}{\sc G.M. Amdahl},
%{\em Validity of the Single-processor Approach to Achieving
%Large-scale Computing Capabilities}, In {\em AFIPS Conference
%Proceedings} {\bf 30} (Atlantic City, N.J., April 18-20), AFIPS 
%Press (1967), 483.

\bibitem{climaco97}
{\sc J.~Climaco, C.~Ferreira, and M.~E. Captivo},
{\em Multicriteria integer programming: an overview of different
  algorithmic approaches},
in J.~Climaco, editor, Multicriteria Analysis,
  Springer, Berlin (1997), 248.

\bibitem{concorde}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook},
{\em On the solution of traveling salesman problems}, Documenta
Mathematica Journal der Deutschen Mathematiker-Vereinigung,
International Congress of Mathematicians (1998), 645.

\bibitem{concorde2}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook},
{\em CONCORDE TSP Solver}, available at 
{\tt www.keck.caam.rice.edu/concorde.html}.

%\bibitem{ABCC}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook},
%{\em Finding Cuts in the TSP}, DIMACS Technical Report 95-05 (1995).

%\bibitem{AMS}{\sc Y. Agarwal, K. Mathur, and H.M. Salkin},
%{\em Set Partitioning Approach to Vehicle Routing}, Networks {\bf 7}
%(1989), 731.

%\bibitem{AKMP}{\sc J.R. Araque, G. Kudva, T.L. Morin, and J.F. Pekny},
%{\em A Branch-and-Cut Algorithm for Vehicle Routing Problems}, Annals
%of Operations Research {\bf 50} (1994), 37.

%\bibitem{AHM}{\sc J.R. Araque, L. Hall, and T. Magnanti},
%{\em Capacitated Trees, Capacitated Routing and Associated Polyhedra},
%Discussion paper 9061, CORE, Louvain La Nueve (1990).

%\bibitem{ABBCNR2}{\sc P. Augerat, J.M. Belenguer, E. Benavent, A.
%Corber\'{a}n, and D. Naddef}, {\em Separating Capacity Constraints in the
%CVRP Using Tabu Search}, European Journal of Operations Research, {\bf
%106} (1998), 546.

%\bibitem{ABBCNR}{\sc P. Augerat, J.M. Belenguer, E. Benavent, A.
%Corber\'{a}n, D. Naddef, and G. Rinaldi}, {\em Computational Results with
%a Branch and Cut Code for the Capacitated Vehicle Routing Problem},
%Research Report 949-M, Universit\'e Joseph Fourier, Grenoble, France.

\bibitem{MIPO} {\sc E. Balas, S. Ceria, and G. Cornu\'ejols}, {\em Mixed
0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework},
Management Science {\bf 42} (1996), 9.

%\bibitem{BP76} {\sc E. Balas and M.W. Padberg}, {\em Set Partitioning:
%A Survey}, SIAM Review {\bf 18} (1976), 710.

\bibitem{christo}{\sc E. Balas and P. Toth},
{\em Branch and Bound Methods}, in E.L. Lawler, J.K. Lenstra,
A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman
Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York
(1985), 361.

%\bibitem{B&Q}{\sc M.L. Balinski and R.E. Quandt},                            
%{\em On an Integer Program for a Delivery Problem},                   
%Operations Research {\bf 12} (1964), 300.

%\bibitem{volume} {\sc F. Barahona and R. Anbil}, {\em The Volume
%Algorithm: Producing Primal Solutions with a Subgradient Method},
%Mathematical Programming {\bf 87} (2000), 385.

\bibitem{B&PII} {\sc C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P.
Savelsbergh, and P.H. Vance}, {\em Branch-and-Price: Column Generation for 
Huge Integer Programs}, Operations Research {\bf 46} (1998), 316. 

\bibitem{BoB}{\sc M. Benchouche, V.-D. Cung, S. Dowaji, B. Le Cun, T.
Mautor, and C. Roucairol}, {\em Building a Parallel Branch and Bound
Library}, in Solving Combinatorial Optimization Problems in Parallel,
Lecture Notes in Computer Science {\bf 1054}, Springer, Berlin (1996), 201.

%\bibitem{B&H}{\sc U. Blasum and W. Hochst\"attler}, {\em Application of
%the Branch and Cut Method to the Vehicle Routing Problem}, Zentrum
%f\"ur Angewandte Informatik K\"oln Technical Report zpr2000-386 (2000).

%\bibitem{BB&G}{\sc R.L. Boehning, R.M. Butler, and B.E. Gillet}, {\em A
%Parallel Integer Linear Programming Algorithm}, European Journal of
%Operations Research {\bf 34} (1988), 393.

%\bibitem{BOR97}{\sc R. Bornd\"orfer}, {\em Aspects of Set Packing,
%Patitioning, and Covering}, PhD. Dissertation, Technischen
%Universit\"at Berlin (1997).

%\bibitem{CCM}{\sc V. Campos, A. Corber\'{a}n, and E. Mota}, {\em
%Polyhedral Results for a Vehicle Routing Problem}, European Journal of
%Operations Research {\bf 52} (1991), 75.

\bibitem{bowman76}
{\sc V.~J. Bowman},
{\em On the relationship of the Tchebycheff norm and the efficient
  frontier of multiple-criteria objectives},
in H.~Thieriez, editor, Multiple Criteria Decision Making,
Springer, Berlin (1976), 248.

\bibitem{FATCOP}{\sc Q. Chen and M.C. Ferris}, {\em FATCOP: A Fault
Tolerant Condor-PVM Mixed Integer Programming Solver}, University of
Wisconsin CS Department Technical Report 99-05, Madison, WI (1999).

%\bibitem{C&E}{\sc N. Christofides and S. Eilon},                 
%{\em An Algorithm for the Vehicle Dispatching Problem},           
%Operational Research Quarterly {\bf 20} (1969), 309.                

%\bibitem{CM&T}{\sc N. Christofides, A. Mingozzi, and P. Toth},           
%{\em Exact Algorithms for Solving the Vehicle Routing Problem Based on
%Spanning Trees and Shortest Path Relaxations},                   
%Mathematical Programming {\bf 20} (1981), 255.

%\bibitem{chvatal}{\sc V. Chv\'atal}, 
%{\em Linear Programming},
%W.H. Freeman and Company, San Francisco (1983).

%\bibitem{C&H}{\sc G. Cornu\'ejols and F. Harche},
%{\em Polyhedral Study of the Capacitated Vehicle Routing Problem},
%Mathematical Programming {\bf 60} (1993), 21. 

\bibitem{coin-or}{\em Common Optimization INterface for Operations
Research}, {\tt http://www.coin-or.org}.

\bibitem{bc-opt}{\sc C. Cordier, H. Marchand, R. Laundy, and L.A. Wolsey},
{\em bc-opt: A Branch-and-Cut Code for Mixed Integer Programs},
Mathematical Programming {\bf 86} (1999), 335.

\bibitem{cplex} 
{\em ILOG CPLEX 6.5 Reference Manual}, ILOG (1994).

%\bibitem{C&P}{\sc H. Crowder and M. Padberg}, 
%{\em Solving Large Scale Symmetric Traveling Salesman Problems to
%Optimality}, Management Science {\bf 26} (1980), 495.

%\bibitem{large01}{\sc H. Crowder, E.L. Johnson, and M. Padberg}, 
%{\em Solving Large-Scale Zero-One Linear Programming Problems},
%Operations Research {\bf 31} (1983), 803.

%\bibitem{CJ&R}{\sc F.H. Cullen, J.J. Jarvis, and H.D. Ratliff},
%{\em Set Partitioning Based Heuristic for Interactive Routing},         
%Networks {\bf 11} (1981), 125.                                           

%\bibitem{CDCMR}{\sc V.-D. Cung, S. Dowaji, B. Le Cun, T. Mauthor, and
%C. Roucairol}, {\em Concurrent Data Structures and Load Balancing
%Strategies for Parallel Branch and Bound/A* Algorithms}, DIMACS Series
%in Discrete Optimization and Theoretical Computer Science {\bf 30}
%(1997), 141.

%\bibitem{D&R}{\sc G.B. Dantzig and J.H. Ramser},                         
%{\em The Truck Dispatching Problem},
%Management Science {\bf 6} (1959), 80.                               

%\bibitem{eckstein}{\sc J. Eckstein}, {\em Parallel Branch and Bound
%Algorithms for General Mixed Integer Programming on the CM-5}, SIAM
%Journal on Optimization {\bf 4} (1994), 794.

%\bibitem{eckstein2}{\sc J. Eckstein}, {\em How Much Communication Does
%Parallel Branch and Bound Need?}, INFORMS
%Journal on Computing {\bf 9} (1997), 15.

\bibitem{PICO}{\sc J. Eckstein, C.A. Phillips, and W.E. Hart}, {\em
PICO: An Object-Oriented Framework for Parallel Branch and Bound},
RUTCOR Research Report 40-2000, Rutgers University, Piscataway, NJ (2000).

\bibitem{ehrgott00}
{\sc M.~Ehrgott and X.~Gandibleux},
{\em A survey and annotated bibliography of multiobjective combinatorial
  optimization}, OR Spektrum \textbf{22} (2000), 425.

\bibitem{ehrgott02}
{\sc M.~Ehrgott and X.~Gandibleux},
{\em Multiobjective combinatorial optimization---theory, methodology and
  applications},
in M.~Ehrgott and X.~Gandibleux, editors, Multiple Criteria
  Optimization---State of the Art Annotated Bibliographic Surveys, Kluwer
  Academic Publishers, Boston, MA (2002), 369.

\bibitem{ehrgott04}
{\sc M.~Ehrgott and M.~M. Wiecek}, {\em Multiobjective programming}, 
in M.~Ehrgott, J.~Figueira, and S.~Greco, editors, Multiple
  Criteria Decision Analysis: State of the Art Surveys, Springer, Berlin,
  Germany (2005), 667.

\bibitem{Marta}{\sc M. Es\H{o}},
{\em Parallel Branch and Cut for Set Partitioning},
Ph.D. Dissertation, Field of Operations Research,
Cornell University, Ithaca, NY (1999).

\bibitem{eswaran89}
{\sc P.~K. Eswaran, A.~Ravindran, and H.~Moskowitz},
{\em Algorithms for nonlinear integer bicriterion problems},
Journal of Optimization Theory and Applications \textbf{63} (1989), 261.

%\bibitem{fisher}{\sc M.L. Fisher},                                           
%{\em Optimal Solution of Vehicle Routine Problems Using Minimum k-Trees},
%Operations Research {\bf 42} (1988), 141.

%\bibitem{F&J}{\sc M.L. Fisher and R. Jaikumar},
%{\em A Generalized Assignment Heuristic for Solving the VRP},
%Networks {\bf 11} (1981), 109.

%\bibitem{F&R}{\sc B.A. Foster and D.M. Ryan},     
%{\em An Integer Programming Approach to the Vehicle Scheduling Problem},
%Operational Research Quarterly {\bf 27} (1976), 367.                     

%\bibitem{G&J}{\sc M.R. Garey and D.S. Johnson}, 
%{\em Computers and Intractability: A Guide to the Theory of
%NP-Completeness},
%W.H. Freeman and Co., San Francisco (1979).                

%\bibitem{G&N}{\sc R.S. Garfinkel and G.L. Nemhauser},
%{\em Integer Programming},
%Wiley, New York (1972).

\bibitem{pvm}{\sc A. Geist et al.},
{\em PVM: Parallel Virtual Machine, A User's Guide and Tutorial for
Networked Parallel Computing},
MIT Press, Cambridge, MA (1994).

\bibitem{G&C}{\sc B. Gendron and T.G. Crainic},
{\em Parallel Branch and Bound Algorithms: Survey and Synthesis},
Operations Research {\bf 42} (1994), 1042. 

%\bibitem{G&VL}{\sc G.H. Golub and C.F. Van Loan},
%{\em Matrix Computations},
%The Johns Hopkins University Press, Baltimore (1989).

\bibitem{geoff68}
{\sc A.~M. Geoffrion},
{\em Proper efficiency and the theory of vector maximization},
Journal of Mathematical Analysis and Applications \textbf{22} (1968), 618.

\bibitem{GJ&R}{\sc M. Gr\"otschel, M. J\"unger, and G. Reinelt}, {\em
A Cutting Plane Algorithm for the Linear Ordering Problem}, Operations
Research {\bf 32} (1984), 1155.

\bibitem{G&K}{\sc A. Grama and V. Kumar}, {\em Parallel Search
Algorithms for Discrete Optimization Problems}, ORSA Journal on
Computing {\bf 7} (1995), 365.

%\bibitem{gustafson}{\sc J.L. Gustafson},
%{\em Re-evaluating Amdahl's Law}, Communications of the ACM {\bf 31}
%(1988), 532.

%\bibitem{H&K}{\sc M. Held and R.M. Karp},                             
%{\em The Traveling Salesman Problem and Minimal Spanning Trees},
%Operations Research {\bf 18} (1969), 1138.                 

\bibitem{H&P}{\sc K. Hoffman and M. Padberg}, 
{\em LP-Based Combinatorial Problem Solving},
Annals of Operations Research {\bf 4} (1985/86), 145.

%\bibitem{HP93}{\sc K. Hoffman and M. Padberg}, {\em Solving Airline
%Crew Scheduling Problems by Brandh-and-cut}, Management Science {\bf
%39} (1993), 657. 

\bibitem{abacus1} {\sc M. J\"unger and S. Thienel}, {\em The ABACUS System
for Branch and Cut and Price Algorithms in Integer Programming and
Combinatorial Optimization}, Software Practice and Experience {\bf 30}
(2000), 1325.

\bibitem{abacus}{\sc M. J\"unger and S. Thienel}, {\em Introduction to
ABACUS---a branch-and-cut system}, Operations Research Letters {\bf
22} (1998), 83.

%\bibitem{JRT} {\sc M. J\"unger, G. Reinelt, and S. Thienel}, {\em
%Practical Problem Solving with Cutting Plane Algorithms in
%Combinatorial Optimization}, DIMACS Series in Discrete Mathematics and
%Theoretical Computer Science, American Mathematical Society (1995), 111.

%\bibitem{KK}  {\sc R.M. Karmarkar and G.S. Karp}, {\em The
%differencing method of set partitioning}, Report No. UCB/CSD 82/113, 
%Computer Science Division, University of California, Berkeley, CA (1982).

%\bibitem{kozen}{\sc D.C. Kozen},
%{\em The Design and Analysis of Algorithms},
%Springer-Verlag, New York (1992).

%\bibitem{Leo}{\sc L. Kopman},
%{\em A New Generic Separation Algorithm and Its Application to the
%Vehicle Routing Problem},
%Ph.D. Dissertation, Field of Operations Research,
%Cornell University, Ithaca, NY (1999).

\bibitem{K&R}{\sc V. Kumar and V.N. Rao}, {\em Parallel Depth-first
Search. Part II. Analysis.}, International Journal of Parallel
Programming {\bf 16} (1987), 501.

%\bibitem{K&G}{\sc V. Kumar and A. Gupta}, {\em Analyzing Scalability
%of Parallel Algorithms and Architectures}, Journal of Parallel and
%Distributed Computing {\bf 22} (1994), 379.

%\bibitem{Lthesis}{\sc L. Lad\'{a}nyi},
%{\em Parallel Branch and Cut and Its Application to the
%       Traveling Salesman Problem},
%Ph.D. Dissertation, Field of Operations Research,
%Cornell University, Ithaca, N.Y., U.S.A. (1996).

%\bibitem{LN}{\sc G. Laporte and Y. Nobert}, {\em Comb Inequalities for
%the Vehicle Routing Problem}, Methods of Operations Research {\bf 51}
%(1981), 271.

%\bibitem{LN&D}{\sc G. Laporte, Y. Nobert, and M. Desrouchers},
%{\em Optimal Routing with Capacity and Distance Restrictions},
%Operations Research {\bf 33} (1985), 1050.                               

\bibitem{symphony1}{\sc L. Lad\'{a}nyi, T.K. Ralphs, and L.E. Trotter},
{\em Branch, Cut, and Price: Sequential and Parallel},
Computational Combinatorial Optimization, D. Naddef and M.
J\"unger, eds., Springer, Berlin (2001), 223.

\bibitem{ALPS}{\sc L. Lad\'{a}nyi, T.K. Ralphs, and M.J. Saltzman},
{\em A Library Hierarchy for Implementing Scalable Parallel Search Algorithms},
available at {\tt http://www.lehigh.edu/\~{ }tkr2/pubs.html}

%\bibitem{Laursen}{\sc P. Laursen}, {\em Can Parallel Branch and Bound
%without Communication Be Effective?}, {\bf 4} (1994), 288.

%\bibitem{tspbook}{\sc E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy
%Kan, and D.B. Shmoys},
%{\em The Traveling Salesman Problem: A Guided
%Tour of Combinatorial Optimization},
%Wiley, New York (1985).

%\bibitem{LEL}{\sc A.N. Letchford, R.W. Eglese, and J. Lysgaard}, {\em
%Multi-star Inequalities for the Vehicle Routing Problem}, Technical
%Report available at {\tt http://www.lancs.ac.uk/staff/letchfoa/pubs.htm}.

\bibitem{PARINO}{\sc J. Linderoth},
{\em Topics in Parallel Integer Optimization},
Ph.D. Dissertation, School of Industrial and Systems Engineering,
Georgia Institute of Technology, Atlanta, GA (1998).

\bibitem{GLPK}
{\sc A.~Makhorin}, {\em Introduction to GLPK}, available at 
\texttt{http://www.gnu.org/software/glpk/glpk.html} (2004).

%\bibitem{marsten}{\sc R. Marsten},
%{\em The Design of The XMP Linear Programming Library},
%ACM Transactions on Mathematical Software {\bf 7} (1981), 481. 

\bibitem{SIP}{\sc A. Martin}, {\em Integer Programs with Block
Structure}, Habilitation Thesis, Technical University of Berlin,
Berlin, Germany (1998). 

%\bibitem{N&R}{\sc D. Naddef and G. Rinaldi}, {\em Branch and Cut}, in
%P. Toth and D. Vigo, eds., Vehicle Routing, SIAM (2000).

%\bibitem{N&I}{\sc H. Nagamochi and T. Ibaraki},
%{\em Computing Edge Connectivity in Multigraphs and Capacitated Graphs},
%SIAM Journal of Discrete Mathematics {\bf 5} (1992), 54. 

\bibitem{MINTO}{\sc G.L. Nemhauser, M.W.P. Savelsbergh, and G.S.
Sigismondi}, {\em MINTO, a Mixed INTeger Optimizer}, Operations
Research Letters {\bf 15} (1994), 47. 

\bibitem{N&W}{\sc G.L. Nemhauser and L.A. Wolsey}, 
{\em Integer and Combinatorial Optimization}, Wiley, New York (1988).

\bibitem{P&R}{\sc M. Padberg and G. Rinaldi}, 
{\em A Branch-and-Cut Algorithm for the Resolution of Large-Scale
Traveling Salesman Problems},
SIAM Review {\bf 33} (1991), 60.

%\bibitem{R&C}{\sc R. Radaramanan and L. Choi},                  
%{\em A Branch and Bound Algorithm for Solving the Vehicle Routing
% Problem}, Proceedings of the 8th Annual Conference on Computers and
%Industrial Engineering, 236.

%\bibitem{vrp-paper}{\sc T.K. Ralphs, L. Kopman, W.R.
%Pulleyblank, and L.E. Trotter Jr.},
%{\em On the Capacitated Vehicle Routing Problem},
%submitted for publication.

\bibitem{thesis}{\sc T.K. Ralphs}, 
{\em Parallel Branch and Cut for Vehicle Routing},
Ph.D. Dissertation, Field of Operations Research,
Cornell University, Ithaca, NY (1995).

\bibitem{symphony-future}{\sc T.K. Ralphs and L. Lad\'{a}nyi},
{\em Computational Experience with Branch, Cut, and Price: Sequential
and Parallel}, in preparation.

\bibitem{symphony}{\sc T.K. Ralphs and L. Lad\'{a}nyi},
{\em SYMPHONY: A Parallel Framework for Branch and Cut},
White paper, Rice University (1999).

\bibitem{WCN}{\sc T.K. Ralphs, M.J. Saltzman, and M.M. Wiecek},
{\em An Improved Algorithm for Biobjective Integer Programming},
to appear in the Annals Of Operations Research (2004).

%\bibitem{repository}{\sc T.K. Ralphs}, {\em Repository of Vehicle
%Routing Problem Instances}, available at {\tt
%http://www.BranchAndCut.org/VRP}. 

\bibitem{R&K}{\sc V.N. Rao and V. Kumar}, {\em Parallel Depth-first
Search. Part I. Implementation.}, International Journal of Parallel
Programming {\bf 16} (1987), 479.

%\bibitem{tsplib}{\sc G. Reinelt},
%{\em TSPLIB---A traveling salesman problem library}, ORSA Journal on
%Computing {\bf 3} (1991), 376. Update available at
%{\tt http://www.crpc.rice.edu/softlib/tsplib/}.

%\bibitem{R&N}{\sc R. Rushmeier and G. Nemhauser}, {\em Experiments
%with Parallel Branch and Bound Algorithms for the Set Covering
%Problem}, Operations Research Letters {\bf 13} (1993), 277.

%\bibitem{B&P}{\sc M.W.P. Savelsbergh}, 
%{\em A Branch-and-Price Algorithm for the Generalized
%Assignment Problem}, Operations Research {\bf 45} (1997), 831.

%\bibitem{schrijver}{\sc A. Schrijver}, 
%{\em Theory of Linear and Integer Programming}, Wiley, New York (1986).

\bibitem{PUBB}{\sc Y. Shinano, M. Higaki, and R. Hirabayashi}, {\em
Generalized Utility for Parallel Branch and Bound Algorithms},
Proceedings of the 1995 Seventh Symposium on Parallel and Distributed
Processing, IEEE Computer Society Press, Los Alamitos, CA (1995), 392.

\bibitem{PUBB2}{\sc Y. Shinano, K. Harada, and R. Hirabayashi}, {\em
Control Schemes in a Generalized Utility for Parallel Branch and
Bound}, Proceedings of the 1997 Eleventh International Parallel
Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA
(1997), 621.

%\bibitem{bob} {\sc R.H. Storer}, {\em Extensions of and Uses of the 
%Differencing Method for Number Partitioning}, Report No. 99T-09, 
%Industrial and Manufacturing Systems Engineering Department, Lehigh
%University (1999).

%\bibitem{bob2} {\sc R.H. Storer}, {\em Partially Complete Paper on
%Multi-Criteria Number Partitioning}, Partial Report 20T, Industrial and
%Manufacturing Systems Engineering Department, Lehigh University
%(2000).

%\bibitem{bobandjoe} {\sc R.H. Storer and J.C. Hartman}, {\em The
%Static Container Loading Problem with Dynamic Loading
%Considerations}, submitted to Transportation Science.

\bibitem{solanki91}
{\sc R.~Solanki},
{\em Generating the noninferior set in mixed integer biobjective linear
  programs: an application to a location problem},
Computers and Operations Research \textbf{18} (1991), 1.

\bibitem{PPBB-Lib}{\sc S. Tsch\"oke and T. Polzer}, {\em Portable
Parallel Branch and Bound Library User Manual, Library Version 2.0},
Department of Computer Science, University of Paderborn.

%\bibitem{CTP} {\sc F.J. Vasko, R.S. Barbieri, K.L. Reitmeyer, K.L.
%Scott}, {\em The Cable Trench Problem: Combining the Shortest Path and
%Minimum Spanning Tree Problems}, Research Report, Kutztown University,
%Kutztown, PA.

\end{thebibliography}
