Publicaciones en colaboración con investigadores/as de University of Bologna (14)

2020

  1. Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier

    Omega (United Kingdom), Vol. 91

2017

  1. Optimal solutions to a real-world integrated airline scheduling problem

    Transportation Science, Vol. 51, Núm. 1, pp. 250-268

2013

  1. A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem

    Electronic Notes in Discrete Mathematics, Vol. 41, pp. 391-398

2011

  1. Decorous lower bounds for minimum linear arrangement

    INFORMS Journal on Computing, Vol. 23, Núm. 1, pp. 26-40

2010

  1. Lower bounds for the minimum linear arrangement of a graph

    Electronic Notes in Discrete Mathematics, Vol. 36, Núm. C, pp. 843-849

2008

  1. A New Lower Bound for the Minimum Linear Arrangement of a Graph

    Electronic Notes in Discrete Mathematics, Vol. 30, Núm. C, pp. 87-92

2007

  1. An exact approach for the vehicle routing problem with two-dimensional loading constraints

    Transportation Science, Vol. 41, Núm. 2, pp. 253-264

  2. The capacitated m-ring-star problem

    Operations Research, Vol. 55, Núm. 6, pp. 1147-1162

2005

  1. Laying out sparse graphs with provably minimum bandwidth

    INFORMS Journal on Computing, Vol. 17, Núm. 3, pp. 356-373

1999

  1. Separating lifted odd-hole inequalities to solve the index selection problem

    Discrete Applied Mathematics, Vol. 92, Núm. 2-3, pp. 111-134

1998

  1. Solving the Orienteering Problem through branch-and-cut

    INFORMS Journal on Computing, Vol. 10, Núm. 2, pp. 133-148

1997

  1. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem

    Operations Research, Vol. 45, Núm. 3, pp. 378-394

1995

  1. Some thoughts on combinatorial optimisation

    European Journal of Operational Research, Vol. 83, Núm. 2, pp. 253-270

  2. The symmetric generalized traveling salesman polytope

    Networks, Vol. 26, Núm. 2, pp. 113-123