default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIván A. Contreras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j35]Maryam Haghi, Hossein Hashemi Doulabi, Iván A. Contreras, Nadia Bhuiyan:
Integrated consultation and chemotherapy scheduling with stochastic treatment times. J. Oper. Res. Soc. 74(9): 2012-2027 (2023)- 2022
- [j34]Pedram Hooshangi-Tabrizi, Hossein Hashemi Doulabi
, Iván A. Contreras, Nadia Bhuiyan:
Two-stage robust optimization for perishable inventory management with order modification. Expert Syst. Appl. 193: 116346 (2022) - [j33]Aditya Malik, Iván A. Contreras, Navneet Vidyarthi:
Two-Level Capacitated Discrete Location with Concave Costs. Transp. Sci. 56(6): 1703-1722 (2022) - 2021
- [j32]Erik Orm Hellsten, David Franz Koza, Iván A. Contreras, Jean-François Cordeau, David Pisinger:
The transit time constrained fixed charge multi-commodity network design problem. Comput. Oper. Res. 136: 105511 (2021) - [j31]Sibel A. Alumur, James F. Campbell, Iván A. Contreras, Bahar Yetis Kara, Vladimir Marianov, Morton E. O'Kelly:
Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1): 1-17 (2021) - 2020
- [j30]Paganini Barcellos de Oliveira, Iván A. Contreras, Ricardo Saraiva de Camargo, Gilberto de Miranda Junior:
A comparison of separation routines for benders optimality cuts for two-level facility location problems. Expert Syst. Appl. 141 (2020) - [j29]Pedram Hooshangi-Tabrizi, Iván A. Contreras, Nadia Bhuiyan, Gerald Batist:
Improving patient-care services at an oncology clinic using a flexible and adaptive scheduling procedure. Expert Syst. Appl. 150: 113267 (2020) - [j28]Andrés Acevedo-Ojeda, Iván A. Contreras, Mingyuan Chen:
Two-level lot-sizing with raw-material perishability and deterioration. J. Oper. Res. Soc. 71(3): 417-432 (2020) - 2019
- [j27]Carlos Armando Zetina, Iván A. Contreras, Jean-François Cordeau:
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. Comput. Oper. Res. 111: 311-324 (2019) - [j26]Carlos Armando Zetina, Iván A. Contreras, Elena Fernández, Carlos Luna-Mota:
Solving the optimum communication spanning tree problem. Eur. J. Oper. Res. 273(1): 108-117 (2019) - [j25]Mohammad Tohidi, Masoumeh Kazemi Zanjani, Iván A. Contreras:
Integrated physician and clinic scheduling in ambulatory polyclinics. J. Oper. Res. Soc. 70(2): 177-191 (2019) - [j24]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
An Exact Algorithm for Multilevel Uncapacitated Facility Location. Transp. Sci. 53(4): 1085-1106 (2019) - 2018
- [j23]Wael Nassief, Iván A. Contreras, Brigitte Jaumard:
A comparison of formulations and relaxations for cross-dock door assignment problems. Comput. Oper. Res. 94: 76-88 (2018) - [j22]Armaghan Alibeyg, Iván A. Contreras, Elena Fernández:
Exact solution of hub network design problems with profits. Eur. J. Oper. Res. 266(1): 57-71 (2018) - [j21]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Multi-level facility location problems. Eur. J. Oper. Res. 267(3): 791-805 (2018) - 2017
- [j20]Iván A. Contreras, Moayad Tanash, Navneet Vidyarthi:
Exact and heuristic approaches for the cycle hub location problem. Ann. Oper. Res. 258(2): 655-677 (2017) - [j19]Moayad Tanash, Iván A. Contreras, Navneet Vidyarthi:
An exact algorithm for the modular hub location problem with single assignments. Comput. Oper. Res. 85: 32-44 (2017) - [j18]Furkan Enderer, Claudio Contardo, Iván A. Contreras:
Integrating dock-door assignment and vehicle routing with cross-docking. Comput. Oper. Res. 88: 30-43 (2017) - [j17]Iván A. Contreras, Ali Nabi Duman:
A Functorial Construction of Quantum Subtheories. Entropy 19(5): 220 (2017) - [j16]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location. INFORMS J. Comput. 29(4): 767-779 (2017) - 2015
- [j15]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations. Discret. Appl. Math. 187: 140-154 (2015) - [j14]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau:
Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246(1): 186-198 (2015) - [j13]Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte:
Multi-level facility location as the maximization of a submodular set function. Eur. J. Oper. Res. 247(3): 1013-1016 (2015) - [j12]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
The Hub Line Location Problem. Transp. Sci. 49(3): 500-518 (2015) - 2014
- [j11]Iván A. Contreras, Elena Fernández:
Hub Location as the Minimization of a Supermodular Set Function. Oper. Res. 62(3): 557-570 (2014) - 2012
- [j10]Iván A. Contreras, Elena Fernández:
General network design: A unified view of combined location and network design problems. Eur. J. Oper. Res. 219(3): 680-697 (2012) - [j9]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transp. Sci. 46(4): 439-459 (2012) - 2011
- [j8]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3): 518-528 (2011) - [j7]Iván A. Contreras, Juan A. Díaz, Elena Fernández:
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. INFORMS J. Comput. 23(1): 41-55 (2011) - [j6]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Benders Decomposition for Large-Scale Uncapacitated Hub Location. Oper. Res. 59(6): 1477-1490 (2011) - [j5]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
The Dynamic Uncapacitated Hub Location Problem. Transp. Sci. 45(1): 18-32 (2011) - 2010
- [j4]Iván A. Contreras, Elena Fernández, Alfredo Marín:
The Tree of Hubs Location Problem. Eur. J. Oper. Res. 202(2): 390-400 (2010) - 2009
- [j3]Iván A. Contreras, Elena Fernández, Alfredo Marín:
Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36(12): 3117-3127 (2009) - [j2]Iván A. Contreras, Juan A. Díaz, Elena Fernández:
Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr. 31(3): 483-505 (2009) - 2008
- [j1]Iván A. Contreras, Juan A. Díaz:
Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157(1): 73-89 (2008)
Conference and Workshop Papers
- 2016
- [c1]Iván A. Contreras, Ali Nabi Duman:
Geometric Quantization and Epistemically Restricted Theories: The Continuous Case. QPL 2016: 40-50
Informal and Other Publications
- 2017
- [i1]Iván A. Contreras, Ali Nabi Duman:
A Functorial Construction of Quantum Subtheories. CoRR abs/1705.02971 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
