betaFeedback

WorksMathematics

Intersection Cuts for Mixed-Integer Nonlinear Programs via Decision-Diagram-Free Sets

Abstract

We introduce a novel decision-diagram-based framework for generating intersection cuts to strengthen polyhedral relaxations of bounded mixed-integer nonlinear programs (MINLPs) with general nonlinear constraints. Building on decision diagrams (DDs) that provide outer approximations of MINLP feasible regions, we propose the concept of DD-free sets, which are convex regions whose interiors do not intersect the sets represented by the DDs. By exploiting the underlying graphical structure, we develop efficient methods for constructing these regions without requiring restrictive assumptions on the functional form of nonlinear constraints or access to distance oracles. We investigate the maximality properties of DD-free sets and devise algorithms for obtaining maximal forbidden regions within several structured classes. The resulting intersection cuts exploit geometric information retained in DD representations, enabling further strengthening of relaxations beyond what can be achieved through conventional DD-based convexification. We also introduce interval DDs to facilitate the representation of general nonlinear constraints and establish convergence results for intersections of constraint-specific DDs, providing a theoretical foundation for their integration into global optimization frameworks. Computational experiments on challenging open instances from MINLPLib, encompassing a broad range of nonlinear and nonconvex structures, demonstrate that the proposed approach can substantially improve dual bounds and achieve greater optimality-gap closure than state-of-the-art global optimization solvers. These findings highlight the potential of exploiting graphical representations of infeasible regions to develop stronger cutting planes for general MINLPs.

Funding: This work was supported in part by the U.S. Air Force Office of Scientific Research grant FA9550261B176, and the National Science Foundation grant CMMI-2547883.

Key words: Decision diagrams; Mixed-integer nonlinear programs; SS-free sets; Intersection cuts; Cutting planes; Global optimization;

Introduction

Intersection cuts provide a classical geometric approach to strengthening linear programming (LP) relaxations of mixed-integer linear programs [3, 15]. These cuts are derived from convex forbidden regions, or SS-free sets, whose interiors do not intersect the relevant feasible set SS. Intersection cuts have also been developed for mixed-integer nonlinear programs (MINLPs), including problems with polynomial [8] and signomial constraints [51]. For general MINLP constraints, however, a central challenge is to construct SS-free sets in a computationally tractable form and to exploit them efficiently in cut generation.

Several existing approaches construct such forbidden regions by exploiting specific properties of nonlinear constraint functions, including factorability [45] and Lipschitz continuity with known constants [27, 42], or by assuming access to geometric information about the feasible set, such as a distance oracle [8]. These requirements limit their applicability to more general MINLPs that do not satisfy such structural assumptions.

Recently, [19] showed that general bounded MINLPs can be modeled using decision diagrams (DDs), providing a graphical representation of their feasible regions. By employing cut-generation methods, this representation can be used to construct polyhedral outer approximations of MINLPs.

In this paper, we show that such DD representation offers an additional advantage beyond generating cutting planes for the feasible region: it also provides graph-based structural information about the infeasible region of the problem. This observation motivates the notion of a decision-diagram-free (DD-free) set, defined as a convex set whose interior does not intersect the feasible region represented by the DD. Since this DD contains the original feasible set, every DD-free set is also SS-free and can therefore serve as a forbidden region for cut generation. For points in the relaxation that lie outside the DD feasible region, we exploit the graphical structure of the DD to efficiently construct DD-free regions and develop procedures for attaining set maximality within different classes of DD-free sets.

This DD-free construction also provides a mechanism for strengthening DD-based outer approximations beyond the convexification of DDs representing individual nonlinear constraints of the MINLP. Existing DD-based cut-generation methods derive inequalities that are valid for the convex hulls of the sets represented by the DDs [19, 21, 49]. For fixed diagrams, however, such cuts cannot separate points that lie in the intersection of these convex hulls, even when they are excluded by an individual DD. By combining the nonconvex geometric information retained by the DDs with information from the current polyhedral relaxation, the proposed intersection cuts can separate such points when they are extreme points of that relaxation. This approach avoids the potentially costly construction of a joint DD representing the intersection of the solution sets associated with multiple nonlinear constraints.

