-
Notifications
You must be signed in to change notification settings - Fork 0
This program is an C++ librairy who implements the heuristic described in "Solving large-scale profit maximization capacitated lot-size problems by heuristic methods" by K.K. Haugen, A. Olstad and B.I. Pettersen.
Guyome/CLSP--
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
This program is an C++/Python librairy who implements the heuristic described in "Solving large-scale profit maximization capacitated lot-size problems by heuristic methods" by K.K. Haugen, A. Olstad and B.I. Pettersen. Author: Guillaume Lanquepin <guillaume.lanquepin@himolde.no> Licence: BSD Dependencies: Blitz++ ( see http://www.oonumerics.org/blitz/ ) Boost.Python ( see http://www.boost.org/doc/libs/ 1_39_0/libs/python/doc/index.html) Python C API Blueprints: * test it * Java interface
About
This program is an C++ librairy who implements the heuristic described in "Solving large-scale profit maximization capacitated lot-size problems by heuristic methods" by K.K. Haugen, A. Olstad and B.I. Pettersen.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published