Search dblp for Publications

export results for "toc:db/books/collections/G2004.bht:"

 download as .bib file

@incollection{DBLP:books/siam/04/BixbyFGRW04,
  author       = {Robert E. Bixby and
                  Mary Fenelon and
                  Zonghao Gu and
                  Edward Rothberg and
                  Roland Wunderling},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Mixed-Integer Programming: {A} Progress Report},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {309--325},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch18},
  doi          = {10.1137/1.9780898718805.CH18},
  timestamp    = {Mon, 29 Jul 2019 14:43:51 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/BixbyFGRW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Borndorfer04,
  author       = {Ralf Bornd{\"{o}}rfer},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Combinatorial Packing Problems},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {19--32},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch3},
  doi          = {10.1137/1.9780898718805.CH3},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Borndorfer04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/BrixiusA04,
  author       = {Nathan W. Brixius and
                  Kurt M. Anstreicher},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {The Steinberg Wiring Problem},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {293--307},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch17},
  doi          = {10.1137/1.9780898718805.CH17},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/BrixiusA04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/ChandruRS04,
  author       = {Vijay Chandru and
                  M. Rammohan Rao and
                  Ganesh Swaminathan},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Protein Folding on Lattices: An Integer Programming Approach},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {185--196},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch12},
  doi          = {10.1137/1.9780898718805.CH12},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/ChandruRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/ConfortiCZ04,
  author       = {Michele Conforti and
                  G{\'{e}}rard Cornu{\'{e}}jols and
                  Giacomo Zambelli},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Bicolorings and Equitable Bicolorings of Matrices},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {33--37},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch4},
  doi          = {10.1137/1.9780898718805.CH4},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/ConfortiCZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Fonlupt04,
  author       = {Jean Fonlupt},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {The Clique-Rank of 3-Chromatic Perfect Graphs},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {39--49},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch5},
  doi          = {10.1137/1.9780898718805.CH5},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Fonlupt04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/GentileHKRW04,
  author       = {Claudio Gentile and
                  Utz{-}Uwe Haus and
                  Matthias K{\"{o}}ppe and
                  Giovanni Rinaldi and
                  Robert Weismantel},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {On the Way to Perfection: Primal Operations for Stable Sets in Graphs},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {51--76},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch6},
  doi          = {10.1137/1.9780898718805.CH6},
  timestamp    = {Thu, 28 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/books/siam/04/GentileHKRW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Grotschel04,
  author       = {Martin Gr{\"{o}}tschel},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated
                  Polytopes},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {99--120},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch8},
  doi          = {10.1137/1.9780898718805.CH8},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Grotschel04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Helmberg04,
  author       = {Christoph Helmberg},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {233--256},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch15},
  doi          = {10.1137/1.9780898718805.CH15},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Helmberg04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Kaibel04,
  author       = {Volker Kaibel},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {On the Expansion of Graphs of 0/1-Polytopes},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {199--216},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch13},
  doi          = {10.1137/1.9780898718805.CH13},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Kaibel04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/KerivinMN04,
  author       = {Herv{\'{e}} Kerivin and
                  Ali Ridha Mahjoub and
                  Charles Nocq},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {(1, 2)-Survivable Networks: Facets and Branch-and-Cut},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {121--152},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch9},
  doi          = {10.1137/1.9780898718805.CH9},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/KerivinMN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Laurent04,
  author       = {Monique Laurent},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Semidefinite Relaxations for Max-Cut},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {257--290},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch16},
  doi          = {10.1137/1.9780898718805.CH16},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Laurent04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/MutzelJ04,
  author       = {Petra Mutzel and
                  Michael J{\"{u}}nger},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Graph Drawing: Exact Optimization Helps!},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {327--352},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch19},
  doi          = {10.1137/1.9780898718805.CH19},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/MutzelJ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Naddef04,
  author       = {Denis Naddef},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {The Domino Inequalities for the Symmetric Traveling Salesman Problem},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {153--172},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch10},
  doi          = {10.1137/1.9780898718805.CH10},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Naddef04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/OswaldR04,
  author       = {Marcus Oswald and
                  Gerhard Reinelt},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Computing Optimal Consecutive Ones Matrices},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {173--183},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch11},
  doi          = {10.1137/1.9780898718805.CH11},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/OswaldR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Wagler04,
  author       = {Annegret Katrin Wagler},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Relaxing Perfectness: Which Graphs Are "Almost" Perfect?},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {77--96},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch7},
  doi          = {10.1137/1.9780898718805.CH7},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Wagler04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Wolsey04,
  author       = {Laurence A. Wolsey},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Time for Old and New Faces},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {7--15},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch2},
  doi          = {10.1137/1.9780898718805.CH2},
  timestamp    = {Tue, 18 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Wolsey04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/siam/04/Ziegler04,
  author       = {G{\"{u}}nter M. Ziegler},
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {Typical and Extremal Linear Programs},
  booktitle    = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  pages        = {217--230},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805.ch14},
  doi          = {10.1137/1.9780898718805.CH14},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/Ziegler04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@book{DBLP:books/siam/04/G2004,
  editor       = {Martin Gr{\"{o}}tschel},
  title        = {The Sharpest Cut},
  series       = {{MPS-SIAM} series on optimization},
  volume       = {4},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {https://doi.org/10.1137/1.9780898718805},
  doi          = {10.1137/1.9780898718805},
  isbn         = {978-0-89871-552-1},
  timestamp    = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/siam/04/G2004.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.