LERA-ROMERO, GONZALO; MIRANDA BRONT, JUAN JOSÉ; SOULIGNAC, FRANCISCO J.

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; Lugar: Amsterdam; Año: 2023 vol. - p. 1 - 18

LERA-ROMERO, GONZALO; MIRANDA BRONT, JUAN JOSÉ; SOULIGNAC, FRANCISCO J.

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows

INFORMS; Año: 2022 vol. 34 p. 3292 - 3308

LERA-ROMERO, GONZALO; MIRANDA BRONT, JUAN J.; SOULIGNAC, FRANCISCO J.

Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows

NETWORKS; Año: 2020 vol. 76 p. 24 - 53

LERA-ROMERO, GONZALO; MIRANDA-BRONT, JUAN JOSÉ

A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; Año: 2019

LERA-ROMERO, GONZALO; MIRANDA-BRONT, JUAN JOSÉ

Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints

Electronic Notes in Discrete Mathematics; Año: 2018 vol. 69 p. 53 - 60

MONTERO, AGUSTÍN; JOSÉ MIRANDA-BRONT, JUAN; MÉNDEZ-DÍAZ, ISABEL

An ILP-based local search procedure for the VRP with pickups and deliveries

ANNALS OF OPERATIONS RESEARCH; Año: 2017 vol. 259 p. 327 - 350

MONTERO, AGUSTÍN; MÉNDEZ-DÍAZ, ISABEL; MIRANDA-BRONT, JUAN JOSÉ

An integer programming approach for the time-dependent traveling salesman problem with time windows

COMPUTERS & OPERATIONS RESEARCH; Año: 2017 vol. 88 p. 280 - 289

MIROSLAV KULICH; JUAN JOSÉ MIRANDA BRONT; LIBOR PREUCIL

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment

COMPUTERS & OPERATIONS RESEARCH; Año: 2016

ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA; JUAN JOSÉ MIRANDA BRONT

An ILP based heuristic for a generalization of the post-enrollment course timetabling problem

COMPUTERS & OPERATIONS RESEARCH; Lugar: Amsterdam; Año: 2016

JUAN JOSÉ MIRANDA BRONT; BRIAN CURCIO; ISABEL MÉNDEZ-DÍAZ; AGUSTÍN ISMAEL MONTERO; FEDERICO POUSA; PAULA ZABALA

A cluster-first route-second approach for the swap body vehicle routing problem

ANNALS OF OPERATIONS RESEARCH; Lugar: Berlin; Año: 2016

ENRICO MALAGUTI; ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAULA ZABALA

A branch-and-price algorithm for the (k,c)-coloring problem

NETWORKS; Lugar: New York; Año: 2015 vol. 65 p. 353 - 366

JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA

Facets and valid inequalities for the time-dependent travelling salesman problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; Lugar: Amsterdam; Año: 2014 vol. 236 p. 891 - 902

ENRICO MALAGUTI; ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAULA ZABALA

(k,c) - coloring via column generation

Electronic Notes in Discrete Mathematics; Año: 2013 vol. 41 p. 447 - 454

ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; GUSTAVO VULCANO; PAULA ZABALA

A branch-and-cut algorithm for the latent-class logit assortment problem

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2012

JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA

An integer programming approach for the time-dependent TSP

Electronic Notes in Discrete Mathematics; Año: 2010 vol. 36 p. 351 - 358

JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; GUSTAVO VULCANO

A Column Generation Algorithm for Choice-Based Network Revenue Management

Operations Research; Lugar: Hanover; Año: 2009 vol. 57 p. 769 - 784