To demonstrate the effectiveness of the proposed methods for constructing DD-free sets and generating intersection cuts, we conduct computational experiments on several classes of MINLPs from MINLPLib that are classified as ‘open’ problems, meaning that a gap remains between the dual bounds obtained by existing solvers and the best-known primal bounds. These instances span a broad range of nonlinear structures, including quadratic, polynomial, fractional, exponential, logarithmic, and other forms. Our results show that the dual bounds obtained using the proposed DD-based cutting planes can substantially outperform those produced by state-of-the-art global solvers, highlighting the potential of the proposed approach.

Review of Relevant Work

Balas [3] introduced intersection cuts for integer programming; see also [15] for a survey of corner polyhedra and intersection cuts. For MINLPs, intersection cuts have been developed using SS-free sets constructed by exploiting nonlinear constraint structures or geometric information about feasible regions. For factorable nonlinear constraints, Serrano [45] constructs concave underestimators that are tight at the point to be separated and uses the corresponding nonnegative superlevel sets as convex SS-free regions for generating intersection cuts. Related constructions include outer-product-free sets for polynomial optimization [8], quadratic-free sets for quadratic constraints [38], and signomial term-free sets for signomial programming [51]. Beyond these specialized constructions, Bienstock et al. [8] also develop a cutting-plane method for strengthening polyhedral outer approximations using SS-free Euclidean balls, assuming access to a distance oracle for a closed set SS. In a different approach, Schmidt et al. [42] construct nonconvex outer approximations by excluding open ℓ∞\ell_{\infty}-balls around points violating implicit nonlinear equality constraints, with radii determined by constraint residuals and known global Lipschitz constants. Göß et al. [27] then generalize this idea to vector-valued nonlinear inequality constraints and a broader class of norms. In our approach, valid lower bounds on nonlinear constraint functions over box domains form the basis for compiling DD relaxations, enabling efficient graph-based construction of DD-free regions in a general bounded MINLP setting.

For intersection cuts, enlarging an SS-free set can strengthen the resulting cut, motivating the study of inclusion-wise maximal SS-free sets [8, 14]. For S=ZnS = \mathbb{Z}^{n}, full-dimensional maximal SS-free sets are polyhedra with an integer point in the relative interior of each facet [4, 35]. Maximality results have also been developed for outer-product-free sets in polynomial optimization [8] and for quadratic-free sets [37, 38, 39]. In our setting, we first analyze maximality for general convex sets and then specialize the analysis to structured families inspired by norm-induced DD-free balls, for which tractable results can be obtained. We also develop efficient procedures for enlarging these sets and achieve maximality.

More broadly, spatial branch-and-bound (B&B) methods for globally solving MINLPs typically rely on convex relaxations and bound tightening; see [34] for a recent review. Tawarmalani and Sahinidis [48] develop a polyhedral branch-and-cut approach that exploits convex subexpressions to generate relaxations and cutting planes. Further developments in strengthening polyhedral relaxations for specific problem classes include learning-based partitioning of variable domains to improve approximations for quadratic problems [29], convex hull characterization for bilinear programs [20, 28, 32], and convexification of multilinear terms in binary polynomial optimization DDs provide a complementary graphical approach to developing relaxations and cutting planes [22, 23].

In their standard use for discrete optimization, DDs represent sets of variable assignments using layered directed acyclic graphs, with each root-to-terminal path encoding an assignment; see [6, 50]. Early work developed binary decision diagrams (BDDs) for representing and manipulating Boolean functions [1, 9]. BDDs have also been used to construct feasible solutions and primal bounds for binary optimization [7]. Multivalued decision diagrams (MDDs) extend BDDs from binary variables to discrete variables with general finite domains [46]. Andersen et al. [2] introduced relaxed MDD representations for constraint programming by limiting the diagram width to control its size. Ciré and van Hoeve [13] developed limited-width MDD relaxations for sequencing problems. Cappart et al. [10] use deep reinforcement learning to learn variable orderings for improving the bounds obtained from relaxed and restricted DDs. Serra and Hooker [44] develop compact weighted DD representations of near-optimal integer programming solutions for postoptimality analysis. For discrete optimization, relaxed DDs have subsequently been integrated into B&B frameworks to provide dual bounds [26, 33]. Methods for parallelizing DD-based B&B algorithms have also been investigated to improve the scalability of the solution process [5, 31].

