default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGermán Paredes-Belmar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Germán Paredes-Belmar
, Guillermo Latorre-Núñez, Andrés Bronfman:
Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics. IEEE Access 12: 11276-11293 (2024)- [j9]Carlos Obreque, Germán Paredes-Belmar, Pablo A. Miranda Gonzalez, Giovanni Campuzano, Gabriel Gutiérrez-Jarpa:
Modeling and solving the two-level generalized median tour problem. Comput. Oper. Res. 164: 106558 (2024) - 2023
- [j8]Franco Menares, Elizabeth Montero, Germán Paredes-Belmar, Andrés Bronfman:
A bi-objective time-dependent vehicle routing problem with delivery failure probabilities. Comput. Ind. Eng. 185: 109601 (2023) - 2022
- [j7]Germán Paredes-Belmar, Elizabeth Montero, Armin Lüer-Villagra, Vladimir Marianov, Claudio Araya-Sassi:
Vehicle routing for milk collection with gradual blending: A case arising in Chile. Eur. J. Oper. Res. 303(3): 1403-1416 (2022) - 2020
- [j6]Carlos Obreque, Germán Paredes-Belmar, Pablo A. Miranda, Giovanni Campuzano, Gabriel Gutiérrez-Jarpa:
The Generalized Median Tour Problem: Modeling, Solving and an Application. IEEE Access 8: 178097-178107 (2020) - [j5]Claudio Araya-Sassi, Germán Paredes-Belmar, Gabriel Gutiérrez-Jarpa:
Multi-commodity inventory-location problem with two different review inventory control policies and modular stochastic capacity constraints. Comput. Ind. Eng. 143: 106410 (2020) - [c2]Jorge Villagrán, Elizabeth Montero, Germán Paredes-Belmar:
An Iterated Local Search Approach to Solve the Milk Collection Problem With Blending. CEC 2020: 1-8
2010 – 2019
- 2019
- [j4]Ying-Hua Huang, Carola A. Blazquez, Shan-Huen Huang, Germán Paredes-Belmar, Guillermo Latorre-Núñez:
Solving the Feeder Vehicle Routing Problem using ant colony optimization. Comput. Ind. Eng. 127: 520-535 (2019) - [c1]Elizabeth Montero, Dario Canales, Germán Paredes-Belmar, Raúl Soto:
A Prize Collecting problem applied to a Real Milk Collection problem in Chile. CEC 2019: 1415-1422 - 2018
- [j3]Shan-Huen Huang, Ying-Hua Huang, Carola Blazquez, Germán Paredes-Belmar:
Application of the ant colony optimization in the resolution of the bridge inspection routing problem. Appl. Soft Comput. 65: 443-461 (2018) - 2017
- [j2]Germán Paredes-Belmar, Armin Lüer-Villagra, Vladimir Marianov, Cristián E. Cortés, Andrés Bronfman:
The milk collection problem with blending and collection points. Comput. Electron. Agric. 134: 109-123 (2017) - 2015
- [j1]Andrés Bronfman, Vladimir Marianov, Germán Paredes-Belmar, Armin Lüer-Villagra:
The maximin HAZMAT routing problem. Eur. J. Oper. Res. 241(1): 15-27 (2015)
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-07 22:11 CEST 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:
