Skip to content
  • Home
  • Octeract Engine
    • Overview
    • Results
    • Docs
  • Careers
  • About
Menu
  • Home
  • Octeract Engine
    • Overview
    • Results
    • Docs
  • Careers
  • About

Math blog

  • BQP Reformulations
  • Domain Reduction
    • Introduction
    • Optimality based bounds tightening (OBBT)
    • Feasibility based bounds tightening (FBBT)
    • Constraint propagation (CP)
  • Branching strategies
    • Introduction
    • Most Violated Term
    • Strong branching
    • Max Separation Distance
    • Hybrid integer least reduced axis
  • Primal heuristics
    • Nonlinear Feasibility Pump
    • Starting point strategies
  • Relaxations
    • Nonlinear Relaxation for Convex MINLPs
  1. Home
  2. Docs
  3. Math blog

Math blog

Articles

  • BQP Reformulations
  • Domain Reduction
    • Introduction
    • Optimality based bounds tightening (OBBT)
    • Feasibility based bounds tightening (FBBT)
    • Constraint propagation (CP)
  • Branching strategies
    • Introduction
    • Most Violated Term
    • Strong branching
    • Max Separation Distance
    • Hybrid integer least reduced axis
  • Primal heuristics
    • Nonlinear Feasibility Pump
    • Starting point strategies
  • Relaxations
    • Nonlinear Relaxation for Convex MINLPs
Still stuck? How can we help?
Updated on July 18, 2022

Doc navigation

← Tutorials
Was this article helpful to you? Yes No

How can we help?

High damage builds for the hardest nonlinear problems.

Linkedin Twitter Discord
Quick Links
  • Home
  • Octeract Engine
    • Overview
    • Results
    • Docs
  • Careers
  • About
  • Home
  • Octeract Engine
    • Overview
    • Results
    • Docs
  • Careers
  • About
Contact
[email protected]
[email protected]

Legal

Privacy Policy

Terms and conditions

EULA

© All Rights Reserved. Forever. Obviously.