https://doi.org/10.2307/2581283 • https://www.jstor.org/stable/2581283 Copy URL A preference order dynamic programming model proposed in the literature for solving ...
A branch-and-cut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem involves a special class of knapsack equality ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback