Følg
Daniel Neira
Titel
Citeret af
Citeret af
År
New compact integer programming formulations for the multi-trip vehicle routing problem with time windows
DA Neira, MM Aguayo, R De la Fuente, MA Klapp
Computers & Industrial Engineering 144, 106399, 2020
512020
Improving the state-of-the-art in the traveling salesman problem: An anytime automatic algorithm selection
II Huerta, DA Neira, DA Ortega, V Varas, J Godoy, R Asin-Acha
Expert Systems with Applications 187, 115948, 2022
362022
Anytime automatic algorithm selection for knapsack
II Huerta, DA Neira, DA Ortega, V Varas, J Godoy, R Asín-Achá
Expert Systems with Applications 158, 113613, 2020
192020
Lot streaming for a two-stage assembly system in the presence of handling costs
NJ Mukherjee, SC Sarin, DA Neira
Journal of Scheduling 26 (4), 335-351, 2023
42023
Tourist Design Problem with Synchronization Constraints
MM Aguayo, R Medina Durán, DA Neira
Available at SSRN 4063502, 0
Machine learning for Knapsack, an any-time behavior approach.
I Huerta, D Neira, V Varas
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–6