Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Dev #7

Merged
merged 2 commits into from
Dec 7, 2024
Merged

Dev #7

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e095817
Add missing Threads::Threads dependency in CMakeLists.txt
fontanf Dec 7, 2024
3908b18
Fix dead links in README.md
fontanf Dec 7, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,10 +19,10 @@ And therefore, having efficient algorithms with reliable implementations to solv
The goal of this repository is to provide such efficient and reliable implementations.

Here are some usage examples of this library:
* [Lifting the length of a bin in a 3D packing problem](https://github.com/fontanf/packingsolver/blob/dev_2/packingsolver/boxstacks/branching_scheme.cpp#L67)
* [Solving a 0-1 knapsack subproblem inside an algorithm for a geometrical variable-sized bin packing problem](https://github.com/fontanf/packingsolver/blob/dev_2/packingsolver/algorithms/dichotomic_search.hpp#L135)
* Solving the pricing problem inside a column generation algorithm for the [cutting stock problem](https://github.com/fontanf/columngenerationsolver/blob/main/examples/multipleknapsack.hpp#L157), the [multiple knapsack problem](https://github.com/fontanf/columngenerationsolver/blob/main/examples/cuttingstock.hpp#L123), or the [genralized assignment problem](https://github.com/fontanf/generalizedassignmentsolver/blob/master/generalizedassignmentsolver/algorithms/column_generation.cpp#L181)
* [Solving a 0-1 knapsack subproblem inside an algorithm for the packing while travelling problem](https://github.com/fontanf/travellingthiefsolver/blob/master/travellingthiefsolver/packingwhiletravelling/algorithms/sequential_value_correction.cpp#L19)
* [Lifting the length of a bin in a 3D packing problem](https://github.com/fontanf/packingsolver/blob/2cddb90686fb4a0e92f4ee1b4335ceaa2048d2f4/src/boxstacks/branching_scheme.cpp#L272)
* [Solving a 0-1 knapsack subproblem inside an algorithm for a geometrical variable-sized bin packing problem](https://github.com/fontanf/packingsolver/blob/2cddb90686fb4a0e92f4ee1b4335ceaa2048d2f4/src/algorithms/dichotomic_search.hpp#L149)
* Solving the pricing problem inside a column generation algorithm for the [cutting stock problem](https://github.com/fontanf/columngenerationsolver/blob/096802d9e20d2826aed5b44e3b68ac9df6b20da2/include/columngenerationsolver/examples/cutting_stock.hpp#L123), the [multiple knapsack problem](https://github.com/fontanf/columngenerationsolver/blob/096802d9e20d2826aed5b44e3b68ac9df6b20da2/include/columngenerationsolver/examples/multiple_knapsack.hpp#L154), or the [genralized assignment problem](https://github.com/fontanf/generalizedassignmentsolver/blob/68be0ab77efd897fd583f1031dd6cbc946b33f5a/src/algorithms/column_generation.cpp#L177)
* [Solving a 0-1 knapsack subproblem inside an algorithm for the packing while travelling problem](https://github.com/fontanf/travellingthiefsolver/blob/ce1b6805e8aee8ee3300fbbc97dbc9153eecff01/src/packing_while_travelling/algorithms/sequential_value_correction.cpp#L19)

## Implemented algorithms

Expand Down
4 changes: 3 additions & 1 deletion src/knapsack/algorithms/CMakeLists.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,7 @@ target_link_libraries(KnapsackSolver_knapsack_greedy PUBLIC
KnapsackSolver_knapsack)
add_library(KnapsackSolver::knapsack::greedy ALIAS KnapsackSolver_knapsack_greedy)

find_package(Threads)
add_library(KnapsackSolver_knapsack_dynamic_programming_bellman)
target_sources(KnapsackSolver_knapsack_dynamic_programming_bellman PRIVATE
dynamic_programming_bellman.cpp)
Expand All @@ -24,7 +25,8 @@ target_include_directories(KnapsackSolver_knapsack_dynamic_programming_bellman P
target_link_libraries(KnapsackSolver_knapsack_dynamic_programming_bellman PUBLIC
KnapsackSolver_knapsack
KnapsackSolver_knapsack_upper_bound_dantzig
KnapsackSolver_knapsack_greedy)
KnapsackSolver_knapsack_greedy
Threads::Threads)
add_library(KnapsackSolver::knapsack::dynamic_programming_bellman ALIAS KnapsackSolver_knapsack_dynamic_programming_bellman)

add_library(KnapsackSolver_knapsack_dynamic_programming_primal_dual)
Expand Down
Loading