Pages that link to "Item:Q816066"

The following pages link to Interval analysis on directed acyclic graphs for global optimization (Q816066):

Displaying 33 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Rigorous filtering using linear relaxations (Q453629) (← links)
• Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• Reverse propagation of McCormick relaxations (Q496587) (← links)
• DrAmpl: A meta solver for optimization problem analysis (Q601972) (← links)
• Constraint propagation on quadratic constraints (Q606897) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
• Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
• Interval propagation and search on directed acyclic graphs for numerical constraint solving (Q1041436) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
• Exclusion regions for parameter-dependent systems of equations (Q2052383) (← links)
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
• The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
• SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Exclusion regions for optimization problems (Q2250096) (← links)
• First order rejection tests for multiple-objective optimization (Q2250111) (← links)
• A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
• Rigorous packing of unit squares into a circle (Q2416578) (← links)
• Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems (Q2423791) (← links)
• Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
• Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
• Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) (← links)
• Symmetry in Mathematical Programming (Q2897300) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)