Articole cu mandate pentru acces public - Daniel BladoAflați mai multe
Disponibile undeva: 4
Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
D Blado, A Toriello
SIAM Journal on Optimization 29 (1), 1-30, 2019
Mandate: US National Science Foundation
Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
D Blado, W Hu, A Toriello
SIAM Journal on Optimization 26 (3), 1625-1648, 2016
Mandate: US National Science Foundation
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
D Blado, A Toriello
Mathematical Programming Computation 13, 185-223, 2021
Mandate: US National Science Foundation
An Exact Algorithm for the Dynamic Knapsack Problem with Stochastic Item Sizes
D Blado, A Toriello
Mandate: US National Science Foundation
Informațiile despre publicații și finanțare sunt alese automat de un program informatic