- -

Listar por palabra clave "Combinatorial optimization problems"

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Listar por palabra clave "Combinatorial optimization problems"

Ordenar por:Orden:Resultados:

  • thumb
    A new genetic algorithm for the asymmetric traveling salesman problem 
    Yuichi Nagata; Soler Fernández, David (Elsevier, 2012-08)
    The asymmetric traveling salesman problem (ATSP) is one of the most important combinatorial optimization problems. It allows us to solve, either directly or through a transformation, many real-world problems. We present ...
  • thumb
    Greedy and K-Greedy algoritmhs for multidimensional data association 
    Perea Rojas Marcos, Federico; de Waard, Huub. W. (Institute of Electrical and Electronics Engineers (IEEE), 2011-07)
    [EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ ...