A SMS++ :Block for the Multiple Knapsack Assignment Problem.
These instructions will let you build MultiKnapsackAssignBlock on your system.
- The SMS++ core library and its requirements.
- BinaryKnapsackBlock.
TODO: still to be implemented
Carefully hand-crafted makefiles have also been developed for those unwilling to use CMake. General instructions are:
-
The arrangements of folders must be that envisioned by the Umbrella SMS++ Project
-
The main step is to edit the makefiles into ../extlib/. There is one for each of the external libraries that any module requires, starting with
= Boost
= Eigen
that are required by the "core" SMS++ library and therefore by everyone. Setting the
lib*INC = -I<paths to include files directories>
lib*LIB = -L<paths to lib files directories> -l<libs>in each allows one to set any non-standard path if the library is not installed in the system (or leave them empty if they are).
- The "core" SMS++ classes have a makefile for building the corresponding library in
SMS++/lib/makefile-libThe makefile allow to choose the compiler name and the optimization/debug. This builds the lib/libSMS++.a that can be linked upon. Also, the
SMS++/lib/makefile-incfile is provided for allowing external makefiles to ensure that the library is up-to-date (useful in case one is actually developing it).
Note that the "basic" makefile macros
CC =
SW =for setting the c++ compiler and its options are "automatically forwarded" from the makefile to these of the other SMS++ components, and therefore (possibly at the cost of a make clean) ensure consistency during the building process.
If you need support, you want to submit bugs or propose a new feature, you can open a new issue.
Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting merge requests to us.
-
Federica Di Pasquale
Dipartimento di Informatica
Università di Pisa -
Antonio Frangioni
Operations Research Group
Dipartimento di Informatica
Università di Pisa
This code is provided free of charge under the GNU Lesser General Public License version 3.0 - see the LICENSE file for details.
The code is currently provided free of charge under an open-source license. As such, it is provided "as is", without any explicit or implicit warranty that it will properly behave or it will suit your needs. The Authors of the code cannot be considered liable, either directly or indirectly, for any damage or loss that anybody could suffer for having used it. More details about the non-warranty attached to this code are available in the license description file.