Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems

References

• Applegate DL, Bixby RE, Chvátal V, Cook WJ, Espinoza DG, Goycoolea M, Helsgaun K (2009) Certification of an optimal TSP tour through 85,900 cities. Oper. Res. Lett. 37(1):11–15.Crossref, Google Scholar
• Baes M, Oertel T, Weismantel R (2016) Duality for mixed-integer convex minimization. Math. Programming 158(1–2):547–564.Crossref, Google Scholar
• Basu A, Conforti M, Cornuéjols G, Weismantel R, Weltge S (2017) Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6):671–674.Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization Over Integers, vol. 13 (Dynamic Ideas, Belmont, MA).Google Scholar
• Bikhchandani S, Mamer JW (1997) Competitive equilibrium in an exchange economy with indivisibilities. J. Econom. Theory 74(2):385–413.Crossref, Google Scholar
• Bikhchandani S, Ostroy JM (2002) The package assignment model. J. Econom. Theory 107(2):377–406.Crossref, Google Scholar
• Borndörfer R, Ferreira C, Martin A (1998) Decomposing matrices into blocks. SIAM J. Optim. 9(1):236–269.Crossref, Google Scholar
• Bussieck MR, Drud AS, Meeraus A (2003) Minlplib—A collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1):114–119.Link, Google Scholar
• Cheung KKH, Gleixner A, Steffy D (2017) Verifying integer programming results. Eisenbrand F, Koenemann J, eds. Proc. 19th Internat. Conf. of Integer Programming and Combinatorial Optim., vol. 10328 (Springer International Publishing, Cham, Switzerland), 148–160.Google Scholar
• Daskin MS, Maass KL (2015) The p-median problem. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 21–45.Crossref, Google Scholar
• Doignon J-P (1973) Convexity in cristallographical lattices. J. Geometry 3:71–85.Crossref, Google Scholar
• Geißler B, Morsi A, Schewe L, Schmidt M (2018) Solving highly detailed gas transport minlps: Block separability and penalty alternating direction methods. INFORMS J. Comput. 30(2):309–323.Link, Google Scholar
• Gleixner A, Hendel G, Gamrath G, Achterberg T, Bastubbe M, Berthold T, Christophel PM, et al. (2021) MIPLIB 2017: Data-driven compilation of the 6th mixed-integer programming library. Math. Programming Comput. 13(3):443–490.Crossref, Google Scholar
• Gurobi Optimization LLC (2023) Gurobi Optimizer Reference Manual. Retrieved July 3, http://www.gurobi.com.Google Scholar
• Halbig K, Hümbs L, Rösel F, Schewe L, Weninger D (2023) Computing optimality certificates for convex mixed-integer nonlinear problems. https://dx.doi.org//10.1287/ijoc.2022.0099.cd, https://github.com/INFORMSJoC/2022.0099.Google Scholar
• Heule MJH, Hunt WA Jr, Wetzler N (2013) Verifying refutations with extended resolution. Bonacina MP, ed. Proc. 24th Internat. Conf. on Automated Deduction, vol. 7898 (Springer, Berlin), 345–359.Google Scholar
• Jahn J, Knossalla M (2018) Lagrange theory of discrete-continuous nonlinear optimization. J. Nonlinear Variational Anal. 2(3):317–342.Google Scholar
• Konno H, Yamamoto R (2009) Choosing the best set of variables in regression analysis using integer programming. J. Global Optim. 44(2):273–282.Crossref, Google Scholar
• Kronqvist J, Bernal DE, Lundell A, Grossmann IE (2019) A review and comparison of solvers for convex MINLP. Optim. Engrg. 20(2):397–455.Crossref, Google Scholar
• Kuhn HW, Tucker AW (1951) Nonlinear programming. Proc. 2nd Berkeley Sympos. on Math. Statist. and Probability (University of California Press, Berkeley), 481–492.Google Scholar
• Lenstra HW Jr (1983) Integer programming with a fixed number of variables. Math. Oper. Res. 8(4):538–548.Link, Google Scholar
• Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, New York).Google Scholar
• Martin A (1999) Integer programs with block structure (No. SC-99-03), Zuse Institute, Berlin, Germany, 1–205.Google Scholar
• Regionales Rechenzentrum Erlangen (n.d.) Woodcrest cluster. Retrieved November 12, 2021, https://hpc.fau.de/systems-services/systems-documentation-instructions/clusters/woody-cluster/.Google Scholar
• Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Schewe L, Schmidt M, Weninger D (2020) A decomposition heuristic for mixed-integer supply chain problems. Oper. Res. Lett. 48(3):225–232.Crossref, Google Scholar
• Wetzler N, Heule MJH, Hunt WA Jr (2014) Drat-trim: Efficient checking and trimming using expressive clausal proofs. Sinz C, Egly U, eds. Proc. 17th Internat. Conf. on Theory and Applications of Satisfiability Testing, vol. 8561 (Springer, Berlin), 422–429.Google Scholar