Pages that link to "Item:Q3396388"
From MaRDI portal
The following pages link to Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388):
Displaying 50 items.
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Algorithms for generalized potential games with mixed-integer variables (Q1694402) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Ball-and-finger system: modeling and optimal trajectories (Q1722658) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- MINLP formulations for continuous piecewise linear function fitting (Q2028464) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Polynomial programming prevents aircraft (and other) conflicts (Q2060568) (← links)
- Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming (Q2068223) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons (Q2089891) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- Non-convex nested Benders decomposition (Q2097672) (← links)
- Empirical performance bounds for quantum approximate optimization (Q2099650) (← links)
- Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control (Q2114579) (← links)
