Iván A. Contreras

According to our database1, Iván A. Contreras authored at least 34 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Two-stage robust optimization for perishable inventory management with order modification.
Expert Syst. Appl., 2022

Perspectives on modeling hub location problems.
Eur. J. Oper. Res., 2021

The transit time constrained fixed charge multi-commodity network design problem.
Comput. Oper. Res., 2021

Two-level lot-sizing with raw-material perishability and deterioration.
J. Oper. Res. Soc., 2020

A comparison of separation routines for benders optimality cuts for two-level facility location problems.
Expert Syst. Appl., 2020

Improving patient-care services at an oncology clinic using a flexible and adaptive scheduling procedure.
Expert Syst. Appl., 2020

An Exact Algorithm for Multilevel Uncapacitated Facility Location.
Transp. Sci., 2019

Integrated physician and clinic scheduling in ambulatory polyclinics.
J. Oper. Res. Soc., 2019

Solving the optimum communication spanning tree problem.
Eur. J. Oper. Res., 2019

Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design.
Comput. Oper. Res., 2019

Multi-level facility location problems.
Eur. J. Oper. Res., 2018

Exact solution of hub network design problems with profits.
Eur. J. Oper. Res., 2018

A comparison of formulations and relaxations for cross-dock door assignment problems.
Comput. Oper. Res., 2018

Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location.
INFORMS J. Comput., 2017

A Functorial Construction of Quantum Subtheories.
Entropy, 2017

An exact algorithm for the modular hub location problem with single assignments.
Comput. Oper. Res., 2017

Integrating dock-door assignment and vehicle routing with cross-docking.
Comput. Oper. Res., 2017

Exact and heuristic approaches for the cycle hub location problem.
Ann. Oper. Res., 2017

Geometric Quantization and Epistemically Restricted Theories: The Continuous Case.
Proceedings of the Proceedings 13th International Conference on Quantum Physics and Logic, 2016

The Hub Line Location Problem.
Transp. Sci., 2015

Exact and heuristic algorithms for the design of hub networks with multiple lines.
Eur. J. Oper. Res., 2015

Multi-level facility location as the maximization of a submodular set function.
Eur. J. Oper. Res., 2015

The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations.
Discret. Appl. Math., 2015

Hub Location as the Minimization of a Supermodular Set Function.
Oper. Res., 2014

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels.
Transp. Sci., 2012

General network design: A unified view of combined location and network design problems.
Eur. J. Oper. Res., 2012

The Dynamic Uncapacitated Hub Location Problem.
Transp. Sci., 2011

Benders Decomposition for Large-Scale Uncapacitated Hub Location.
Oper. Res., 2011

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment.
INFORMS J. Comput., 2011

Stochastic uncapacitated hub location.
Eur. J. Oper. Res., 2011

The Tree of Hubs Location Problem.
Eur. J. Oper. Res., 2010

Lagrangean relaxation for the capacitated hub location problem with single assignment.
OR Spectr., 2009

Tight bounds from a path based formulation for the tree of hub location problem.
Comput. Oper. Res., 2009

Scatter search for the single source capacitated facility location problem.
Ann. Oper. Res., 2008