default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Aronsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Emanuel Broman
, Jonas Eliasson, Martin Aronsson:
Efficient capacity allocation on deregulated railway markets. J. Rail Transp. Plan. Manag. 21: 100294 (2022)- 2020
- [j4]Sara Gestrelius, Anders Peterson, Martin Aronsson:
Timetable quality from the perspective of a railway infrastructure manager in a deregulated market: An interview study with Swedish practitioners. J. Rail Transp. Plan. Manag. 15: 100202 (2020)
2010 – 2019
- 2017
- [j3]Sara Gestrelius, Martin Aronsson, Martin Joborn, Markus Bohlin:
Towards a comprehensive model for track allocation and roll-time scheduling at marshalling yards. J. Rail Transp. Plan. Manag. 7(3): 157-170 (2017) - 2016
- [i4]Sara Gestrelius, Martin Aronsson:
An Industrial Take on Breast Cancer Treatment. ERCIM News 2016(105) (2016) - 2013
- [j2]Malin Forsgren, Martin Aronsson, Sara Gestrelius:
Maintaining tracks and traffic flow at the same time. J. Rail Transp. Plan. Manag. 3(3): 111-123 (2013) - [c11]Malin Forsgren, Martin Aronsson, Sara Gestrelius:
Towards shorter lead times in railway timetabling in Sweden. ITSC 2013: 1053-1058 - 2010
- [i3]Malin Forsgren, Martin Aronsson:
A New Approach to the Planning Process makes Huge Savings for the Railway Sector. ERCIM News 2010(83): 56 (2010)
2000 – 2009
- 2009
- [c10]Martin Aronsson, Markus Bohlin, Per Kreuger:
MILP formulations of cumulative constraints for railway scheduling - A comparative study. ATMOS 2009 - 2008
- [c9]Per Kreuger, Malin Forsgren, Martin Aronsson:
Reducing temporal delays in a real time train management system. SCAI 2008: 181-187 - 2007
- [i2]Martin Aronsson, Per Kreuger:
The Art of Stacking. ERCIM News 2007(68) (2007) - [i1]Per Kreuger, Martin Aronsson:
Railyard Shunting: A Challenge for Combinatorial Optimisation. ERCIM News 2007(68) (2007) - 2006
- [c8]Martin Aronsson, Per Kreuger, Jonatan Gjerdrum:
An Efficient MIP Model for Locomotive Scheduling with Time Windows. ATMOS 2006 - 2002
- [c7]Thomas Sjöland, Per Kreuger, Martin Aronsson:
Heterogeneous Scheduling and Rotation. Computational Logic: Logic Programming and Beyond 2002: 655-676
1990 – 1999
- 1992
- [c6]Martin Aronsson:
Implementational Issues in GCLA: A-Sufficiency and Definiens Operation. ELP 1992: 394-417 - 1991
- [c5]Martin Aronsson:
Methodology and Programming Techniques in GCLA II. ELP 1991: 1-44 - [c4]Martin Aronsson, Lars-Henrik Eriksson:
The GCLA II Programming Language. PDK 1991: 399-401 - 1990
- [j1]Martin Aronsson, Lars-Henrik Eriksson, Anette Gäredal, Lars Hallnäs, Peter Olin:
The programming language GCLA - A definitional approach to logic programming. New Gener. Comput. 7(4): 381-404 (1990)
1980 – 1989
- 1989
- [c3]Martin Aronsson, Lars-Henrik Eriksson, Lars Hallnäs, Per Kreuger:
A Survey of GCLA: A Definitional Approach to Logic Programming. ELP 1989: 49-99 - [c2]Manny Rayner, Åsa Hugosson, Martin Aronsson, Annika Wærn:
Formal Reasoning about Plan-Controlled Vehicles. SCAI 1989: 739-751 - [c1]Martin Aronsson, Lars-Henrik Eriksson, Anette Gäredal, Lars Hallnäs, Peter Olin:
GCLA: Generalized Horn Clauses as a Programming Language. SCAI 1989: 873-887
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-04-24 22:57 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:
