Pages that link to "Item:Q816066"

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

Displaying 16 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)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)