Pages that link to "Item:Q1924068"

The following pages link to A branch-and-reduce approach to global optimization (Q1924068):

Displaying 50 items.

• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
• Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
• Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282) (← links)
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Global dynamic optimization using edge-concave underestimator (Q2182856) (← links)
• Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Multivariate McCormick relaxations (Q2250101) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
• Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
• Bound reduction using pairs of linear inequalities (Q2392123) (← links)
• Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
• Global optimization of bounded factorable functions with discontinuities (Q2442640) (← links)
• Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
• Global optimization in stabilizing controller design (Q2465481) (← links)
• Global solution approach for a nonconvex MINLP problem in product portfolio optimization (Q2494289) (← links)
• Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
• Global optimization of linear hybrid systems with explicit transitions (Q2503594) (← links)
• Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk (Q2514882) (← links)
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
• Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← links)
• Reachability Analysis and Deterministic Global Optimization of DAE Models (Q2795640) (← links)
• Alternative branching rules for some nonconvex problems (Q2943824) (← links)
• Convex and concave relaxations of implicit functions (Q2943829) (← links)
• (Q4261216) (← links)
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
• Duality for linear multiplicative programs (Q4673140) (← links)
• On the Performance of NLP Solvers Within Global MINLP Solvers (Q4685828) (← links)
• (Q4945105) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
• Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
• On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• Quasiconvex relaxations based on interval arithmetic (Q5929744) (← links)
• Preface (Q5970730) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization (Q6074062) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)