Instituto de Investigación en Inteligencia Artificial -ko ikertzaileekin lankidetzan egindako argitalpenak (8)

2018

  1. The weighted independent domination problem: Integer linear programming models and metaheuristic approaches

    European Journal of Operational Research, Vol. 265, Núm. 3, pp. 860-871

2017

  1. A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem

    2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

  2. Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when?

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Large neighborhood search for the most strings with few bad columns problem

    Soft Computing, Vol. 21, Núm. 17, pp. 4901-4915

  4. Mining k-reachable sets in real-world networks using domination in shortcut graphs

    Journal of Computational Science, Vol. 22, pp. 1-14

  5. On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm

    2017 6th International Conference on Systems and Control, ICSC 2017

  6. The weighted independent domination problem: ILP model and algorithmic approaches

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2006

  1. Programming and languages J.UCS special issue with extended versions of selected papers from PROLE 2005: The fifth Spanish conference on programming and languages

    Journal of Universal Computer Science