Publicaciones (74) Publicaciones en las que ha participado algún/a investigador/a

2010

  1. A branch-and-cut algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO loading

    Networks, Vol. 55, Núm. 1, pp. 46-59

  2. A code based on the two-stage runge-kutta gauss formula for second-order initial value problems

    ACM Transactions on Mathematical Software, Vol. 37, Núm. 3

  3. A local branching heuristic for the capacitated fixed-charge network design problem

    Computers and Operations Research, Vol. 37, Núm. 3, pp. 575-581

  4. A new heuristic to solve the one-warehouse N-retailer problem

    Computers and Operations Research, Vol. 37, Núm. 2, pp. 265-272

  5. A new strategy for the undirected two-commodity maximum flow problem

    Computational Optimization and Applications, Vol. 47, Núm. 2, pp. 289-305

  6. A unified framework for mechanics: Hamilton-Jacobi equation and applications

    Nonlinearity, Vol. 23, Núm. 8, pp. 1887-1918

  7. An algebraic view to gradient descent decoding

    2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

  8. An efficient family of strongly A-stable Runge-Kutta collocation methods for stiff systems and DAEs. Part I: Stability and order results

    Journal of Computational and Applied Mathematics, Vol. 234, Núm. 4, pp. 1105-1116

  9. An exact procedure and LP formulations for the leader—follower location problem

    Top, Vol. 18, Núm. 1, pp. 97-121

  10. Bayesian estimation and prediction based on Rayleigh sample quantiles

    Quality and Quantity, Vol. 44, Núm. 6, pp. 1239-1248

  11. Branch-and-cut versus cut-and-branch algorithms for cell suppression

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

  12. Characterization of jacobian newton polygons of plane branches and new criteria of irreducibility

    Annales de l'Institut Fourier, Vol. 60, Núm. 2, pp. 683-709

  13. Comments on: Routing problems with loading constraints 4

    Top, Vol. 18, Núm. 1, pp. 36-38

  14. Complete intersection in simplicial toric varieties

    EACA 2010: XII Encuentro de Álgebra Computacional y Aplicaciones = 12th Meeting on Computer Algebra and Applications : Libro de resúmenes = Book of abstracts : Santiago de Compostela, 19-21 de julio de 2010

  15. Complexity of cyclic scheduling problems: A state-of-the-art survey

    Computers and Industrial Engineering

  16. Compositional frequent hypercyclicity on weighted Dirichlet spaces

    Bulletin of the Belgian Mathematical Society - Simon Stevin, Vol. 17, Núm. 1, pp. 1-11

  17. Computation of Gauss-type quadrature formulas with some preassigned nodes

    Jaen journal on approximation, Vol. 2, Núm. 2, pp. 163-191

  18. Curvature of almost quaternion-Hermitian manifolds

    Forum Mathematicum, Vol. 22, Núm. 1, pp. 21-52

  19. Descodificación por gradiente como reducción

    EACA 2010: XII Encuentro de Álgebra Computacional y Aplicaciones = 12th Meeting on Computer Algebra and Applications : Libro de resúmenes = Book of abstracts : Santiago de Compostela, 19-21 de julio de 2010

  20. Determining the Pareto set in a bicriteria two-echelon inventory/distribution system

    Optimization, Vol. 59, Núm. 2, pp. 253-271