Search dblp for Publications

export results for "toc:db/conf/cco/cco2001.bht:"

 download as .bib file

@inproceedings{DBLP:conf/cco/ApplegateBCC01,
  author       = {David L. Applegate and
                  Robert E. Bixby and
                  Vasek Chv{\'{a}}tal and
                  William J. Cook},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {{TSP} Cuts Which Do Not Conform to the Template Paradigm},
  booktitle    = {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},
  pages        = {261--304},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_7},
  doi          = {10.1007/3-540-45586-8\_7},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cco/ApplegateBCC01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/Balas01,
  author       = {Egon Balas},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Projection and Lifting in Combinatorial Optimization},
  booktitle    = {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},
  pages        = {26--56},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_2},
  doi          = {10.1007/3-540-45586-8\_2},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/Balas01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/ElfGJR01,
  author       = {Matthias Elf and
                  Carsten Gutwenger and
                  Michael J{\"{u}}nger and
                  Giovanni Rinaldi},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Branch-and-Cut Algorithms for Combinatorial Optimization and Their
                  Implementation in {ABACUS}},
  booktitle    = {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},
  pages        = {157--222},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_5},
  doi          = {10.1007/3-540-45586-8\_5},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/ElfGJR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/LadanyiRT01,
  author       = {Laszlo Lad{\'{a}}nyi and
                  Ted K. Ralphs and
                  Leslie E. Trotter Jr.},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Branch, Cut, and Price: Sequential and Parallel},
  booktitle    = {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},
  pages        = {223--260},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_6},
  doi          = {10.1007/3-540-45586-8\_6},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/LadanyiRT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/Lemarechal01,
  author       = {Claude Lemar{\'{e}}chal},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Lagrangian Relaxation},
  booktitle    = {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},
  pages        = {112--156},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_4},
  doi          = {10.1007/3-540-45586-8\_4},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cco/Lemarechal01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/Martin01,
  author       = {Alexander Martin},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {General Mixed Integer Programming: Computational Issues for Branch-and-Cut
                  Algorithms},
  booktitle    = {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},
  pages        = {1--25},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_1},
  doi          = {10.1007/3-540-45586-8\_1},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cco/Martin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cco/Pochet01,
  author       = {Yves Pochet},
  editor       = {Michael J{\"{u}}nger and
                  Denis Naddef},
  title        = {Mathematical Programming Models and Formulations for Deterministic
                  Production Planning Problems},
  booktitle    = {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},
  pages        = {57--111},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45586-8\_3},
  doi          = {10.1007/3-540-45586-8\_3},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/Pochet01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@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 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cco/2001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.