Rodrigues de Sousa, Vilmar Jefté; Anjos, Miguel F.; Le Digabel, Sébastien Computational study of a branching algorithm for the maximum \(k\)-cut problem. (English) Zbl 1506.90233 Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022). MSC: 90C27 90C22 90C57 PDFBibTeX XMLCite \textit{V. J. Rodrigues de Sousa} et al., Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022; Zbl 1506.90233) Full Text: DOI
Pan, Stefania; Wolfler Calvo, Roberto; Akplogan, Mahuna; Létocart, Lucas; Touati, Nora A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. (English) Zbl 1506.90108 Discrete Optim. 33, 146-168 (2019). MSC: 90B35 90C10 90C59 PDFBibTeX XMLCite \textit{S. Pan} et al., Discrete Optim. 33, 146--168 (2019; Zbl 1506.90108) Full Text: DOI
Kleinert, Thomas; Schmidt, Martin Global optimization of multilevel electricity market models including network design and graph partitioning. (English) Zbl 1474.90302 Discrete Optim. 33, 43-69 (2019). MSC: 90C11 90-08 90B10 90C35 90C90 PDFBibTeX XMLCite \textit{T. Kleinert} and \textit{M. Schmidt}, Discrete Optim. 33, 43--69 (2019; Zbl 1474.90302) Full Text: DOI
Charkhgard, Hadi; Subramanian, Vignesh; Silva, Walter; Das, Tapas K. An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections. (English) Zbl 1454.92028 Discrete Optim. 30, 144-167 (2018). MSC: 92D30 90B10 90C11 PDFBibTeX XMLCite \textit{H. Charkhgard} et al., Discrete Optim. 30, 144--167 (2018; Zbl 1454.92028) Full Text: DOI
Yu, Jiajin; Ahmed, Shabbir Polyhedral results for a class of cardinality constrained submodular minimization problems. (English) Zbl 1387.90167 Discrete Optim. 24, 87-102 (2017). MSC: 90C11 90C30 90C57 PDFBibTeX XMLCite \textit{J. Yu} and \textit{S. Ahmed}, Discrete Optim. 24, 87--102 (2017; Zbl 1387.90167) 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 PDFBibTeX XMLCite \textit{F. Liers} et al., Discrete Optim. 21, 85--117 (2016; Zbl 1387.90141) Full Text: DOI
Hemmati, Mehdi; Smith, J. Cole A mixed-integer bilevel programming approach for a competitive prioritized set covering problem. (English) Zbl 1387.90135 Discrete Optim. 20, 105-134 (2016). MSC: 90C10 91A65 PDFBibTeX XMLCite \textit{M. Hemmati} and \textit{J. C. Smith}, Discrete Optim. 20, 105--134 (2016; Zbl 1387.90135) Full Text: DOI
Hupp, Lena; Klein, Laura; Liers, Frauke An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations. (English) Zbl 1387.90173 Discrete Optim. 18, 193-216 (2015). MSC: 90C20 05C70 05C85 90C35 90C10 90B80 90C57 PDFBibTeX XMLCite \textit{L. Hupp} et al., Discrete Optim. 18, 193--216 (2015; Zbl 1387.90173) Full Text: DOI
Grigoriev, Alexander; Uetz, Marc Scheduling jobs with time-resource tradeoff via nonlinear programming. (English) Zbl 1175.90166 Discrete Optim. 6, No. 4, 414-419 (2009). MSC: 90B35 90C59 90C60 PDFBibTeX XMLCite \textit{A. Grigoriev} and \textit{M. Uetz}, Discrete Optim. 6, No. 4, 414--419 (2009; Zbl 1175.90166) Full Text: DOI Link
Bonami, Pierre; Biegler, Lorenz T.; Conn, Andrew R.; Cornuéjols, Gérard; Grossmann, Ignacio E.; Laird, Carl D.; Lee, Jon; Lodi, Andrea; Margot, François; Sawaya, Nicolas; Wächter, Andreas An algorithmic framework for convex mixed integer nonlinear programs. (English) Zbl 1151.90028 Discrete Optim. 5, No. 2, 186-204 (2008). MSC: 90C11 90C25 PDFBibTeX XMLCite \textit{P. Bonami} et al., Discrete Optim. 5, No. 2, 186--204 (2008; Zbl 1151.90028) Full Text: DOI
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu Computing integral solutions of complementarity problems. (English) Zbl 1153.90552 Discrete Optim. 4, No. 3-4, 315-321 (2007). MSC: 90C33 90C26 91B50 PDFBibTeX XMLCite \textit{G. van der Laan} et al., Discrete Optim. 4, No. 3--4, 315--321 (2007; Zbl 1153.90552) Full Text: DOI Link