Publikationen
2024
Steiner cut dominants
Conforti, Michele; Kaibel, Volker
In: Mathematics of operations research - Hanover, Md. : INFORMS . - 2024, Heft $p [Online first]
Source detection on graphs
Weber, Tobias; Kaibel, Volker; Sager, Sebastian
In: Optimization and engineering - Dordrecht [u.a.] : Springer Science + Business Media B.V, Bd. 25 (2024), S. 1151-1177
2023
Optimal sufficient requirements on the embedded Ising problem in polynomial time
Lobe, Elisabeth; Kaibel, Volker
In: Quantum information processing - Dordrecht : Springer Science + Business Media B.V., Bd. 22 (2023), Heft 8, Artikel 305, insges. 44 S.
Contributions to the theory of Costas arrays
Ardalani, Ali; Pott, Alexander; Kaibel, Volker
In: Magdeburg: Universitätsbibliothek, Dissertation Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik 2023, 1 Online-Ressource (xiii, 147 Seiten, 10,24 MB) [Literaturverzeichnis: Seite 141-147]
Cyclic transversal polytopes
Frede, Jonas; Kaibel, Volker
In: Magdeburg: Universitätsbibliothek, Dissertation Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik 2023, 1 Online-Ressource (I, 138 Seiten, 685.07 kB) [Literaturverzeichnis: Seite 135-138]
2022
The Gaussian conditional independence inference problem
Boege, Tobias; Kahle, Thomas; Kaibel, Volker
In: Magdeburg: Universitätsbibliothek, 2022, 1 Online-Ressource (ii, 143 Seiten, 1,33 MB), Formeln
Combinatorial problems in programming quantum annealers
Lobe, Elisabeth; Kaibel, Volker
In: Magdeburg: Universitätsbibliothek, 2022, 1 Online-Ressource (II, 156, Seite III-X, 2,5 MB), Illustrationen
2021
Scale-free spanning trees and their application in genomic epidemiology
Orlovich, Yury; Kukharenko, Kirill; Kaibel, Volker; Skums, Pavel
In: Journal of computational biology - Larchmont, NY : Liebert, Bd. 28 (2021), Heft 10, S. 945-960
2018
Maximum semidefinite and linear extension complexity of families of polytopes
Averkov, Gennadiy; Kaibel, Volker; Weltge, Stefan
In: Mathematical programming: Series A, Series B ; a publication of the Mathematical Programming Society - Berlin: Springer, 1971, Bd. 167.2018, 2, S. 381-394
Undominated complexes of cut polytopes
Abramchuk, Yauheniya; Kaibel, Volker
In: Magdeburg, 2018, viii, 169 Seiten, Illustrationen[Literaturverzeichnis: Seite 167-169]
2017
A note on matchings constructed during Edmonds' weighted perfect matching algorithm
Kaibel, Volker; Walter, Matthias
In: Magdeburg: Universität, Fakultät für Mathematik, 2017, 8 Seiten - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2017,Nr.06)
2016
Extended formulations for independence polytopes of regular matroids
Kaibel, Volker; Lee, Jon; Walter, Matthias; Weltge, Stefan
In: Graphs and combinatorics - Tokyo: Springer-Verl. Tokyo, 1985, Bd. 32.2016, 5, S. 1931-1944
Maximum semidefinite and linear extension complexity of families of polytopes
Averkov, Gennadiy; Kaibel, Volker; Weltge, Stefan
In: De.arxiv.org - [S.l.]: Arxiv.org, 1991 . - 2016, insges. 11 S.
2015
Subgraph polytopes and independence polytopes of count matroids
Conforti, Michele; Kaibel, Volker; Walter, Matthias; Weltge, Stefan
In: Operations research letters: a journal of INFORMS devoted to the rapid publication of concise contributions in operations research - Amsterdam [u.a.]: Elsevier Science, Bd. 43.2015, 5, S. 457-460
The unimodular intersection problem
Kaibel, Volker; Onn, Shmuel; Sarrabezolles, Pauline
In: Operations Research Letters, 2015, S. 592-594, ISSN 01676377, 10.1016/j.orl.2015.09.005
Lifts of convex sets in optimization
Kaibel, Volker; Thomas, Rekha
In: Mathematical programming: Series A, Series B : a publication of the Mathematical Programming Society - Berlin: Springer, Bd. 153.2015, 1, S. 1-3
2014
Which nonnegative matrices are slack matrices?
Gouveia, João; Grappe, Roland; Kaibel, Volker; Pashkovich, Kanstantin; Robinson, Richard Z.; Thomas, Rekha R.
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2014
Simple extensions of polytopes
Kaibel, Volker; Walter, Matthias
In: Integer Programming and Combinatorial Optimization / Lee , Jon - Cham [u.a.] : Springer ; Lee, Jon . - 2014, S. 309-320 - (Lecture notes in computer science; 8494) Kongress: IPCO 17 Bonn 2014.06.23-25
Lower bounds on the sizes of integer programs without additional variables
Kaibel, Volker; Weltge, Stefan
In: Integer Programming and Combinatorial Optimization / Lee , Jon - Cham [u.a.] : Springer ; Lee, Jon . - 2014, S. 321-332 - (Lecture notes in computer science; 8494) Kongress: IPCO 17 Bonn 2014.06.23-25
2013
Combinatorial bounds on nonnegative rank and extended formulations
Fiorini, Samuel; Kaibel, Volker; Pashkovich, Kanstantsin; Theis, Dirk Oliver
In: Discrete mathematics. - Amsterdam : Elsevier Science, Bd. 313.2013, 1, S. 67-83
Which nonnegative matrices are slack matrices?
Gouveia, João; Grappe, Roland; Kaibel, Volker; Pashkovich, Kanstantsin; Robinson, Richard Z.; Thomas, Rekha R.
In: Linear algebra and its applications. - New York, NY : American Elsevier Publ, Bd. 439.2013, 10, S. 2921-2933
Lower bounds on the sizes of integer programs without additional variables
Kaibel, Volker; Weltge, Stefan
In: Magdeburg: Univ., Fak. für Mathematik, 2013, [17] S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,26)
A short proof that the extension complexity of the correlation polytope grows exponentially
Kaibel, Volker; Weltge, Stefan
In: Magdeburg: Univ., Fak. für Mathematik, 2013, [10] S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,25)
Which nonnegative matrices are slack matrices?
Gouveia, João; Kaibel, Volker; Pashkovich, Kanstantsin; Robinson, Richard Z.; Thomas, Rekha R.
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 14 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,6)
Forbidden vertices
Angulo, Gustavo; Ahmed, Shabbir; Dey, Santanu S.; Kaibel, Volker
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 15 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,23)
Simple extensions of polytopes
Kaibel, Volker; Walter, Matthias
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 21 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,24)
2012
Symmetry matters for sizes of extended formulations
Kaibel, Volker; Pashkovich, Kanstantsin; Theis, Dirk Oliver
In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, Bd. 26.2012, 3, S. 1361-1382
Mixed-integer programming subject to uncertain data
Pfeuffer, Frank Martin; Kaibel, Volker
In: Göttingen: Cuvillier, Zugl.: Magdeburg, Otto-von-Guericke-Univ., Fak. für Mathematik., Diss., 2012, X, 123 S., ISBN: 978-3-95404-239-5
2011
Basic polyhedral theory
Kaibel, Volker
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2011
Finding descriptions of polytopes via extended formulations and liftings
Kaibel, Volker; Loos, Andreas
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 20 S., 2011
Orbitopal fixing
Kaibel, Volker; Peinhardt, Matthias; Pfetsch, Marc E.
In: Discrete optimization. - New York, NY [u.a.] : Elsevier, Bd. 8.2011, 4, S. 595-610
Extended formulations in combinatorial optimization
Kaibel, Volker
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2011
Constructing extended formulations from reflection relations
Kaibel, Volker; Pashkovich, Kanstantsin
In: Integer programming and combinatorial optimization. - Heidelberg [u.a.] : Springer, S. 287-300, 2011 - (Lecture notes in computer science; 6655)Kongress: IPCO; 15 (New York, NY) : 2011.06.15-17
Extended formulations in combinatorial optimization
Kaibel, Volker
In: Optima. - Philadelphia, Pa. [u.a.] : Soc., 85, S. 2-7, 2011
2010
On cardinality constrained cycle and path polytopes
Kaibel, Volker; Stephan, Rüdiger
In: Mathematical programming / a publ. of the Mathematical Programming Society - Berlin: Springer, Bd. 123 (2010), 2, S. 371-394
Symmetry matters for sizes of extended formulations
Kaibel, Volker; Pashkovich, Kanstantsin; Theis, Dirk Oliver
In: Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010 ; proceedings - Berlin: Springer, 2010 . - 2009, S. 135-148 - (Lecture notes in computer science; 6080)Kongress: IPCO 14 (Lausanne : 2010.06.09-11)
Branched polyhedral systems
Kaibel, Volker; Loos, Andreas
In: Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010 ; proceedings - Berlin: Springer, 2010 . - 2010, S. 177-190 - (Lecture notes in computer science; 6080)Kongress: IPCO 14 (Lausanne : 2010.06.09-11)
2009
"Alles was zählt!" - der mathematische Blick
Bräsel, Heidemarie; Christoph, Gerd; Grunau, Hans-Christoph; Henk, Martin; Henning, Herbert; Kahle, Waltraud; Kaibel, Volker; Manteuffel, Karl; Pott, Alexander; Warnecke, Gerald; Willems, Wolfgang
In: Magdeburg: Univ., Fak. für Mathematik, 2009, Getr. Zählung, Ill., 29 cm - (Technical Report; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2009,2)
Extended formulations for packing and partitioning orbitopes
Faenza, Yuri; Kaibel, Volker
In: Mathematics of operations research / publ. quarterly by the Institute for Operations Research and the Management Sciences - Catonsville, MD: INFORMS, Bd. 34 (2009), 3, S. 686-697
2008
A short proof of the VPN Tree Routing Conjecture on ring networks
Grandoni, Fabrizio; Kaibel, Volker; Oriolo, Gianpaolo; Skutella, Martin
In: Operations research letters - Amsterdam [u.a.] : Elsevier, Bd. 36 (2008), Heft 3, S. 361-365
Packing and partitioning orbitopes
Kaibel, Volker; Pfetsch, Marc
In: Mathematical programming . - Berlin : Springer, Bd. 114.2008, 1, S. 1-36
A short proof of the VPN tree routing conjecture on ring networks
Grandoni, Fabrizio; Kaibel, Volker; Oriolo, Gianpaolo; Skutella, Martin
In: Operations research letters . - Amsterdam [u.a.] : Elsevier, Bd. 36.2008, 3, S. 361-365
2007
Two new bounds for the random-edge simplex algorithm
Gärtner, Bernd; Kaibel, Volker
In: Society for Industrial and Applied Mathematics : SIAM journal on discrete mathematics . - Philadelphia, Pa. : Soc., Bd. 21.2007, 1, S. 178-190
Orbitopal fixing
Kaibel, Volker; Peinhardt, Matthias; Pfetsch, Marc E.
In: Integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25 - 27, 2007 ; proceedings / Matteo Fischetti; David P. Williamson (eds.) - Berlin: Springer, 2007 . - 2007, S. 74-88 - (Lecture notes in computer science; 4513)