USER'S GUIDE

  • AIMMS Basics
  • Creating and Managing a Model
  • Data Management
  • AIMMS and Solvers
    • AIMMS IDE
    • Solvers
      • BARON
      • CBC
      • CONOPT
      • COPT
      • CP Optimizer
      • CPLEX
      • GUROBI
      • IPOPT
      • KNITRO
        • Knitro
        • Knitro to AIMMS Mapping
        • AIMMS to Knitro Mapping
        • Description of Knitro Algorithms
        • Complementarities
        • Tuner
        • Knitro Options
          • General
          • Advanced
          • Hessian
          • Interior Point
          • MIP
            • Integrality
            • Maximal Number of Nodes
            • Maximal Number of Subproblem Solves
            • MIP Algorithm
            • MIP Branching Rule
            • MIP GUB Branch
            • MIP Heuristic
            • MIP Heuristic Diving
            • MIP Heuristic Feasibility Pump
            • MIP Heuristic Iteration Limit
            • MIP Heuristic Large Neighborhood Search
            • MIP Heuristic Local Search
            • MIP Heuristic MPEC
            • MIP Heuristic Strategy
            • MIP Heuristic Terminate
            • MIP Implications
            • MIP Integer Variables Relaxable
            • MIP Integer Variables Strategy
            • MIP Method
            • MIP MISQP Heuristic
            • MIP Multistart
            • MIP Objective Cutoff Value
            • MIP Pseudo Cost Initialization
            • MIP Restart
            • MIP Rounding
            • MIP Start Algorithm
            • MIP Terminate
            • Node Algorithm
            • Node Selection
            • Node Selection_Direction
            • Strong Branching Candidates Limit
            • Strong Branching Iteration Limit
            • Strong Branching Level
          • MIP Cuts
          • Multistart
          • Parallel
          • Presolve
          • Reporting
          • Termination
          • Tolerances
          • Tuner
          • Debugging
      • MINOS
      • ODH-CPLEX
      • PATH
      • SNOPT
      • XA
  • Miscellaneous
User's Guide
AIMMS Logo
  • User's Guide »
  • AIMMS and Solvers »
  • Solvers »
  • KNITRO »
  • Knitro Options »
  • MIP »
  • MIP Heuristic Large Neighborhood Search
  • Edit on Github

MIP Heuristic Large Neighborhood Search

Type

Bit Selection

Range

{-1..3}

Default

-1

This option specifies whether or not to enable the MIP large neighborhood search heuristics. Possible values are:

  • -1 (auto): Let Knitro determine automatically from MIP Heuristic Strategy

  • 0 (disable): Disable all large neighborhood search heuristics

  • 1 (bit 0): Enable relaxation enforced neighborhood search (RENS) heuristic

  • 2 (bit 1): Enable relaxation induced neighborhood search (RINS) heuristic

Knitro considers the bit values of this parameter. For example, if this parameter is set to 3, bit 0 and bit 1 are equal to 1 and, as a result, both RENS and RINS heuristics are enabled. If this parameter is set to 2, only RINS heuristic is enabled.

Learn more about

  • MIP Heuristic

  • MIP Heuristic Strategy

Last updated: Aug 28, 2025

Help & Feedback

Docs

Edit this page to fix an error or add an improvement in a pull request
Create an issue to suggest an improvement to this page

Product

Create a topic if there's something you don't like about this feature
Propose functionality by submitting a feature request

Support

Not what you where looking for? Search the docs

Remember we also have Community support

Still having trouble ? Reach out to us


Next Previous

AIMMS
AIMMS COMMUNITY
AIMMS DOCS
DISCLAIMER
PRIVACY STATEMENT
© 1989 - 2025 AIMMS B.V.