University of Vienna-ko ikertzaileekin lankidetzan egindako argitalpenak (11)

2021

  1. A branch-and-price algorithm for the vehicle routing problem with stochastic demands and probabilistic duration constraints

    Transportation Science, Vol. 55, Núm. 1, pp. 122-138

  2. The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach

    European Journal of Operational Research, Vol. 289, Núm. 2, pp. 470-484

2018

  1. The connected facility location polytope

    Discrete Applied Mathematics, Vol. 234, pp. 151-167

2017

  1. An algorithmic framework for the exact solution of tree-star problems

    European Journal of Operational Research, Vol. 261, Núm. 1, pp. 54-66

2016

  1. Preface

    Annals of Operations Research

2014

  1. A MIP-based approach to solve the prize-collecting local access network design problem

    European Journal of Operational Research, Vol. 235, Núm. 3, pp. 727-739

  2. On the asymmetric connected facility location polytope

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

  3. Pickup-and-Delivery Problems for People Transportation

    VEHICLE ROUTING: PROBLEMS, METHODS, AND APPLICATIONS, 2ND EDITION (SIAM), pp. 193-212

2012

  1. Exact approaches to the single-source network loading problem

    Networks, Vol. 59, Núm. 1, pp. 89-106

2011

  1. A heuristic algorithm for a prize-collecting local access network design problem

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

2010

  1. Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

    Computers and Operations Research, Vol. 37, Núm. 3, pp. 559-574