Skip to content
  • Home
  • Technology
    • Decision Engine
    • Documentation
  • Case studies
  • About
Menu
  • Home
  • Technology
    • Decision Engine
    • Documentation
  • Case studies
  • About
Contact Us
  • Home
  • Technology
    • Decision Engine
    • Documentation
  • Case studies
  • About
Menu
  • Home
  • Technology
    • Decision Engine
    • Documentation
  • Case studies
  • About

Math blog

⌘K
  • 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

Doc navigation

Octeract Neural →
Linkedin

Quick links

  • Home
  • Case studies
  • About
  • Contact us

Legal

  • Privacy policy
  • Terms and conditions
  • EULA

Contact us

  • 27 Old Gloucester St. London, WC1N 3AX
  • [email protected]
    [email protected]

© Octeract Limited 2017-2024. All rights reserved.

Envelope