Entry Li:1997:STS from parallelalgorithmsappl.bib

Last update: Sat Oct 14 02:56:46 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Li:1997:STS,
  author =       "Keqin Li",
  title =        "Solving the Traveling Salesman Problem Using Efficient
                 Randomized Parallel Approximation Algorithms",
  journal =      j-PARALLEL-ALGORITHMS-APPL,
  volume =       "10",
  number =       "3--4",
  pages =        "271--281",
  month =        "????",
  year =         "1997",
  CODEN =        "PAAPEC",
  DOI =          "https://doi.org/10.1080/10637199708915622",
  ISSN =         "1063-7192",
  MRclass =      "68Q25 (68Q22)",
  MRnumber =     "MR1446424 (98a:68099)",
  bibdate =      "Fri Jul 11 06:45:43 MDT 2008",
  bibsource =    "http://www.gbhap-us.com/journals/728/728-toc.htm;
                 http://www.math.utah.edu/pub/tex/bib/parallelalgorithmsappl.bib;
                 http://www.mcs.newpaltz.edu/~li/paper.html; MathSciNet
                 database",
  URL =          "http://www.informaworld.com/smpp/content~content=a772398799",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
  remark =       "Also cited as v11.",
}

Related entries