For continuous nonlinear programs, Davarnia [17] extends DD-based modeling to continuous domains through arc-reduced DD relaxations. For mixed-integer optimization, Salemi and Davarnia [40] establish necessary and sufficient conditions for DD-representability of compact mixed-integer sets using rectangular decompositions and develop a specialized DD-based Benders decomposition for bounded MILPs. This extension has enabled the application of DD-based solution methods to broader problem classes such as unit commitment [40], unsplittable network-flow problems [41], and sparse regression with nonconvex regularization [18].

DDs have also been used for cut generation; see [11] for a survey. Tjandraatmadja and van Hoeve [49] exploit the connection between DDs and polar sets to generate target cuts for the convex hull of the set represented by a relaxed DD. Davarnia and van Hoeve [21] develop a cut-generating linear program and a subgradient-type method for separating points from such convex hulls and incorporate the resulting cuts into outer-approximation methods for integer nonlinear programs. More recently, Davarnia et al. [19] extend DD-based convexification and cut generation to general bounded MINLPs within a spatial B&B framework that guarantees convergence to global optimal solutions. In this paper, we build on these results by exploiting the DD structure used to model MINLPs to construct DD-free regions, which are then used to derive intersection cuts.

Contributions

Contributions to the MINLP literature This work introduces a new framework for constructing SS-free sets for bounded MINLPs with constraints of general functional form, thereby addressing a gap in the literature for problems that do not satisfy the structural assumptions or fall within the problem classes covered by existing frameworks for deriving intersection cuts. We establish maximality properties for the proposed sets and develop efficient algorithms for attaining maximality in different settings. We discuss how these DD-free sets can be used to derive intersection cuts that strengthen MINLP relaxations. We further demonstrate the effectiveness of the proposed framework through computational experiments on a collection of open benchmark instances from the MINLPLib. Our approach achieves greater gap closure than state-of-the-art global solvers, even when those solvers are configured to aggressively exploit their full suite of relaxation-strengthening techniques and tools.

Contributions to the DD literature This work advances the recent line of research on extending DD-based solution methods to MINLPs by introducing a new framework for deriving an important class of cutting planes, namely intersection cuts, directly from DD structures to strengthen problem relaxations. In particular, we show that the proposed intersection cuts can strengthen previously developed DD cuts, providing a systematic mechanism for extracting additional strength from a given DD representation. We also establish convergence results for the intersection of DDs associated with multiple constraints, which provides a theoretical foundation for combining constraint-specific DD representations within a unified global optimization framework. This work further extends the graphical DD framework through the introduction of interval DDs, which compactly represent state values for arc reduction when modeling general MINLP constraints. This representation facilitates the translation of forbidden regions identified in the DD space.

The remainder of this paper is organized as follows. Section 2 presents the notation, problem formulation, and basic DD concepts. § 3 introduces interval DDs, describes their construction as relaxations of individual nonlinear constraints, and reviews their use in outer approximation. Section 4 introduces DD-free sets, establishes convergence results for the associated cut closures, and describes how these sets are used to derive intersection cuts. § 5 establishes general maximality results for DD-free sets, characterizes maximality within the families of DD-free boxes and ℓp\ell_p-balls, and develops procedures for enlarging these sets to strengthen the resulting cuts. Section 6 presents computational experiments on benchmark MINLP instances to evaluate the performance of the proposed methods against state-of-the-art solvers. Section 7 concludes the paper.

Preliminaries

In this section, we introduce the notation used throughout the paper, formulate the class of MINLPs under consideration, and review the basic concepts of decision diagrams.

Notation

We use bold letters for tuples, vectors, and matrices. For a vector x∈Rn\mathbf{x} \in\mathbb{R}^{n}, xix_i denotes its ii-th component. We generally use calligraphic letters for sets (e.g., P\mathcal{P}) and uppercase Roman letters for index sets (e.g., II), with occasional exceptions following standard notation. For an index set II, ∣I∣|I| denotes its cardinality. Symbols associated with decision diagrams (DDs) are typeset in typewriter font (e.g., D\mathtt{D}).

We let N:={1,2,…}\mathbb{N} := \{1,2,\ldots\} and W:={0,1,2,…}\mathbb{W} := \{0,1,2,\ldots\} denote the sets of positive and nonnegative integers, respectively. For k∈Wk \in\mathbb{W}, we write [k]:={1,2,…,k}[k] := \{1,2,\ldots,k\}, with [0]:=∅[0] := \emptyset. For δ∈R\delta\in\mathbb{R}, let (δ)+:=max⁡{δ,0}(\delta)_{+} := \max\{\delta,0\} denote its positive part.

