Latex Why are my references empty

manpreet Best Answer 2 years ago

I am having a difficult time figuring out why my reference list after exporting a bibtex file from refworks. My tex code consists of one master file that ties together a set of files that contain the relevant text for the different sections of my document. Please see below for the combined tex code (after replacing all input statements with the relevant code) and the bib file.

Tex file:

\documentclass[11pt,twoside]{article}
\usepackage{apacite}

\begin{document}

% title page. Edit as needed for future publications. 
\title{Research Proposal}
\author{Teererai Marange \\
Department of Computer Science \\
University of Auckland\\
\texttt{t.marange@auckland.ac.nz}}
\date{January 26, 2017}
\maketitle
% end title page. 

% abstract goes here
\newpage
\begin{abstract}
Abstract goes here 
\end{abstract}
\newpage


% table of contents 
\tableofcontents
\newpage


%begin introduction 
\section {Introduction}
Lorem Ipsum Doremifaso 

%\cite{Lellis2014} use to cite 




%references our biliography. This must go whereever we use our bibtex references



    \bibliography{references}
    \bibliographystyle{apacite}


    \end{document}

bibtex file:

  @misc{RefWorks:doc:572abc36e4b087a1e3af61fd,
        author =     {Estimating the Efficiency of Backtrack Programs},
        year =   {1975},
        title =      {MATHEMATICS OF COMPUTATION, VOLUME 29, NUMBER 129 JANUARY 1975, PAGES 121-136},
        volume =     {29},
        abstract =   {Abstract.     One  of  the  chief  difficulties   associated   with  the  so-called  backtracking    tech- nique  for  combinatorial     problems   has  been  our  inability   to  predict   the  efficiency   of  a given  algorithm,   or to  compare   the  efficiencies   of different   approaches,   without   actu- ally writing   and  running   the  programs.    This  paper  presents   a simple  method   which  pro- duces  reasonable   estimates   for  most  applications,    requiring   only  a modest   amount   of hand  calculation.     The  method   should   prove  to  be of  considerable    utility   in  connection with  D. H. Lehmer's   branch-and-bound     approach   to  combinatorial    optimization.}
    }
    @article{Lellis2014,
        author={Levi Lelis and Roni Stern and Ariel Felner and Sandra Zilles and Robert Holte},
        year={2014},
        month={November},
        title={Predicting optimal solution cost with conditional probabilities},
        journal={Annals of Mathematics and Artificial Intelligence},
        volume={72},
        number={3},
        pages={267-295},
        abstract={Heuristic search algorithms are designed to return an optimal path from a start state to a goal state. They find the optimal solution cost as a side effect. However, there are applications in which all one wants to know is an estimate of the optimal solution cost. The actual path from start to goal is not initially needed. For instance, one might be interested in quickly assessing the monetary cost of a project for bidding purposes. In such cases only the cost of executing the project is required. The actual construction plan could be formulated later, after bidding. In this paper we propose an algorithm, named Solution Cost Predictor (SCP), that accurately and efficiently predicts the optimal solution cost of a problem instance without finding the actual solution. While SCP can be viewed as a heuristic function, it differs from a heuristic conceptually in that: 1) SCP is not required to be fast enough to guide search algorithms; 2) SCP is not required to be admissible; 3) our measure of effectiveness is the prediction accuracy, which is in contrast to the solution quality and number of nodes expanded used to measure the effectiveness of heuristic functions. We show empirically that SCP makes accurate predictions on several heuristic search benchmarks.},
        isbn={1012-2443},
        language={English},
        doi={10.1007/s10472-014-9432-8}
    }
    @inproceedings{RefWorks:doc:5850e62fe4b02dcd50f40f9c,
        author={Carlos Linares Lopez and Andreas Junghanns},
        year={2002},
        title={Perimeter search performance},
        booktitle={International Conference on Computers and Games},
        publisher={Springer},
        pages={345-359}
    }
    @book{RefWorks:doc:57298613e4b0a05ab1595b05,
        author={Mike Barley and Levi H.S. Lellis and Sandraz Zilles and Robert C. Holte},
        year={2016},
        title={Heuristic Subset Selection in Classical Planning},
        language={English},
        url={http://replace-me/ebraryid=10477244}
    }
                                                

                                                                                                        REPLY
                                                    
                                                
                                                


                                                    

                                                        
                                                            0
                                                            views 

                                                            0
                                                                likes 
                                                            
                                                            

                                                            0
                                                            shares

                                                            


    

         Facebook
        
         Twitter
        
        
         Linked In 
        
          WhatsApp