Universidad Miguel Hernández de Elche-ko ikertzaileekin lankidetzan egindako argitalpenak (33)

2024

  1. A Huff-like location model with quality adjustment and/or closing of existing facilities

    European Journal of Operational Research, Vol. 313, Núm. 3, pp. 937-953

2022

  1. An automated process for supporting decisions in clustering-based data analysis

    Computer Methods and Programs in Biomedicine, Vol. 219

2020

  1. A Continuous Competitive Facility Location and Design Problem for Firm Expansion

    Advances in Intelligent Systems and Computing

  2. Allocating costs in set covering problems

    European Journal of Operational Research, Vol. 284, Núm. 3, pp. 1074-1087

  3. An Automated Process for the Repository-Based Analysis of Ontology Structural Metrics

    IEEE Access, Vol. 8, pp. 148722-148743

  4. Evaluation of ontology structural metrics based on public repository data

    Briefings in Bioinformatics, Vol. 21, Núm. 2, pp. 473-485

2019

  1. Locating switches

    Expert Systems with Applications, Vol. 136, pp. 338-352

2017

  1. Decomposition methods based on articulation vertices for degree-dependent spanning tree problems

    Computational Optimization and Applications, Vol. 68, Núm. 3, pp. 749-773

2014

  1. A new rule for source connection problems

    European Journal of Operational Research, Vol. 234, Núm. 3, pp. 780-788

  2. Looking for edge-equitable spanning trees

    Computers and Operations Research, Vol. 41, Núm. 1, pp. 44-52

2013

  1. A new rule for source connection problems

    XXXIV Congreso Nacional de Estadística e Investigación Operativa, VIII Jornadas de Estadística Pública: SEIO 2013. Universitat Jaume I, Castellón, septiembre 2013. Libro de actas

  2. How to divide a cake when people have different metabolism?

    Mathematical Methods of Operations Research, Vol. 78, Núm. 3, pp. 361-371

2012

  1. A cost allocation rule for k-hop minimum cost spanning tree problems

    Operations Research Letters, Vol. 40, Núm. 1, pp. 52-55

  2. A new rule for source connection problems

    Working paper series ( RGEA )

  3. New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

    European Journal of Operational Research, Vol. 220, Núm. 1, pp. 48-57

  4. Ranking auctions: A cooperative approach

    International Game Theory Review, Vol. 14, Núm. 1

2009

  1. A branch-and-cut algorithm for the Winner Determination Problem

    Decision Support Systems, Vol. 46, Núm. 3, pp. 649-659

  2. Aging properties of a discrete-time failure and repair model

    IEEE Transactions on Reliability, Vol. 58, Núm. 1, pp. 161-171

  3. New facets for the two-stage uncapacitated facility location polytope

    Computational Optimization and Applications, Vol. 44, Núm. 3, pp. 487-519

  4. On the core, the Weber set and convexity in games with a priori unions

    European Journal of Operational Research, Vol. 193, Núm. 2, pp. 468-475