For a set S⊆RnS \subseteq\mathbb{R}^{n}, conv⁡(S)\operatorname{conv}(S), cl⁡(S)\operatorname{cl}(S), int⁡(S)\operatorname{int}(S), relint⁡(S)\operatorname{relint}(S), and bd⁡(S)\operatorname{bd}(S) denote its convex hull, closure, interior, relative interior, and boundary, respectively. For a convex set CC, ext⁡(C)\operatorname{ext}(C) denotes its set of extreme points. For a nonempty compact set S⊆RS \subseteq\mathbb{R}, we write S↓:=min⁡{x:x∈S}S \downarrow:= \min\{x:x \in S\} and S↑:=max⁡{x:x∈S}S \uparrow:= \max\{x:x \in S\}. Unless stated otherwise, an interval is understood to be nonempty and compact. A hyperrectangle is a Cartesian product of intervals.

For p∈[1,∞]p \in[1,\infty], let ∥⋅∥p\|\cdot\|_{p} denote the standard ℓp\ell_{p}-norm on Rn\mathbb{R}^{n}. Specifically, ∥x∥p:=(∑i∈[n]∣xi∣p)1/p\|\mathbf{x}\|_{p} := \left(\sum_{i \in[n]} |x_i|^{p}\right)^{1/p} for p∈[1,∞)p \in[1,\infty), and ∥x∥∞:=max⁡i∈[n]∣xi∣\|\mathbf{x}\|_{\infty} := \max_{i \in[n]} |x_i|. For x∈Rn\mathbf{x} \in\mathbb{R}^{n} and r≥0r \geq0, let

Bp(x,r):={y∈Rn:∥y−x∥p≤r}B_{p}(\mathbf{x},r) := \{\mathbf{y} \in\mathbb{R}^{n} : \|\mathbf{y}-\mathbf{x}\|_{p} \leq r\}

denote the closed ℓp\ell_{p}-ball of radius rr centered at x\mathbf{x}. For x∈Rn\mathbf{x} \in\mathbb{R}^{n} and a nonempty set S⊆RnS \subseteq\mathbb{R}^{n}, we define

dp(x,S):=inf⁡s∈S∥x−s∥p.d_{p}(\mathbf{x},S) := \inf_{s \in S}\|\mathbf{x}-\mathbf{s}\|_{p}.

When SS is closed, the infimum is attained.

Problem Formulation

Consider an MINLP of the form

ζ∗:=max⁡x cTx(1)\zeta^{*} := \max_{\mathbf{x}}\ c^{\mathsf{T}}\mathbf{x} \tag*{(1)}
s.t.gk(x)≤bk,∀k∈K,(2)\mathrm{s.t.}\quad g^{k}(\mathbf{x}) \leq b_{k},\qquad\forall k \in K, \tag*{(2)}
xi∈Di,∀i∈I∪J,(3)x_i \in D_i,\qquad\forall i \in I \cup J, \tag*{(3)}

Here, II and JJ are disjoint index sets of integer and continuous variables, respectively, and I∪J=[n]I \cup J = [n] indexes all decision variables. For each i∈[n]i \in[n], Di\mathcal{D}_i denotes the domain of variable xix_i, where Di=[Di↓,Di↑]∩Z\mathcal{D}_i = [\mathcal{D}_i \downarrow, \mathcal{D}_i \uparrow] \cap\mathbb{Z} if i∈Ii \in I, and Di=[Di↓,Di↑]\mathcal{D}_i = [\mathcal{D}_i \downarrow, \mathcal{D}_i \uparrow] if i∈Ji \in J. We write D:=∏i∈[n]Di\mathcal{D} := \prod_{i \in[n]} \mathcal{D}_i for the domain of x\mathbf{x}. Let KK be a nonempty finite index set for the nonlinear constraints. For each k∈Kk \in K, we assume that gkg^k is well defined and bounded below over D\mathcal{D}. We define the feasible region associated with the kk-th nonlinear constraint by

Gk:={x∈D:gk(x)≤bk}.\mathcal{G}^k := \{\mathbf{x} \in\mathcal{D} : g^k(\mathbf{x}) \le b_k\}.

Decision Diagram Overview

A DD D=(U,A,l(⋅))\mathcal{D} = (U, A, l(\cdot)) over variables x1,…,xnx_1, \ldots, x_n is a layered directed acyclic graph. Its node set UU is partitioned into layers U1,…,Un+1U_1, \ldots, U_{n+1}, and its arc set AA is partitioned into layers A1,…,AnA_1, \ldots, A_n. Arc layer AiA_i corresponds to variable xix_i for each i∈[n]i \in[n]. Layer U1U_1 contains a single root node rr, and layer Un+1U_{n+1} contains a single terminal node tt. For each i∈[n]i \in[n], every arc a∈Aia \in A_i is directed from its tail node tail⁡(a)∈Ui\operatorname{tail}(a) \in U_i to its head node head⁡(a)∈Ui+1\operatorname{head}(a) \in U_{i+1}. Each node u∈Uu \in U is associated with a state, denoted by s(u)s(u), and the mapping l:A→Rl : A \to\mathbb{R} assigns a label to each arc a∈Aa \in A. For a node u∈Uu \in U, let e+(u)e^+(u) and e−(u)e^-(u) denote the sets of its outgoing and incoming arcs, respectively. The width of D\mathcal{D} is the maximum number of nodes in any node layer, i.e., width⁡(D):=max⁡j∈[n+1]∣Uj∣\operatorname{width}(\mathcal{D}) := \max_{j \in[n+1]} |U_j|.

An rr–tt path pp of D\mathcal{D} is an arc sequence p=(a1,…,an)p = (a_1, \ldots, a_n) with ai∈Aia_i \in A_i for all i∈[n]i \in[n] such that tail⁡(a1)=r\operatorname{tail}(a_1) = r, head⁡(an)=t\operatorname{head}(a_n) = t, and head⁡(ai)=tail⁡(ai+1)\operatorname{head}(a_i) = \operatorname{tail}(a_{i+1}) for all i∈[n−1]i \in[n-1]. When the label mapping l:A→Rl : A \to\mathbb{R} is scalar-valued, the path pp encodes the assignment xi=l(ai)x_i = l(a_i) for all i∈[n]i \in[n]. In particular, bounded subsets of Zn\mathbb{Z}^n can be represented by DDs with integer-valued arc labels.

Throughout, we take the node set of a DD to consist of its root, its terminal, and the endpoints of its arcs. For any such DD containing an rr–tt path, we have

∣U∣≤2∣A∣andn≤∣A∣.(4)|U| \le2|A| \qquad\text{and} \qquad n \le|A|. \tag*{(4)}

Indeed, every node is incident to at least one arc, and every rr–tt path contains exactly nn arcs. Consequently, in the subsequent running-time analyses, we express the complexity in terms of ∣A∣|A|, as both ∣U∣|U| and nn are O(∣A∣)O(|A|).

In Section 3, we extend this DD representation by allowing arcs to carry intervals of values. The resulting interval decision diagrams (IDDs) will be used to model MINLP structures that contain both discrete and continuous variables.

Interval Decision Diagrams

IDDs extend standard DDs by allowing arcs to carry interval-valued labels; see, e.g., [47]. Here, we use IDDs to represent relaxations of nonlinear feasible regions as finite unions of hyperrectangles.

