INVESTIGADORES
MIRANDA BRONT Juan Jose
congresos y reuniones científicas
GARCÍA ARAMOUNI, NICOLÁS; MIRANDA BRONT, JUAN JOSÉ
Rescheduling the NBA regular season via Integer Programming
23rd Conference of the International Federation of Operational Research Societies
Lugar: Santiago de Chile; Año: 2023;
GARCÍA ARAMOUNI, NICOLÁS; MIRANDA BRONT, JUAN JOSÉ
Rescheduling the NBA regular season via Integer Programming
MathSport International 9 Conference
Lugar: Reading; Año: 2022;
GARCÍA ARAMOUNI, NICOLÁS; JUAN JOSÉ MIRANDA BRONT
Sports scheduling and managerial aspects: insights for Argentina’s National Basketball League
8th Mathsport International Conference
Lugar: Virtual; Año: 2021;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT; SOULIGNAC, FRANCISCO J.
A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows
9th INFORMS Transportation Science and Logistics Society Workshop
Lugar: virtual; Año: 2021;
AGUSTÍN ISMAEL MONTERO; ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT
An Integer Programming approach for the Traveling Salesman Problem with release dates and completion time minimization
11th International Conference on Computational Logistics
Lugar: virtual; Año: 2020;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT; SOULIGNAC, FRANCISCO J.
Dynamic programming for the time-dependent traveling salesman problem with time windows
11th International Conference on Computational Logistics
Lugar: Virtual; Año: 2020;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT; SOULIGNAC, FRANCISCO
An Enhanced Branch and Price Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows
VeRoLog 2019
Lugar: Sevilla; Año: 2019;
LERA-ROMERO, GONZALO; JUAN JOSÉ MIRANDA BRONT; SOULIGNAC, FRANCISCO
An Enhanced Branch and Price Algorithm for the Time Dependent Vehicle Routing Problem with Time Window
Simposio Argentino de Informática Industrial e Invetigación Operativa
Lugar: Ciudad Autónoma de Buenos Aires; Año: 2018;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; GUSTAVO VULCANO; PAULA ZABALA
CDLP-based Bid-prices for Network Revenue Management
INFORMS Annual Meeting 2018
Lugar: Phoenix; Año: 2018;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT; SOULIGNAC, FRANCISCO
An Enhanced Branch and Price Algorithm for the Time Dependent Vehicle Routing Problem with Time Window
MIPAR 2018
Lugar: Ciudad Autónoma de Buenos Aires; Año: 2018;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
MIPAR 2018
Lugar: Ciudad Autónoma de Buenos Aires; Año: 2018;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization
Lugar: Bologna; Año: 2018;
AGUSTÍN ISMAEL MONTERO; JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ
An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows
First Triennial Conference of the Informs Transportation Science and Logistics Society
Lugar: Chicago; Año: 2017;
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT
Exact approaches for the time-dependent elementary shortest path problem with resource constraints
46 Jornadas Argentinas de Investigación Operativa
Lugar: Córdoba; Año: 2017;
AGUSTÍN MOSTEIRO; JUAN JOSÉ MIRANDA BRONT; FEDERICO POUSA
ILP formulations for the railway rescheduling problem under large disruptions
International Symposium on Combinatorial Optimization 2016
Lugar: Salerno; Año: 2016;
AGUSTÍN ISMAEL MONTERO; ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT
Integer programming and the TDTSP-TW with time dependent travel speeds
MIP@AR 2016
Lugar: Ciudad Autonoma de Buenos Aires; Año: 2016;
AGUSTÍN MOSTEIRO; JUAN JOSÉ MIRANDA BRONT; FEDERICO POUSA
ILP formulations for the railway rescheduling problem under large disruptions
MIP@AR 2016
Lugar: Ciudad Autonoma de Buenos Aires; Año: 2016;
ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA; JUAN JOSÉ MIRANDA BRONT
Una heurística basada en programación lineal entera para un problema de asignación horaria
MIP@AR 2016
Lugar: Ciudad Autonoma de Buenos Aires; Año: 2016;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAULA ZABALA
Train network design optimization applied to capacity estimation
Workshop in Operations, Networks and Data Analytics
Lugar: Ciudad Autonoma de Buenos Aires; Año: 2015;
AGUSTÍN ISMAEL MONTERO; ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT
An ILP-based heuristic for the VRP with pickups and deliveries
3rd International Symposium on Combinatorial Optimization
Lugar: Lisboa; Año: 2014;
MIROSLAV KULICH; LIBOR PREUCIL; JUAN JOSÉ MIRANDA BRONT
Single Robot Search for a Stationary Object in an Unknown Environment
2014 IEEE International Conference on Robotics and Automation
Lugar: Hong Kong; Año: 2014;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAOLO TOTH; PAULA ZABALA
A Branch and Cut algorithm for the Time-Dependent Travelling Salesman Problem with Time Windows
VIII ALIO/EURO Workshop on Applied Combinatorial Optimization
Lugar: Montevideo; Año: 2014;
ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA; JUAN JOSÉ MIRANDA BRONT
An ILP based heuristic for a generalization of the post-enrolment course timetabling problem
VIII ALIO/EURO Workshop on Applied Combinatorial Optimization
Lugar: Montevideo; Año: 2014;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAOLO TOTH; PAULA ZABALA
Infeasible path formulations for the time-dependent TSP with time windows
10th Cologne-TwenteWorkshop on Graphs and Combinatorial Optimization (CTW2011)
Lugar: Frascati; Año: 2011;
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
International Symposium on Combinatorial Optimization
Lugar: Hammamet; Año: 2010;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; GUSTAVO VULCANO; PAULA ZABALA
A branch and cut algorithm for the product assortment problem under customer choice behavior
23rd European Conference on Operational Research
Lugar: Bonn; Año: 2009;
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
An integer programming approach for the time dependent travelling saleman problem
23rd European Conference on Operational Research
Lugar: Bonn; Año: 2009;
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; GUSTAVO VULCANO; PAULA ZABALA
Product Assortment Under Choice Behavoiur
INFORMS Annual Meeting 2008
Lugar: Washington DC; Año: 2008;
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; GUSTAVO VULCANO
Un algoritmo de generación de columnas para la gestión de ingresos bajo preferencias de clientes
XIV Congreso Latino Ibero Americano de Investigación de Operaciones
Lugar: Cartagena de Indias; Año: 2008;
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ
A Cut and Branch Algorithm for the Time-Dependent Travelling Salesman Problem
VI ALIO/EURO Workshop on Applied Combinatorial Optimization
Lugar: Buenos Aires; Año: 2008;
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; GUSTAVO VULCANO
Un algoritmo de generación de columnas para la gestión de ingresos bajol preferencias de clientes
Jornadas Argentinas de Informática e Investigación Operativa
Lugar: Mar del Plata, Buenos Aires; Año: 2007;
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; GUSTAVO VULCANO
A column generation algorithm for the choice-based linear programming model for network revenue management
International Symposium on Mathematical Programming
Lugar: Rio de Janeiro; Año: 2006;