Urmăriți
Daniel Blado
Daniel Blado
Data Scientist, Ford Motor Company
Adresă de e-mail confirmată pe ford.com
Titlu
Citat de
Citat de
Anul
On weak chromatic polynomials of mixed graphs
M Beck, D Blado, J Crawford, T Jean-Louis, M Young
Graphs and Combinatorics 31, 91-98, 2015
272015
Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
D Blado, A Toriello
SIAM Journal on Optimization 29 (1), 1-30, 2019
172019
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
172016
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
72021
An Exact Algorithm for the Dynamic Knapsack Problem with Stochastic Item Sizes
D Blado, A Toriello
2018
Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes.
D Blado
Georgia Institute of Technology, Atlanta, GA, USA, 2018
2018
On Weak Chromatic Polynomials of Mixed Graphs
D Blado, J Crawford, T Jean-Louis
2012
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–7