References

  1. [1]Akers S (1978) Binary decision diagrams. IEEE Transactions on computers 100(6):509–516.DOI
  2. [2]Andersen HR, Hadzic T, Hooker JN, Tiedemann P (2007) A constraint store based on multivalued decision diagrams. International Conference on Principles and Practice of Constraint Programming, 118–132 (Springer).
  3. [3]Balas E (1971) Intersection cuts—a new type of cutting planes for integer programming. Operations Research 19(1):19–39.DOI
  4. [4]Basu A, Conforti M, Cornuéjols G, Zambelli G (2010) Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research 35(3):704–720.
  5. [5]Bergman D, Cire AA, Sabharwal A, Samulowitz H, Saraswat V, van Hoeve WJ (2014) Parallel combinatorial optimization with decision diagrams. International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 351–367 (Springer).DOI
  6. [6]Bergman D, Cire AA, Van Hoeve WJ, Hooker J (2016) Decision diagrams for optimization, volume 1 (Springer).
  7. [7]Bergman D, Cire AA, van Hoeve WJ, Yunes T (2014) Bdd-based heuristics for binary optimization. Journal of Heuristics 20(2):211–234.DOI
  8. [8]Bienstock D, Chen C, Munoz G (2020) Outer-product-free sets for polynomial optimization and oracle-based cuts. Mathematical Programming 183(1):105–148.arxiv.org/abs/1610.04604
  9. [9]Bryant RE (1986) Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions on C-35(8):677–691.
  10. [10]Cappart Q, Bergman D, Rousseau LM, Prémont-Schwarz I, Parjadis A (2022) Improving variable orderings of approximate decision diagrams using reinforcement learning. INFORMS Journal on Computing 34(5):2552–2570.DOI
  11. [11]Castro MP, Cire AA, Beck JC (2022) Decision diagrams for discrete optimization: A survey of recent advances. INFORMS Journal on Computing 34(4):2271–2295.arxiv.org/abs/2201.11536
  12. [12]Chvátal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete mathematics 4(4):305–337.
  13. [13]Cire AA, Van Hoeve WJ (2013) Multivalued decision diagrams for sequencing problems. Operations Research 61(6):1411–1428.
  14. [14]Conforti M, Cornuéjols G, Daniilidis A, Lemaréchal C, Malick J (2015) Cut-generating functions and s-free sets. Mathematics of Operations Research 40(2):276–391.DOI
  15. [15]Conforti M, Cornuéjols G, Zambelli G (2011) Corner polyhedron and intersection cuts. Surveys in operations research and management science 16(2):105–120.DOI
  16. [16]Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, volume 271 of Graduate Texts in Mathematics (Cham: Springer International Publishing), URL http://dx.doi.org/10.1007/978-3-319-11008-0.
  17. [17]Davarnia D (2021) Strong relaxations for continuous nonlinear programs based on decision diagrams. Operations Research Letters 49(2):239–245.DOI
  18. [18]Davarnia D, Kiaghadi M (2025) A graphical global optimization framework for parameter estimation of statistical models with nonconvex regularization functions. Li Y, Mandt S, Agrawal S, Khan E, eds., Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, volume 258 of Proceedings of Machine Learning Research, 3484–3492 (PMLR), URL https://proceedings.mlr.press/v258/davarnia25a.html.arxiv.org/abs/2505.03899
  19. [19]Davarnia D, Kiaghadi M, Qiu J (2026) A graphical framework for global optimization of mixed-integer nonlinear programs. Journal of Global Optimization 1–38.
  20. [20]Davarnia D, Richard JPP, Tawarmalani M (2017) Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. SIAM Journal on Optimization 27(3):1801–1833.DOI
  21. [21]Davarnia D, Van Hoeve WJ (2021) Outer approximation for integer nonlinear programs via decision diagrams. Mathematical Programming 187(1):111–150.DOI
  22. [22]Del Pia A, Khajavirad A (2017) A polyhedral study of binary polynomial programs. Mathematics of Operations Research 42(2):389–410.DOI
  23. [23]Del Pia A, Khajavirad A (2018) The multilinear polytope for acyclic hypergraphs. SIAM Journal on Optimization 28(2):1049–1076.DOI
  24. [24]Dunning I, Huchette J, Lubin M (2017) Jump: A modeling language for mathematical optimization. SIAM review 59(2):295–320.
  25. [25]Freund RM, Orlin JB (1985) On the complexity of four polyhedral set containment problems. Mathematical programming 33(2):139–145.DOI
  26. [26]Gillard X, Coppé V, Schaus P, Cire AA (2021) Improving the filtering of branch-and-bound mdd solver. International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 231–247 (Springer).DOI
  27. [27]Göß A, Martin A, Pokutta S, Sharma K (2026) Norm-induced cuts: outer approximation for lipschitzian constraint functions. Journal of Global Optimization 94(1):35–63.arxiv.org/abs/2403.11546
  28. [28]Gu X, Dey SS, Richard JPP (2023) Lifting convex inequalities for bipartite bilinear programs. Mathematical Programming 197:587–619.
  29. [29]Kannan R, Nagarajan H, Deka D (2026) Strong partitioning and a machine learning approximation for accelerating the global optimization of nonconvex quadratically constrained quadratic programs. INFORMS Journal on Computing 38(5):1323–1343.DOI
  30. [30]Karp RM (1972) Reducibility among combinatorial problems. Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department, 85–103 (Springer).
  31. [31]Kataru RSN, Davarnia D, Jannesari A (2026) A lock-free work-stealing algorithm for bulk operations. Proceedings of the 35th International Symposium on High-Performance Parallel and Distributed Computing, 628–635, HPDC ’26 (New York, NY, USA: Association for Computing Machinery), ISBN 9798400726408, URL http://dx.doi.org/10.1145/3806645.3816121.
  32. [32]Khademnia E, Davarnia D (2025) Convexification of bilinear terms over network polytopes. Mathematics of Operations Research 50(2):1019–1041.
  33. [33]Kowalczyk D, Leus R, Hojny C, Røpke S (2024) A flow-based formulation for parallel machine scheduling using decision diagrams. INFORMS Journal on Computing 36(6):1696–1714.arxiv.org/abs/2210.02434
  34. [34]Kronqvist J, Neira DEB, Grossmann IE (2026) 50 years of mixed-integer nonlinear and disjunctive programming. European Journal of Operational Research 331(3):687–705.DOI
  35. [35]Lovász L (1989) Geometry of numbers and integer programming. Iri M, Tanabe K, eds., Mathematical Programming: Recent Developments and Applications, 177–210 (Dordrecht: Kluwer Academic Publishers).
  36. [36]MINLPLib (2026) MINLPLib: A library of mixed-integer and continuous nonlinear programming instances. https://www.minlplib.org/, accessed October 28, 2026.
  37. [37]Muñoz G, Paat J, Serrano F (2025) A characterization of maximal homogeneous-quadratic-free sets: G. muñoz et al. Mathematical Programming 210(1):641–668.
  38. [38]Muñoz G, Serrano F (2022) Maximal quadratic-free sets. Mathematical Programming 192(1):229–270.
  39. [39]Muñoz G, Paat J, Serrano F (2026) A characterization of maximal inhomogeneous-quadratic-free sets. URL https://arxiv.org/abs/2605.30602.
  40. [40]Salemi H, Davarnia D (2023) On the structure of decision diagram–representable mixed-integer programs with application to unit commitment. Operations Research 71(6):1943–1959.DOI
  41. [41]Salemi H, Davarnia D (2023) Solving unsplittable network flow problems with decision diagrams. Transportation Science 57(4):937–953.
  42. [42]Schmidt M, Sirvent M, Wollner W (2022) The cost of not knowing enough: mixed-integer optimization with implicit lipschitz nonlinearities. Optimization Letters 16(5):1355–1372.DOI
  43. [43]Schneider R (2014) Convex bodies : the Brunn-Minkowski theory. Encyclopedia of mathematics and its applications ; volume 151 (Cambridge: Cambridge University Press), second edition. edition, ISBN 1-107-45500-6.
  44. [44]Serra T, Hooker JN (2020) Compact representation of near-optimal integer programming solutions. Mathematical Programming 182(1):199–232.DOI
  45. [45]Serrano F (2019) Intersection cuts for factorable minlp. International Conference on Integer Programming and Combinatorial Optimization, 385–398 (Springer).arxiv.org/abs/1812.03073
  46. [46]Srinivasan A, Ham T, Malik S, Brayton RK (1990) Algorithms for discrete function manipulation. 1990 IEEE international conference on computer-aided design, 92–95 (IEEE Computer Society).
  47. [47]Strehl K, Thiele L (1998) Symbolic model checking of process networks using interval diagram techniques. Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, 686–692.
  48. [48]Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Mathematical programming 103(2):225–249.DOI
  49. [49]Tjandraatmadja C, van Hoeve WJ (2019) Target cuts from relaxed decision diagrams. INFORMS Journal on Computing 31(2):285–301.DOI
  50. [50]van Hoeve WJ (2024) An introduction to decision diagrams for optimization. Tutorials in Operations Research: Smarter Decisions for a Better World, 117–145 (INFORMS).DOI
  51. [51]Xu L, D’ambrosio C, Liberti L, Haddad-Vanier S (2025) Cutting planes for signomial programming. SIAM Journal on Optimization 35(2):899–926.arxiv.org/abs/2212.02857

Paper details

vlnc:W_adw9ee4r
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents