Discrete optimization deals with maximizing or minimizing an objective function by choosing values from within an allowed feasible set of possible values. The set of possible values for each variable is discrete, and often finite. Use this tag for questions about discrete optimization problems, or about algorithms for solving them.
Questions tagged [discrete-optimization]
32 questions
0
votes
0 answers
Improvisations in the 0/1 Knapsack Problem
I am implementing the 0/1 Knapsack problem using Dynamic Programming. However, when the number of items or the sack capacity is too large, my algorithm fails to complete, giving rise to an exception. It is a simple DP algorithm which creates a…
Divyayan Dey
- 1
- 3
0
votes
1 answer
Looks for a Constraint Satisfaction Algorithm in R
I have what I believe is a fairly simple constraint satisfaction problem but can not find the proper package for implementing an algorithm.
I wish to subset a data set of some points. Each point comes with list of other data points it must excluded…
Henry Holm
- 495
- 3
- 13