Hexaly

×

Products
- Resources
Solutions
- - Professional Services
  - Contact us
Customers
Developers
Blog
Company

Login Contact us

Contact us Login

Hexaly

Installation & licensing
Quick start guide
Modeling features
Technical features
Guidelines
Example tour
Hexaly Modeler (LSP)
Python API Reference
- Hexaly Optimizer
- Hexaly Modeler
C++ API Reference
- Hexaly Optimizer
- Hexaly Modeler
C# API Reference
- Hexaly Optimizer
- Hexaly Modeler
Java API Reference
Changelog
- Hexaly Optimizer 12.5
  - Modeling operators
    - Intersection
    - Distinct
    - Sort
    - Array
    - Nary operators
  - API Changes
    - Python
    - C++
    - C#
    - Java
  - API requirement changes
    - Python
    - C#
  - Platform dependencies changes
    - Linux
- LocalSolver 12.0
  - New modeling operators
    - Interval
    - Start
    - End
    - Length
  - API Changes
    - Python
    - C++
    - C#
    - Java
- LocalSolver 11.5
  - CSV Module
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 11.0
- LocalSolver 10.5
  - LocalSolver cloud
  - New modeling operators
    - Cover
    - Find
  - API Changes
    - Python
    - C++
    - C#
    - Java
- LocalSolver 10.0
  - Modeler API
  - JSON Module
  - Black-box optimization
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 9.5
  - External Functions
  - Black-box optimization
  - Lambda Functions
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 9.0
- LocalSolver 8.5
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 8.0
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 7.5
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 7.0
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java
- LocalSolver 6.5
- LocalSolver 6.0
  - API Changes
    - LSP
    - Python
    - C++
    - C#
    - Java

Hexaly

Docs »
Changelog »
LocalSolver 6.5

LocalSolver 6.5¶

Release notes

For models involving list variables, new moves have been introduced to better manage constraints based on count, indexOf or partition expressions. These moves are particularly effective on routing and scheduling problems.
For near-linear (discrete or continuous) problems, new moves have been introduced based on linear programming and mixed-integer linear programming techniques. These moves allow to intensify the search on near-linear models by exploring optimally larger neighborhoods.

Next Previous

Our site uses cookies. They are stored and active only if you give your consent. For more information, see our privacy policy.
Allowed cookies: Required Social networks Audience measurement

Accept all

Reject all

Useful links
Quick links
- Home
- Hexaly Optimizer
- Benchmarks
- Customers
- Team
Resources
- Download
- Doc center