Magnouche, Youcef; Martin, Sébastien Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm. (English) Zbl 07311804 Optim. Lett. 14, No. 8, 2039-2053 (2020). MSC: 90C PDF BibTeX XML Cite \textit{Y. Magnouche} and \textit{S. Martin}, Optim. Lett. 14, No. 8, 2039--2053 (2020; Zbl 07311804) Full Text: DOI
Taktak, Raouia; Uchoa, Eduardo On the multiple Steiner traveling salesman problem with order constraints. (English) Zbl 07306383 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 66-77 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Taktak} and \textit{E. Uchoa}, Lect. Notes Comput. Sci. 12176, 66--77 (2020; Zbl 07306383) Full Text: DOI
Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V. On the impact of running intersection inequalities for globally solving polynomial optimization problems. (English) Zbl 1441.90097 Math. Program. Comput. 12, No. 2, 165-191 (2020). MSC: 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} et al., Math. Program. Comput. 12, No. 2, 165--191 (2020; Zbl 1441.90097) Full Text: DOI
Gupte, Akshay; Kalinowski, Thomas; Rigterink, Fabian; Waterer, Hamish Extended formulations for convex hulls of some bilinear functions. (English) Zbl 07225953 Discrete Optim. 36, Article ID 100569, 33 p. (2020). MSC: 90C57 90C26 52B12 PDF BibTeX XML Cite \textit{A. Gupte} et al., Discrete Optim. 36, Article ID 100569, 33 p. (2020; Zbl 07225953) Full Text: DOI
Sakamoto, Ryuichi The \(h^\ast\)-polynomial of the cut polytope of \(K_{2,m}\) in the lattice spanned by its vertices. (English) Zbl 1444.05071 J. Integer Seq. 23, No. 7, Article 20.7.5, 12 p. (2020). MSC: 05C31 05A15 13P10 52B20 PDF BibTeX XML Cite \textit{R. Sakamoto}, J. Integer Seq. 23, No. 7, Article 20.7.5, 12 p. (2020; Zbl 1444.05071) Full Text: Link
Deza, Michel; Dutour Sikirić, Mathieu Generalized cut and metric polytopes of graphs and simplicial complexes. (English) Zbl 1442.05253 Optim. Lett. 14, No. 2, 273-289 (2020). MSC: 05E45 52B12 90C27 90C57 PDF BibTeX XML Cite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI
Lin, Ruizhi; Zhang, Heping Fractional matching preclusion number of graphs and the perfect matching polytope. (English) Zbl 1435.05162 J. Comb. Optim. 39, No. 3, 915-932 (2020). MSC: 05C70 05C72 05C76 90C27 90C35 90C57 PDF BibTeX XML Cite \textit{R. Lin} and \textit{H. Zhang}, J. Comb. Optim. 39, No. 3, 915--932 (2020; Zbl 1435.05162) Full Text: DOI
Benhamiche, Amal; Mahjoub, A. Ridha; Perrot, Nancy; Uchoa, Eduardo Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut. (English) Zbl 07172794 Discrete Optim. 35, Article ID 100555, 30 p. (2020). MSC: 90C PDF BibTeX XML Cite \textit{A. Benhamiche} et al., Discrete Optim. 35, Article ID 100555, 30 p. (2020; Zbl 07172794) Full Text: DOI
Laroche, Pierre; Marchetti, Franc; Martin, Sébastien; Nagih, Anass; Róka, Zsuzsanna Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut. (English) Zbl 07172790 Discrete Optim. 35, Article ID 100551, 24 p. (2020). MSC: 90C PDF BibTeX XML Cite \textit{P. Laroche} et al., Discrete Optim. 35, Article ID 100551, 24 p. (2020; Zbl 07172790) Full Text: DOI
Lee, Jon; Skipper, Daphne Volume computation for sparse Boolean quadric relaxations. (English) Zbl 1433.90086 Discrete Appl. Math. 275, 79-94 (2020). MSC: 90C09 90C27 52B12 05C62 PDF BibTeX XML Cite \textit{J. Lee} and \textit{D. Skipper}, Discrete Appl. Math. 275, 79--94 (2020; Zbl 1433.90086) Full Text: DOI
Walter, Matthias; Weltge, Stefan Extended formulations for radial cones. (English) Zbl 07165824 Oper. Res. Lett. 47, No. 5, 458-463 (2019). MSC: 90 PDF BibTeX XML Cite \textit{M. Walter} and \textit{S. Weltge}, Oper. Res. Lett. 47, No. 5, 458--463 (2019; Zbl 07165824) Full Text: DOI
Andreatta, G.; De Francesco, Carla; De Giovanni, L.; Serafini, P. Star partitions on graphs. (English) Zbl 07138059 Discrete Optim. 33, 1-18 (2019). MSC: 90C10 05C69 90C27 90C57 PDF BibTeX XML Cite \textit{G. Andreatta} et al., Discrete Optim. 33, 1--18 (2019; Zbl 07138059) Full Text: DOI
Huber, Mark; Marić, Nevena Admissible Bernoulli correlations. (English) Zbl 1427.62052 J. Stat. Distrib. Appl. 6, Paper No. 2, 8 p. (2019). MSC: 62H20 60E05 52B12 62H10 90C05 PDF BibTeX XML Cite \textit{M. Huber} and \textit{N. Marić}, J. Stat. Distrib. Appl. 6, Paper No. 2, 8 p. (2019; Zbl 1427.62052) Full Text: DOI
Walter, Matthias Complete description of matching polytopes with one linearized quadratic term for bipartite graphs. (English) Zbl 1422.90071 SIAM J. Discrete Math. 33, No. 2, 1061-1094 (2019). MSC: 90C57 90C20 90C35 PDF BibTeX XML Cite \textit{M. Walter}, SIAM J. Discrete Math. 33, No. 2, 1061--1094 (2019; Zbl 1422.90071) Full Text: DOI
Cornaz, D.; Magnouche, Y.; Mahjoub, A. R.; Martin, S. The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut. (English) Zbl 1405.05143 Discrete Appl. Math. 256, 11-37 (2019). MSC: 05C70 90C10 68Q17 PDF BibTeX XML Cite \textit{D. Cornaz} et al., Discrete Appl. Math. 256, 11--37 (2019; Zbl 1405.05143) Full Text: DOI
Ding, Guoli; Tan, Lei; Zang, Wenan When is the matching polytope box-totally dual integral? (English) Zbl 1432.90084 Math. Oper. Res. 43, No. 1, 64-99 (2018). MSC: 90C10 90C27 90C57 90C60 68Q25 PDF BibTeX XML Cite \textit{G. Ding} et al., Math. Oper. Res. 43, No. 1, 64--99 (2018; Zbl 1432.90084) Full Text: DOI
Marić, Nevena Cut polytope has vertices on a line. (English) Zbl 07048653 Korpelainen, Nicholas (ed.), TCDM 2018. Proceedings of the 2nd IMA conference on theoretical and computational discrete mathematics, University of Derby, Derby, UK, September 14–15, 2018. Part 1. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 70, 59-64 (2018). MSC: 68Rxx PDF BibTeX XML Cite \textit{N. Marić}, Electron. Notes Discrete Math. 70, 59--64 (2018; Zbl 07048653) Full Text: DOI
Michałek, Mateusz Selected topics on toric varieties. (English) Zbl 1411.14057 Hibi, Takayuki (ed.), The 50th anniversary of Gröbner bases. Proceedings of the 8th Mathematical Society of Japan-Seasonal Institute (MSJ-SI 2015), Osaka, Japan, July 1–10, 2015. Tokyo: Mathematical Society of Japan (MSJ). Adv. Stud. Pure Math. 77, 207-252 (2018). MSC: 14M25 13P25 13F55 05E40 PDF BibTeX XML Cite \textit{M. Michałek}, Adv. Stud. Pure Math. 77, 207--252 (2018; Zbl 1411.14057)
Grappe, Roland; Lacroix, Mathieu The \(st\)-bond polytope on series-parallel graphs. (English) Zbl 1405.90112 RAIRO, Oper. Res. 52, No. 3, 923-934 (2018). MSC: 90C27 90C35 90C57 PDF BibTeX XML Cite \textit{R. Grappe} and \textit{M. Lacroix}, RAIRO, Oper. Res. 52, No. 3, 923--934 (2018; Zbl 1405.90112) Full Text: DOI
Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile The min-up/min-down unit commitment polytope. (English) Zbl 1414.90141 J. Comb. Optim. 36, No. 3, 1024-1058 (2018). MSC: 90B30 90B25 90C57 PDF BibTeX XML Cite \textit{P. Bendotti} et al., J. Comb. Optim. 36, No. 3, 1024--1058 (2018; Zbl 1414.90141) Full Text: DOI
Bonami, Pierre; Günlük, Oktay; Linderoth, Jeff Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. (English) Zbl 1400.90239 Math. Program. Comput. 10, No. 3, 333-382 (2018). MSC: 90C20 90C26 90C57 PDF BibTeX XML Cite \textit{P. Bonami} et al., Math. Program. Comput. 10, No. 3, 333--382 (2018; Zbl 1400.90239) Full Text: DOI
Battaglia, Fiammetta; Prato, Elisa Nonrational symplectic toric cuts. (English) Zbl 1401.53071 Int. J. Math. 29, No. 10, Article ID 1850063, 19 p. (2018). MSC: 53D20 14M25 PDF BibTeX XML Cite \textit{F. Battaglia} and \textit{E. Prato}, Int. J. Math. 29, No. 10, Article ID 1850063, 19 p. (2018; Zbl 1401.53071) Full Text: DOI arXiv
Tropp, Joel A. Simplicial faces of the set of correlation matrices. (English) Zbl 1400.15035 Discrete Comput. Geom. 60, No. 2, 512-529 (2018). MSC: 15B48 52A20 52B12 90C27 PDF BibTeX XML Cite \textit{J. A. Tropp}, Discrete Comput. Geom. 60, No. 2, 512--529 (2018; Zbl 1400.15035) Full Text: DOI
Ben Salem, Mariem; Taktak, Raouia; Mahjoub, A. Ridha; Ben-Abdallah, Hanêne Optimization algorithms for the disjunctively constrained knapsack problem. (English) Zbl 1398.90131 Soft Comput. 22, No. 6, 2025-2043 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Ben Salem} et al., Soft Comput. 22, No. 6, 2025--2043 (2018; Zbl 1398.90131) Full Text: DOI
Witt, Jonas T.; Lübbecke, Marco E.; Reed, Bruce Polyhedral results on the stable set problem in graphs containing even or odd pairs. (English) Zbl 1405.90081 Math. Program. 171, No. 1-2 (A), 519-522 (2018). MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{J. T. Witt} et al., Math. Program. 171, No. 1--2 (A), 519--522 (2018; Zbl 1405.90081) Full Text: DOI
Aprile, Manuel; Cevallos, Alfonso; Faenza, Yuri On 2-level polytopes arising in combinatorial settings. (English) Zbl 1395.52018 SIAM J. Discrete Math. 32, No. 3, 1857-1886 (2018). MSC: 52B12 52B40 90C57 PDF BibTeX XML Cite \textit{M. Aprile} et al., SIAM J. Discrete Math. 32, No. 3, 1857--1886 (2018; Zbl 1395.52018) Full Text: DOI arXiv
Lee, Jon; Skipper, Daphne; Speakman, Emily Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. (English) Zbl 1394.52011 Math. Program. 170, No. 1 (B), 121-140 (2018). MSC: 52B11 52B12 90C10 90C11 90C26 90C27 90C57 52A38 PDF BibTeX XML Cite \textit{J. Lee} et al., Math. Program. 170, No. 1 (B), 121--140 (2018; Zbl 1394.52011) Full Text: DOI
Fischer, Anja; Fischer, Frank; McCormick, S. Thomas Matroid optimisation problems with nested non-linear monomials in the objective function. (English) Zbl 1419.90118 Math. Program. 169, No. 2 (A), 417-446 (2018). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. Fischer} et al., Math. Program. 169, No. 2 (A), 417--446 (2018; Zbl 1419.90118) Full Text: DOI
Del Pia, Alberto; Khajavirad, Aida The multilinear polytope for acyclic hypergraphs. (English) Zbl 1396.90048 SIAM J. Optim. 28, No. 2, 1049-1076 (2018). MSC: 90C10 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} and \textit{A. Khajavirad}, SIAM J. Optim. 28, No. 2, 1049--1076 (2018; Zbl 1396.90048) Full Text: DOI
Deza, Michel; Dutour Sikirić, Mathieu The hypermetric cone and polytope on eight vertices and some generalizations. (English) Zbl 1390.68716 J. Symb. Comput. 88, 67-84 (2018). MSC: 68U05 52B20 52C25 68W30 PDF BibTeX XML Cite \textit{M. Deza} and \textit{M. Dutour Sikirić}, J. Symb. Comput. 88, 67--84 (2018; Zbl 1390.68716) Full Text: DOI
Velednitsky, Mark Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem. (English) Zbl 1409.90232 Oper. Res. Lett. 45, No. 4, 323-324 (2017). MSC: 90C57 90C27 52B12 PDF BibTeX XML Cite \textit{M. Velednitsky}, Oper. Res. Lett. 45, No. 4, 323--324 (2017; Zbl 1409.90232) Full Text: DOI
Adams, Elspeth; Anjos, Miguel F. Exact separation of \(k\)-projection polytope constraints. (English) Zbl 1383.49014 Takáč, Martin (ed.) et al., Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 17–19, 2016. Selected contributions. Cham: Springer (ISBN 978-3-319-66615-0/hbk; 978-3-319-66616-7/ebook). Springer Proceedings in Mathematics & Statistics 213, 119-141 (2017). MSC: 49J45 90C11 PDF BibTeX XML Cite \textit{E. Adams} and \textit{M. F. Anjos}, in: Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 17--19, 2016. Selected contributions. Cham: Springer. 119--141 (2017; Zbl 1383.49014) Full Text: DOI
Iriarte, Benjamin Graph orientations and linear extensions. (English) Zbl 1386.90127 Math. Oper. Res. 42, No. 4, 1219-1229 (2017). MSC: 90C27 90C35 05C20 05C21 05C80 90C57 PDF BibTeX XML Cite \textit{B. Iriarte}, Math. Oper. Res. 42, No. 4, 1219--1229 (2017; Zbl 1386.90127) Full Text: DOI
Wang, Yiming; Buchanan, Austin; Butenko, Sergiy On imposing connectivity constraints in integer programs. (English) Zbl 1386.90023 Math. Program. 166, No. 1-2 (A), 241-271 (2017). MSC: 90B10 90B18 90C10 90C27 90C35 90C57 68R10 PDF BibTeX XML Cite \textit{Y. Wang} et al., Math. Program. 166, No. 1--2 (A), 241--271 (2017; Zbl 1386.90023) Full Text: DOI
Maksimenko, Aleksandr Nikolaevich Boolean quadric polytopes are faces of linear ordering polytopes. (Russian. English summary) Zbl 1370.90296 Sib. Èlektron. Mat. Izv. 14, 640-646 (2017). MSC: 90C57 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, Sib. Èlektron. Mat. Izv. 14, 640--646 (2017; Zbl 1370.90296) Full Text: DOI
Zuckerberg, Mark Geometric proofs for convex hull defining formulations. (English) Zbl 1408.90193 Oper. Res. Lett. 44, No. 5, 625-629 (2016). MSC: 90C10 52B55 90C57 PDF BibTeX XML Cite \textit{M. Zuckerberg}, Oper. Res. Lett. 44, No. 5, 625--629 (2016; Zbl 1408.90193) Full Text: DOI
Cañavate, Roberto J.; Landete, Mercedes A polyhedral study on 0-1 knapsack problems with set packing constraints. (English) Zbl 1408.90187 Oper. Res. Lett. 44, No. 2, 243-249 (2016). MSC: 90C10 52B12 90C57 90C27 PDF BibTeX XML Cite \textit{R. J. Cañavate} and \textit{M. Landete}, Oper. Res. Lett. 44, No. 2, 243--249 (2016; Zbl 1408.90187) Full Text: DOI
Andreatta, Giovanni; De Francesco, Carla; De Giovanni, Luigi; Serafini, Paolo Constrained domatic bipartition on trees. (English) Zbl 1387.05175 Discrete Optim. 22, Part B, 372-388 (2016). MSC: 05C69 90C10 90C27 90C35 90C57 90C39 68Q25 PDF BibTeX XML Cite \textit{G. Andreatta} et al., Discrete Optim. 22, Part B, 372--388 (2016; Zbl 1387.05175) Full Text: DOI
Campêlo, Manoel; Moura, Phablo F. S.; Santos, Marcio C. Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope. (English) Zbl 1387.05082 Discrete Optim. 21, 131-156 (2016). MSC: 05C15 90C27 90C35 90C57 PDF BibTeX XML Cite \textit{M. Campêlo} et al., Discrete Optim. 21, 131--156 (2016; Zbl 1387.05082) Full Text: DOI
Liers, Frauke; Martin, Alexander; Pape, Susanne Binary Steiner trees: structural results and an exact solution approach. (English) Zbl 1387.90141 Discrete Optim. 21, 85-117 (2016). MSC: 90C10 90C27 05C05 90C35 90C57 92D15 PDF BibTeX XML Cite \textit{F. Liers} et al., Discrete Optim. 21, 85--117 (2016; Zbl 1387.90141) Full Text: DOI
Massé, Damien; Euler, Reinhardt; Lemarchand, Laurent On the connected spanning cubic subgraph problem. (English) Zbl 1370.90225 Adiprasito, Karim (ed.) et al., Convexity and discrete geometry including graph theory. Mulhouse, France, September 1–11, 2014. Cham: Springer (ISBN 978-3-319-28184-1/hbk; 978-3-319-28186-5/ebook). Springer Proceedings in Mathematics & Statistics 148, 109-136 (2016). MSC: 90C27 90C35 90C57 05C99 PDF BibTeX XML Cite \textit{D. Massé} et al., in: Convexity and discrete geometry including graph theory. Mulhouse, France, September 1--11, 2014. Cham: Springer. 109--136 (2016; Zbl 1370.90225) Full Text: DOI
Padrol, Arnau Extension complexity of polytopes with few vertices or facets. (English) Zbl 1354.52014 SIAM J. Discrete Math. 30, No. 4, 2162-2176 (2016). MSC: 52B11 52B35 90C57 PDF BibTeX XML Cite \textit{A. Padrol}, SIAM J. Discrete Math. 30, No. 4, 2162--2176 (2016; Zbl 1354.52014) Full Text: DOI arXiv
Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Wolfler Calvo, Roberto A set covering approach for the double traveling salesman problem with multiple stacks. (English) Zbl 1452.90256 Cerulli, Raffaele (ed.) et al., Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9849, 260-272 (2016). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{M. Barbato} et al., Lect. Notes Comput. Sci. 9849, 260--272 (2016; Zbl 1452.90256) Full Text: DOI
Diarrassouba, Ibrahima; Mahjoub, Meriem; Mahjoub, A. Ridha; Taktak, Raouia The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut. (English) Zbl 1351.90043 Pióro, Michał (ed.) et al., Proceedings of the 7th international network optimization conference (INOC), Warsaw, Poland, May 18–20, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 52, 117-124, electronic only (2016). MSC: 90B10 90C35 90C57 90C05 90C10 PDF BibTeX XML Cite \textit{I. Diarrassouba} et al., Electron. Notes Discrete Math. 52, 117--124 (2016; Zbl 1351.90043) Full Text: DOI
Gelareh, Shahin; Monemi, Rahimeh Neamatian; Semet, Frédéric; Goncalves, Gilles A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints. (English) Zbl 1346.90492 Eur. J. Oper. Res. 249, No. 3, 1144-1152 (2016). MSC: 90B80 90C10 90C57 PDF BibTeX XML Cite \textit{S. Gelareh} et al., Eur. J. Oper. Res. 249, No. 3, 1144--1152 (2016; Zbl 1346.90492) Full Text: DOI
Solus, Liam; Uhler, Caroline; Yoshida, Ruriko Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors. (English) Zbl 1348.52010 Linear Algebra Appl. 509, 247-275 (2016). MSC: 52B12 52B20 05C10 PDF BibTeX XML Cite \textit{L. Solus} et al., Linear Algebra Appl. 509, 247--275 (2016; Zbl 1348.52010) Full Text: DOI
Damcı-Kurt, Pelin; Küçükyavuz, Simge; Rajan, Deepak; Atamtürk, Alper A polyhedral study of production ramping. (English) Zbl 1346.90627 Math. Program. 158, No. 1-2 (A), 175-205 (2016). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{P. Damcı-Kurt} et al., Math. Program. 158, No. 1--2 (A), 175--205 (2016; Zbl 1346.90627) Full Text: DOI
Chen, Qin; Chen, Xujin; Zang, Wenan A polyhedral description of kernels. (English) Zbl 1342.90105 Math. Oper. Res. 41, No. 3, 969-990 (2016). MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{Q. Chen} et al., Math. Oper. Res. 41, No. 3, 969--990 (2016; Zbl 1342.90105) Full Text: DOI
Avis, David; Meagher, Conor On the directed cut cone and polytope. (English) Zbl 1368.90135 J. Comb. Optim. 31, No. 4, 1685-1708 (2016). MSC: 90C27 PDF BibTeX XML Cite \textit{D. Avis} and \textit{C. Meagher}, J. Comb. Optim. 31, No. 4, 1685--1708 (2016; Zbl 1368.90135) Full Text: DOI
Neto, José On the diameter of cut polytopes. (English) Zbl 1338.52003 Discrete Math. 339, No. 5, 1605-1612 (2016). MSC: 52A10 90C27 05C35 05C10 90C35 PDF BibTeX XML Cite \textit{J. Neto}, Discrete Math. 339, No. 5, 1605--1612 (2016; Zbl 1338.52003) Full Text: DOI
Pashkovich, Kanstantsin; Weltge, Stefan Hidden vertices in extensions of polytopes. (English) Zbl 1408.52020 Oper. Res. Lett. 43, No. 2, 161-164 (2015). MSC: 52B11 90C57 PDF BibTeX XML Cite \textit{K. Pashkovich} and \textit{S. Weltge}, Oper. Res. Lett. 43, No. 2, 161--164 (2015; Zbl 1408.52020) Full Text: DOI arXiv
Conforti, Michele; Kaibel, Volker; Walter, Matthias; Weltge, Stefan Subgraph polytopes and independence polytopes of count matroids. (English) Zbl 1408.90250 Oper. Res. Lett. 43, No. 5, 457-460 (2015). MSC: 90C27 52B12 05B35 90C57 PDF BibTeX XML Cite \textit{M. Conforti} et al., Oper. Res. Lett. 43, No. 5, 457--460 (2015; Zbl 1408.90250) Full Text: DOI arXiv
Chopra, Sunil; Shim, Sangho; Steffy, Daniel E. A few strong knapsack facets. (English) Zbl 06766572 Defourny, Boris (ed.) et al., Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 13–15, 2014. Selected contributions. Cham: Springer (ISBN 978-3-319-23698-8/hbk; 978-3-319-23699-5/ebook). Springer Proceedings in Mathematics & Statistics 147, 77-94 (2015). MSC: 90C10 90C27 90C57 90C11 PDF BibTeX XML Cite \textit{S. Chopra} et al., in: Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 13--15, 2014. Selected contributions. Cham: Springer. 77--94 (2015; Zbl 06766572) Full Text: DOI
Erokhovets, N. Yu. \(k\)-belts and edge-cycles of three-dimensional simple polytopes with at most hexagonal facets. (Russian. English summary) Zbl 1338.51020 Dal’nevost. Mat. Zh. 15, No. 2, 197-213 (2015). MSC: 51M20 52B10 PDF BibTeX XML Cite \textit{N. Yu. Erokhovets}, Dal'nevost. Mat. Zh. 15, No. 2, 197--213 (2015; Zbl 1338.51020) Full Text: MNR
Avis, David; Tiwary, Hans Raj On the extension complexity of combinatorial polytopes. (English) Zbl 1336.90095 Math. Program. 153, No. 1 (B), 95-115 (2015). MSC: 90C35 90C60 PDF BibTeX XML Cite \textit{D. Avis} and \textit{H. R. Tiwary}, Math. Program. 153, No. 1 (B), 95--115 (2015; Zbl 1336.90095) Full Text: DOI arXiv
Arulselvan, Ashwin On the geometric rank of matching polytope. (English) Zbl 1319.90046 Math. Program. 152, No. 1-2 (A), 189-200 (2015). MSC: 90C11 51M20 90C57 PDF BibTeX XML Cite \textit{A. Arulselvan}, Math. Program. 152, No. 1--2 (A), 189--200 (2015; Zbl 1319.90046) Full Text: DOI
Kaibel, Volker; Weltge, Stefan A short proof that the extension complexity of the correlation polytope grows exponentially. (English) Zbl 1315.52021 Discrete Comput. Geom. 53, No. 2, 397-401 (2015). MSC: 52C45 90C57 PDF BibTeX XML Cite \textit{V. Kaibel} and \textit{S. Weltge}, Discrete Comput. Geom. 53, No. 2, 397--401 (2015; Zbl 1315.52021) Full Text: DOI arXiv
Padrol, Arnau; Pfeifle, Julian Polygons as sections of higher-dimensional polytopes. (English) Zbl 1312.52008 Electron. J. Comb. 22, No. 1, Research Paper P1.24, 16 p. (2015). Reviewer: Anna Romanowska (Warsaw) MSC: 52B99 90C57 15A23 PDF BibTeX XML Cite \textit{A. Padrol} and \textit{J. Pfeifle}, Electron. J. Comb. 22, No. 1, Research Paper P1.24, 16 p. (2015; Zbl 1312.52008) Full Text: Link arXiv
Hildenbrandt, Achim The target visitation problem. (English) Zbl 1322.90050 Heidelberg: Univ. Heidelberg, Naturwissenschaftlich-Mathematische Gesamtfakultät (Diss.). xiv, 154 p. (2015). Reviewer: Václav Koubek (Praha) MSC: 90C10 68Q25 90C05 90C27 90C57 90C59 PDF BibTeX XML Cite \textit{A. Hildenbrandt}, The target visitation problem. Heidelberg: Univ. Heidelberg, Naturwissenschaftlich-Mathematische Gesamtfakultät (Diss.) (2015; Zbl 1322.90050) Full Text: Link
Quaeghebeur, Erik Characterizing coherence, correcting incoherence. (English) Zbl 1388.68273 Int. J. Approx. Reasoning 56, Part B, 208-223 (2015). MSC: 68T37 60A05 90C29 90C57 PDF BibTeX XML Cite \textit{E. Quaeghebeur}, Int. J. Approx. Reasoning 56, Part B, 208--223 (2015; Zbl 1388.68273) Full Text: DOI
Escalante, Mariana; Nasini, Graciela Lovász and Schrijver \(N_+\)-relaxation on web graphs. (English) Zbl 1452.90310 Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 221-229 (2014). MSC: 90C35 90C57 PDF BibTeX XML Cite \textit{M. Escalante} and \textit{G. Nasini}, Lect. Notes Comput. Sci. 8596, 221--229 (2014; Zbl 1452.90310) Full Text: DOI
Chrétienne, Philippe; Fouilhoux, Pierre; Gourdin, Eric; Segura, Jean-Mathieu The location-dispatching problem: polyhedral results and content delivery network design. (English) Zbl 1331.90087 Discrete Appl. Math. 164, Part 1, 68-85 (2014). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{P. Chrétienne} et al., Discrete Appl. Math. 164, Part 1, 68--85 (2014; Zbl 1331.90087) Full Text: DOI
Eirinakis, Pavlos; Magos, Dimitrios; Mourtos, Ioannis From one stable marriage to the next: how long is the way? (English) Zbl 1309.90058 SIAM J. Discrete Math. 28, No. 4, 1971-1979 (2014). MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{P. Eirinakis} et al., SIAM J. Discrete Math. 28, No. 4, 1971--1979 (2014; Zbl 1309.90058) Full Text: DOI
Eirinakis, Pavlos; Magos, Dimitrios; Mourtos, Ioannis; Miliotis, Panayiotis Polyhedral aspects of stable marriage. (English) Zbl 1308.90107 Math. Oper. Res. 39, No. 3, 656-671 (2014). MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{P. Eirinakis} et al., Math. Oper. Res. 39, No. 3, 656--671 (2014; Zbl 1308.90107) Full Text: DOI
Li, Yuan; Pióro, Michał; Yuan, Di; Su, Jinshu Optimizing compatible sets in wireless networks through integer programming. (English) Zbl 1307.90119 EURO J. Comput. Optim. 2, No. 1-2, 1-15 (2014). MSC: 90C11 90B18 68R10 PDF BibTeX XML Cite \textit{Y. Li} et al., EURO J. Comput. Optim. 2, No. 1--2, 1--15 (2014; Zbl 1307.90119) Full Text: DOI
Michini, Carla; Sassano, Antonio The Hirsch conjecture for the fractional stable set polytope. (English) Zbl 1297.90086 Math. Program. 147, No. 1-2 (A), 309-330 (2014). MSC: 90C08 90C27 90C35 90C49 90C57 PDF BibTeX XML Cite \textit{C. Michini} and \textit{A. Sassano}, Math. Program. 147, No. 1--2 (A), 309--330 (2014; Zbl 1297.90086) Full Text: DOI
Bonato, Thorsten; Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni Lifting and separation procedures for the cut polytope. (English) Zbl 1297.90133 Math. Program. 146, No. 1-2 (A), 351-378 (2014). MSC: 90C27 90C57 90C20 90C09 82D30 PDF BibTeX XML Cite \textit{T. Bonato} et al., Math. Program. 146, No. 1--2 (A), 351--378 (2014; Zbl 1297.90133) Full Text: DOI
Maksimenko, A. N. Traveling salesman polytopes and cut polytopes. Affine reducibility. (English. Russian original) Zbl 1321.90117 Discrete Math. Appl. 23, No. 3-4, 251-259 (2013); translation from Diskretn. Mat. 25, No. 2, 31-38 (2013). MSC: 90C27 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, Discrete Math. Appl. 23, No. 3--4, 251--259 (2013; Zbl 1321.90117); translation from Diskretn. Mat. 25, No. 2, 31--38 (2013) Full Text: DOI
Pokutta, Sebastian; Van Vyve, Mathieu A note on the extension complexity of the knapsack polytope. (English) Zbl 1286.90168 Oper. Res. Lett. 41, No. 4, 347-350 (2013). MSC: 90C57 90C60 90C27 PDF BibTeX XML Cite \textit{S. Pokutta} and \textit{M. Van Vyve}, Oper. Res. Lett. 41, No. 4, 347--350 (2013; Zbl 1286.90168) Full Text: DOI
Shim, Sangho; Johnson, Ellis L. Cyclic group blocking polyhedra. (English) Zbl 1274.90239 Math. Program. 138, No. 1-2 (A), 273-307 (2013). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C10 90C27 90C57 90C60 52B05 52B11 52B12 52B55 05C21 05C25 20C40 PDF BibTeX XML Cite \textit{S. Shim} and \textit{E. L. Johnson}, Math. Program. 138, No. 1--2 (A), 273--307 (2013; Zbl 1274.90239) Full Text: DOI
Sebő, András Eight-fifth approximation for the path TSP. (English) Zbl 1336.90098 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 362-374 (2013). MSC: 90C35 90C27 90C57 90C59 68W25 PDF BibTeX XML Cite \textit{A. Sebő}, Lect. Notes Comput. Sci. 7801, 362--374 (2013; Zbl 1336.90098) Full Text: DOI arXiv
Rebennack, Steffen; Reinelt, Gerhard; Pardalos, Panos M. A tutorial on branch and cut algorithms for the maximum stable set problem. (English) Zbl 1270.90092 Int. Trans. Oper. Res. 19, No. 1-2, 161-199 (2012). MSC: 90C35 90C57 PDF BibTeX XML Cite \textit{S. Rebennack} et al., Int. Trans. Oper. Res. 19, No. 1--2, 161--199 (2012; Zbl 1270.90092) Full Text: DOI
Kaibel, Volker; Pashkovich, Kanstantsin; Theis, Dirk Oliver Symmetry matters for sizes of extended formulations. (English) Zbl 1267.90072 SIAM J. Discrete Math. 26, No. 3, 1361-1382 (2012). Reviewer: Samir Kumar Neogy (New Delhi) MSC: 90C10 90C57 52B12 PDF BibTeX XML Cite \textit{V. Kaibel} et al., SIAM J. Discrete Math. 26, No. 3, 1361--1382 (2012; Zbl 1267.90072) Full Text: DOI
Chen, Xujin; Ding, Guoli; Hu, Xiaodong; Zang, Wenan The maximum-weight stable matching problem: duality and efficiency. (English) Zbl 1282.90105 SIAM J. Discrete Math. 26, No. 3, 1346-1360 (2012). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{X. Chen} et al., SIAM J. Discrete Math. 26, No. 3, 1346--1360 (2012; Zbl 1282.90105) Full Text: DOI
Maksimenko, A. N. An analog of the Cook theorem for polytopes. (English. Russian original) Zbl 1262.90149 Russ. Math. 56, No. 8, 28-34 (2012); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2012, No. 8, 34-42 (2012). MSC: 90C27 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, Russ. Math. 56, No. 8, 28--34 (2012; Zbl 1262.90149); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2012, No. 8, 34--42 (2012) Full Text: DOI
Braun, Gábor; Pokutta, Sebastian An algebraic approach to symmetric extended formulations. (English) Zbl 1370.90292 Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 141-152 (2012). MSC: 90C57 20B99 52B12 PDF BibTeX XML Cite \textit{G. Braun} and \textit{S. Pokutta}, Lect. Notes Comput. Sci. 7422, 141--152 (2012; Zbl 1370.90292) Full Text: DOI arXiv
Lacroix, Mathieu; Mahjoub, A. Ridha; Martin, Sébastien Polyhedral analysis and branch-and-cut for the structural analysis problem. (English) Zbl 1370.90295 Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 117-128 (2012). MSC: 90C57 34A09 PDF BibTeX XML Cite \textit{M. Lacroix} et al., Lect. Notes Comput. Sci. 7422, 117--128 (2012; Zbl 1370.90295) Full Text: DOI
Borne, Sylvie; Grappe, Roland; Lacroix, Mathieu The uncapacitated asymmetric traveling salesman problem with multiple stacks. (English) Zbl 1370.90205 Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 105-116 (2012). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{S. Borne} et al., Lect. Notes Comput. Sci. 7422, 105--116 (2012; Zbl 1370.90205) Full Text: DOI
Günlük, Oktay; Lee, Jon; Leung, Janny A polytope for a product of real linear functions in 0/1 variables. (English) Zbl 1242.90111 Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17–21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 513-529 (2012). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{O. Günlük} et al., IMA Vol. Math. Appl. 154, 513--529 (2012; Zbl 1242.90111) Full Text: DOI
Gouveia, João; Laurent, Monique; Parrilo, Pablo A.; Thomas, Rekha A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. (English) Zbl 1262.90123 Math. Program. 133, No. 1-2 (A), 203-225 (2012). Reviewer: Jan-Joachim Rückmann (Puebla) MSC: 90C22 90C27 PDF BibTeX XML Cite \textit{J. Gouveia} et al., Math. Program. 133, No. 1--2 (A), 203--225 (2012; Zbl 1262.90123) Full Text: DOI arXiv
Ben-Ameur, Walid; Biha, Mohamed Didi On the minimum cut separator problem. (English) Zbl 1244.05171 Networks 59, No. 1, 30-36 (2012). MSC: 05C70 90C05 PDF BibTeX XML Cite \textit{W. Ben-Ameur} and \textit{M. D. Biha}, Networks 59, No. 1, 30--36 (2012; Zbl 1244.05171) Full Text: DOI
Laurent, M.; Varvitsiotis, A. Computing the Grothendieck constant of some graph classes. (English) Zbl 1235.90174 Oper. Res. Lett. 39, No. 6, 452-456 (2011). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Laurent} and \textit{A. Varvitsiotis}, Oper. Res. Lett. 39, No. 6, 452--456 (2011; Zbl 1235.90174) Full Text: DOI
Maksimenko, A. N. SAT polytopes are the faces of the polytopes of the traveling salesman problem. (Russian) Zbl 1249.90327 Diskretn. Anal. Issled. Oper. 18, No. 3, 76-83 (2011). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, Diskretn. Anal. Issled. Oper. 18, No. 3, 76--83 (2011; Zbl 1249.90327)
Magos, D.; Mourtos, I. On the facial structure of the alldifferent system. (English) Zbl 1229.90099 SIAM J. Discrete Math. 25, No. 1, 130-158 (2011). Reviewer: Mihai Cipu (Bucureşti) MSC: 90C10 90C57 90C27 05C90 52B15 52B12 PDF BibTeX XML Cite \textit{D. Magos} and \textit{I. Mourtos}, SIAM J. Discrete Math. 25, No. 1, 130--158 (2011; Zbl 1229.90099) Full Text: DOI
Dahl, Geir Polytopes related to interval vectors and incidence matrices. (English) Zbl 1234.05150 Linear Algebra Appl. 435, No. 11, 2955-2960 (2011). MSC: 05C50 52B12 90C57 PDF BibTeX XML Cite \textit{G. Dahl}, Linear Algebra Appl. 435, No. 11, 2955--2960 (2011; Zbl 1234.05150) Full Text: DOI
Au, Yu Hin; Tunçel, Levent Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes. (English) Zbl 1298.90054 Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 14-26 (2011). MSC: 90C10 90C22 90C57 PDF BibTeX XML Cite \textit{Y. H. Au} and \textit{L. Tunçel}, Lect. Notes Comput. Sci. 6655, 14--26 (2011; Zbl 1298.90054) Full Text: DOI
Studený, Milan; Vomlel, Jiří On open questions in the geometric approach to structural learning Bayesian nets. (English) Zbl 1243.68254 Int. J. Approx. Reasoning 52, No. 5, 627-640 (2011). Reviewer: Jerzy Martyna (Kraków) MSC: 68T05 52B12 90C57 PDF BibTeX XML Cite \textit{M. Studený} and \textit{J. Vomlel}, Int. J. Approx. Reasoning 52, No. 5, 627--640 (2011; Zbl 1243.68254) Full Text: DOI
Martí, Rafael; Reinelt, Gerhard The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (English) Zbl 1213.90005 Applied Mathematical Sciences 175. Berlin: Springer (ISBN 978-3-642-16728-7/hbk; 978-3-642-16729-4/ebook). xii, 171 p. (2011). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90-02 90-01 90C27 90C59 90C57 PDF BibTeX XML Cite \textit{R. Martí} and \textit{G. Reinelt}, The linear ordering problem. Exact and heuristic methods in combinatorial optimization. Berlin: Springer (2011; Zbl 1213.90005) Full Text: DOI
Berstein, Yael; Maruri-Aguilar, Hugo; Onn, Shmuel; Riccomagno, Eva; Wynn, Henry Minimal average degree aberration and the state polytope for experimental designs. (English) Zbl 1440.62304 Ann. Inst. Stat. Math. 62, No. 4, 673-698 (2010). MSC: 62K15 13P25 PDF BibTeX XML Cite \textit{Y. Berstein} et al., Ann. Inst. Stat. Math. 62, No. 4, 673--698 (2010; Zbl 1440.62304) Full Text: DOI
Stephan, Rüdiger Cardinality constrained combinatorial optimization: complexity and polyhedra. (English) Zbl 1241.90122 Discrete Optim. 7, No. 3, 99-113 (2010). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Stephan}, Discrete Optim. 7, No. 3, 99--113 (2010; Zbl 1241.90122) Full Text: DOI
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Biha, M. Didi; Mailfert, J. A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem. (English) Zbl 1207.05192 Networks 55, No. 1, 13-32 (2010). MSC: 05C85 05C82 90C35 PDF BibTeX XML Cite \textit{F. Bendali} et al., Networks 55, No. 1, 13--32 (2010; Zbl 1207.05192) Full Text: DOI
Cacchiani, Valentina; Caprara, Alberto; Toth, Paolo Solving a real-world train-unit assignment problem. (English) Zbl 1198.90049 Math. Program. 124, No. 1-2 (B), 207-231 (2010). MSC: 90B06 90B80 90C10 90C57 PDF BibTeX XML Cite \textit{V. Cacchiani} et al., Math. Program. 124, No. 1--2 (B), 207--231 (2010; Zbl 1198.90049) Full Text: DOI
Tyber, Steve; Johnson, Ellis L. A polyhedral study of the mixed integer cut. (English) Zbl 1285.90020 Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13035-9/pbk). Lecture Notes in Computer Science 6080, 124-134 (2010). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{S. Tyber} and \textit{E. L. Johnson}, Lect. Notes Comput. Sci. 6080, 124--134 (2010; Zbl 1285.90020) Full Text: DOI
Ohsugi, Hidefumi Normality of cut polytopes of graphs is a minor closed property. (English) Zbl 1230.05241 Discrete Math. 310, No. 6-7, 1160-1166 (2010). MSC: 05C70 05C83 52B10 PDF BibTeX XML Cite \textit{H. Ohsugi}, Discrete Math. 310, No. 6--7, 1160--1166 (2010; Zbl 1230.05241) Full Text: DOI arXiv
Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations. (English) Zbl 1184.90118 Math. Program. 121, No. 2 (A), 307-335 (2010). MSC: 90C20 90C22 90C27 PDF BibTeX XML Cite \textit{F. Rendl} et al., Math. Program. 121, No. 2 (A), 307--335 (2010; Zbl 1184.90118) Full Text: DOI
Mathieu, Claire; Sinclair, Alistair Sherali-Adams relaxations of the matching polytope. (English) Zbl 1304.90144 Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 293-302 (2009). MSC: 90C10 05C85 68Q17 68Q25 90C57 PDF BibTeX XML Cite \textit{C. Mathieu} and \textit{A. Sinclair}, in: Proceedings of the 41st annual ACM symposium on theory of computing, STOC '09. Bethesda, MD, USA, May 31 -- June 2, 2009. New York, NY: Association for Computing Machinery (ACM). 293--302 (2009; Zbl 1304.90144) Full Text: DOI
Galluccio, Anna; Gentile, Claudio; Ventura, Paolo Gear composition of stable set polytopes and \(\mathcal G\)-perfection. (English) Zbl 1218.90172 Math. Oper. Res. 34, No. 4, 813-836 (2009). MSC: 90C27 90C10 05C69 90C57 90C35 PDF BibTeX XML Cite \textit{A. Galluccio} et al., Math. Oper. Res. 34, No. 4, 813--836 (2009; Zbl 1218.90172) Full Text: DOI
Faenza, Yuri; Kaibel, Volker Extended formulations for packing and partitioning orbitopes. (English) Zbl 1218.90124 Math. Oper. Res. 34, No. 3, 686-697 (2009). MSC: 90C10 90C57 52B15 52B12 PDF BibTeX XML Cite \textit{Y. Faenza} and \textit{V. Kaibel}, Math. Oper. Res. 34, No. 3, 686--697 (2009; Zbl 1218.90124) Full Text: DOI arXiv
Balas, Egon; Stephan, Rüdiger On the cycle polytope of a directed graph and its relaxations. (English) Zbl 1207.05066 Networks 54, No. 1, 47-55 (2009). MSC: 05C20 90C35 90C57 PDF BibTeX XML Cite \textit{E. Balas} and \textit{R. Stephan}, Networks 54, No. 1, 47--55 (2009; Zbl 1207.05066) Full Text: DOI
Fouilhoux, Pierre; Labbé, Martine; Mahjoub, A. Ridha; Yaman, Hande Generating facets for the independence system polytope. (English) Zbl 1213.90179 SIAM J. Discrete Math. 23, No. 3, 1484-1506 (2009). Reviewer: Mihai Cipu (Bucureşti) MSC: 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{P. Fouilhoux} et al., SIAM J. Discrete Math. 23, No. 3, 1484--1506 (2009; Zbl 1213.90179) Full Text: DOI