41
TÍTULO: A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option
AUTORES: Attila, ON; Agra, A; Akartunali, K; Arulselvan, A;
PUBLICAÇÃO: 2017, FONTE: 17th International Conference on Computational Science and its Applications (ICCSA) in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2017, PT II, VOLUME: 10405
INDEXADO EM: Scopus WOS CrossRef
NO MEU: ORCID
42
TÍTULO: Combined ship routing and inventory management in the salmon farming industry  Full Text
AUTORES: Agra, A; Christiansen, M; Ivarsøy, KS; Solhaug, IE; Tomasgard, A;
PUBLICAÇÃO: 2016, FONTE: Annals of Operations Research
INDEXADO EM: Scopus CrossRef: 4
NO MEU: ORCID
43
TÍTULO: Lifted Euclidean inequalities for the integer single node flow set with upper bounds  Full Text
AUTORES: Agostinho Agra; Miguel Fragoso Constantino;
PUBLICAÇÃO: 2016, FONTE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 251, NÚMERO: 1
INDEXADO EM: Scopus WOS CrossRef
NO MEU: ORCID
44
TÍTULO: Implicit cover inequalities  Full Text
AUTORES: Agra, A; Requejo, C; Santos, E;
PUBLICAÇÃO: 2016, FONTE: JOURNAL OF COMBINATORIAL OPTIMIZATION, VOLUME: 31, NÚMERO: 3
INDEXADO EM: Scopus WOS
NO MEU: ORCID
45
TÍTULO: Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph  Full Text
AUTORES: Agostinho Agra; Mandi Doostmohammadi; Cid C de Souza;
PUBLICAÇÃO: 2016, FONTE: DISCRETE OPTIMIZATION, VOLUME: 21
INDEXADO EM: Scopus WOS CrossRef: 1
NO MEU: ORCID
46
TÍTULO: A MIP based local search heuristic for a stochastic maritime inventory routing problem
AUTORES: Agra, A; Christiansen, M; Hvattum, LM; Rodrigues, F;
PUBLICAÇÃO: 2016, FONTE: 7th International Conference on Computational Logistics, ICCL 2016 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 9855
INDEXADO EM: Scopus CrossRef: 2
NO MEU: ORCID
47
TÍTULO: A DYNAMIC PROGRAMMING APPROACH FOR A CLASS OF ROBUST OPTIMIZATION PROBLEMS  Full Text
AUTORES: Agostinho Agra; Marcio Costa Santos; Dritan Nace; Michael Poss;
PUBLICAÇÃO: 2016, FONTE: SIAM JOURNAL ON OPTIMIZATION, VOLUME: 26, NÚMERO: 3
INDEXADO EM: Scopus WOS CrossRef: 5
NO MEU: ORCID
48
TÍTULO: A branch-and-cut algorithm for a multi-item inventory distribution problem
AUTORES: Agra, A; Cerveira, A ; Requejo, C;
PUBLICAÇÃO: 2016, FONTE: 2nd International Workshop on Machine Learning, Optimization and Big Data, MOD 2016 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 10122 LNCS
INDEXADO EM: Scopus CrossRef: 3
NO MEU: ORCID
49
TÍTULO: Lagrangian relaxation bounds for a production-inventory-routing problem
AUTORES: Agra, A; Cerveira, A ; Requejo, C;
PUBLICAÇÃO: 2016, FONTE: 2nd International Workshop on Machine Learning, Optimization and Big Data, MOD 2016 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 10122 LNCS
INDEXADO EM: Scopus CrossRef: 3
NO MEU: ORCID
50
TÍTULO: The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment  Full Text
AUTORES: Agostinho Agra; Amaro de Sousa; Mahdi Doostmohammadi;
PUBLICAÇÃO: 2016, FONTE: IEEE-ACM TRANSACTIONS ON NETWORKING, VOLUME: 24, NÚMERO: 6
INDEXADO EM: Scopus WOS CrossRef: 2
NO MEU: ORCID
Página 5 de 6. Total de resultados: 58.