default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsteve Codina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Ricardo García-Ródenas
, María Luz López-García, Luis Cadarso, Esteve Codina:
An efficient greedy heuristic for the real-time train platforming problem. Comput. Oper. Res. 164: 106525 (2024)- 2022
- [j10]Francisca Rosell, Esteve Codina, Lídia Montero:
A combined and robust modal-split/traffic assignment model for rail and road freight transport. Eur. J. Oper. Res. 303(2): 688-698 (2022)
2010 – 2019
- 2017
- [j9]Francisco López-Ramos, Esteve Codina, Ángel Marín, Armando Guarnaschelli:
Integrated approach to network design and frequency setting problem in railway rapid transit systems. Comput. Oper. Res. 80: 128-146 (2017) - 2015
- [j8]Esteve Codina Sancho, Gemma Ibáñez Marí, Jaume Barceló Bugeda:
Applying Projection-Based Methods to the Asymmetric Traffic Assignment Problem. Comput. Aided Civ. Infrastructure Eng. 30(2): 103-119 (2015) - 2014
- [c3]Lídia Montero, Esteve Codina, Jaume Barceló:
Dynamic OD transit matrix estimation: formulation and model-building environment. ICSEng 2014: 347-353 - [c2]Esteve Codina, Ángel Marín, Lídia Montero:
A Design Model for Rapid Transit Networks Considering Rolling Stock's Reliability and Redistribution of Services During Disruptions. ICSEng 2014: 571-577 - [c1]Pau Fonseca i Casas, Esteve Codina Sancho, Lídia Montero Mercadé, Mari Paz Linares, Cristina Montañola-Sales:
Formal and operational validation of a bus stop public transport network micro simulation. WSC 2014: 604-615 - 2013
- [j7]Esteve Codina:
A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian. Transp. Sci. 47(2): 231-246 (2013)
2000 – 2009
- 2008
- [j6]Ángel Marín, Esteve Codina:
Network design: taxi planning. Ann. Oper. Res. 157(1): 135-151 (2008) - 2006
- [j5]Esteve Codina, Lídia Montero:
Approximation of the steepest descent direction for the O-D matrix adjustment problem. Ann. Oper. Res. 144(1): 329-362 (2006) - [j4]Esteve Codina, Ricardo García, Ángel Marín:
New algorithmic alternatives for the O-D matrix adjustment problem on traffic networks. Eur. J. Oper. Res. 175(3): 1484-1500 (2006) - 2005
- [j3]Jaume Barceló, Esteve Codina, Jordi Casas, Jaume L. Ferrer, David García:
Microscopic traffic simulation: A tool for the design, analysis and evaluation of intelligent transport systems. J. Intell. Robotic Syst. 41(2-3): 173-203 (2005) - 2004
- [j2]Esteve Codina, Jaume Barceló:
Adjustment of O-D trip matrices from observed volumes: An algorithmic approach based on conjugate directions. Eur. J. Oper. Res. 155(3): 535-557 (2004)
1990 – 1999
- 1995
- [j1]Esteve Codina, Jaume Barceló:
Dynamic traffic assignment: Considerations on some deterministic modelling approaches. Ann. Oper. Res. 60(1): 1-58 (1995)
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:05 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:
