BibTeX record conf/cco/2001

download as .bib file

@proceedings{DBLP:conf/cco/2001,
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Computational Combinatorial Optimization, Optimal or Provably Near-Optimal
                  Solutions [based on a Spring School, Schlo{\ss} Dagstuhl, Germany,
                  15-19 May 2000]},
  series       = {Lecture Notes in Computer Science},
  volume       = {2241},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8},
  doi          = {10.1007/3-540-45586-8},
  isbn         = {3-540-42877-1},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/2001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.