default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan A. Mesa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j35]Maria Cruz López de los Mozos Martin, Juan A. Mesa
:
To stop or not to stop: a time-constrained trip covering location problem on a tree network. Ann. Oper. Res. 316(2): 1039-1061 (2022)- [j34]Víctor Bucarey, Bernard Fortz, Natividad González-Blanco, Martine Labbé, Juan A. Mesa:
Benders decomposition for network design covering problems. Comput. Oper. Res. 137: 105417 (2022) - 2021
- [c8]Natividad González-Blanco, Antonio J. Lozano, Vladimir Marianov, Juan A. Mesa:
An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). ATMOS 2021: 18:1-18:6
2010 – 2019
- 2019
- [j33]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
The railway rapid transit network construction scheduling problem. Comput. Ind. Eng. 138 (2019) - 2018
- [j32]Luis Franco, Francisco Velasco Morente, Luis González Abril, Juan A. Mesa:
Single-facility location problems in two regions with ℓ1- and ℓq-norms separated by a straight line. Eur. J. Oper. Res. 269(2): 577-589 (2018) - 2017
- [j31]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78: 1-14 (2017) - [j30]Tunzi Tan, Suixiang Gao, Juan A. Mesa:
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint. Comput. Oper. Res. 87: 183-193 (2017) - [j29]Maria Cruz López de los Mozos Martin, Juan A. Mesa, Anita Schöbel:
A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances. Eur. J. Oper. Res. 260(1): 108-121 (2017) - [j28]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
The railway line frequency and size setting problem. Public Transp. 9(1-2): 33-53 (2017) - 2016
- [j27]David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
A general rapid network design, line planning and fleet investment integrated model. Ann. Oper. Res. 246(1-2): 127-144 (2016) - [c7]Francisco A. Ortega, Juan A. Mesa, Miguel A. Pozo:
Determining Routes for an Auxiliary Fleet in Presence of Emergencies on a Railway Line. ILS 2016: 3-13 - 2015
- [j26]Antonio Jose Lozano, Juan A. Mesa, Frank Plastria:
Location of weighted anti-ordered median straight lines with Euclidean distances. Discret. Appl. Math. 182: 122-133 (2015) - [j25]Eva Barrena, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
Transferability of collective transportation line networks from a topological and passenger demand perspective. Networks Heterog. Media 10(1): 1-16 (2015) - 2014
- [j24]Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
Locating optimal timetables and vehicle schedules in a transit line. Ann. Oper. Res. 222(1): 439-455 (2014) - [c6]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints. ATMOS 2014: 107-121 - 2013
- [j23]Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
A geometric model for an effective rescheduling after reducing service in public transportation systems. Comput. Oper. Res. 40(3): 737-746 (2013) - [j22]Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
The ordered anti-median problem with distances derived from a strictly convex norm. Discret. Appl. Math. 161(4-5): 642-649 (2013) - [j21]Bosco García-Archilla, Antonio J. Lozano, Juan A. Mesa, Federico Perea:
GRASP algorithms for the robust railway network design problem. J. Heuristics 19(2): 399-422 (2013) - 2010
- [j20]Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
Finding an Euclidean anti-k-centrum location of a set of points. Comput. Oper. Res. 37(2): 292-301 (2010) - [j19]Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
The k-Centrum Straight-line Location Problem. J. Math. Model. Algorithms 9(1): 1-17 (2010)
2000 – 2009
- 2009
- [j18]Juan A. Mesa, Blas Pelegrín, Justo Puerto:
Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X). Comput. Oper. Res. 36(5): 1333-1334 (2009) - [j17]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
Locating a metro line in a historical city centre: application to Sevilla. J. Oper. Res. Soc. 60(10): 1462-1466 (2009) - [p2]Ángel Marín, Juan A. Mesa, Federico Perea:
Integrating Robust Railway Network Design and Line Planning under Failures. Robust and Online Large-Scale Optimization 2009: 273-292 - [p1]Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
Effective Allocation of Fleet Frequencies by Reducing Intermediate Stops and Short Turning in Transit Systems. Robust and Online Large-Scale Optimization 2009: 293-309 - 2008
- [j16]S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j15]Maria Cruz López de los Mozos Martin, Juan A. Mesa, Justo Puerto:
A generalized model of equality measures in network location problems. Comput. Oper. Res. 35(3): 651-660 (2008) - [j14]T. Brian Boffey, Juan A. Mesa, Francisco A. Ortega, José I. Rodrigues:
Locating a low-level waste disposal site. Comput. Oper. Res. 35(3): 701-716 (2008) - [j13]Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito:
Center location problems on tree graphs with subtree-shaped customers. Discret. Appl. Math. 156(15): 2890-2910 (2008) - 2007
- [j12]Teresa Cáceres, Juan A. Mesa, Francisco A. Ortega:
Locating waste pipelines to minimize their impact on marine environment. Eur. J. Oper. Res. 179(3): 1143-1159 (2007) - [c5]Ravindra K. Ahuja, Christian Liebchen, Juan A. Mesa:
ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2007 - [c4]Ravindra K. Ahuja, Christian Liebchen, Juan A. Mesa:
ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2007 - [c3]Ricardo García, Ángel Marín, Juan A. Mesa, Federico Perea, Doroteo Verastegui:
A new concept of robustness. ATMOS 2007 - [e1]Christian Liebchen, Ravindra K. Ahuja, Juan A. Mesa:
ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, November 15-16, 2007, Sevilla, Spain. OASIcs 7, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2005
- [j11]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Ignacio Sevillano:
Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment. Ann. Oper. Res. 136(1): 49-63 (2005) - [j10]Arie Tamir, Justo Puerto, Juan A. Mesa, Antonio M. Rodríguez-Chía:
Conditional location of path and tree shaped facilities on trees. J. Algorithms 56(1): 50-75 (2005) - [c2]Ricardo García, Armando Garzón-Astolfi, Ángel Marín, Juan A. Mesa, Francisco A. Ortega:
Analysis of the Parameters of Transfers in Rapid Transit Network Design. ATMOS 2005 - 2004
- [j9]Teresa Cáceres, Maria Cruz López de los Mozos Martin, Juan A. Mesa:
The path-variance problem on tree networks. Discret. Appl. Math. 145(1): 72-79 (2004) - [j8]José Miguel Díaz-Báñez, Juan A. Mesa, Anita Schöbel:
Continuous location of dimensional structures. Eur. J. Oper. Res. 152(1): 22-44 (2004) - [c1]Gilbert Laporte, Ángel Marín, Juan A. Mesa, Francisco A. Ortega:
An Integrated Methodology for the Rapid Transit Network Design Problem. ATMOS 2004: 187-199 - 2003
- [j7]Juan A. Mesa, Justo Puerto, Arie Tamir:
Improved algorithms for several network location problems with equality measures. Discret. Appl. Math. 130(3): 437-448 (2003) - 2002
- [j6]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega:
Locating stations on rapid transit lines. Comput. Oper. Res. 29(6): 741-759 (2002) - 2001
- [j5]José Miguel Díaz-Báñez, Juan A. Mesa:
Fitting rectilinear polygonal curves to a set of points in the plane. Eur. J. Oper. Res. 130(1): 214-222 (2001) - [j4]Maria Cruz López de los Mozos Martin, Juan A. Mesa:
The maximum absolute deviation measure in location problems on networks. Eur. J. Oper. Res. 135(1): 184-194 (2001) - 2000
- [j3]Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega:
Optimization methods for the planning of rapid transit systems. Eur. J. Oper. Res. 122(1): 1-10 (2000) - [j2]Maria Cruz López de los Mozos Martin, Juan A. Mesa:
Heuristics for multiple facility location in a network using the variance criterion. J. Oper. Res. Soc. 51(8): 971-981 (2000) - [j1]Maria Cruz López de los Mozos Martin, Juan A. Mesa:
The Variance Location Problem on a Network with Continuously distributed demand. RAIRO Oper. Res. 34(2): 155-182 (2000)
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-08-22 20:47 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:
