default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcel Turkensteen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Gerold Jäger, Marcel Turkensteen:
Assessing the effect of multiple cost changes using reverse set tolerances. Discret. Appl. Math. 354: 279-300 (2024)- [i1]Gerold Jäger, Marcel Turkensteen:
Extending the definition of set tolerances. CoRR abs/2402.14542 (2024) - 2023
- [j11]Julian Baals
, Simon Emde, Marcel Turkensteen:
Minimizing earliness-tardiness costs in supplier networks - A just-in-time truck routing problem. Eur. J. Oper. Res. 306(2): 707-741 (2023) - [j10]Marcel Turkensteen, Wilco van den Heuvel:
The trade-off between costs and carbon emissions from economic lot-sizing decisions. INFOR Inf. Syst. Oper. Res. 61(2): 169-198 (2023) - 2022
- [j9]Marcel Turkensteen, Gerold Jäger:
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems. Theor. Comput. Sci. 937: 1-21 (2022)
2010 – 2019
- 2018
- [j8]Gerold Jäger, Marcel Turkensteen:
Extending single tolerances to set tolerances. Discret. Appl. Math. 247: 197-215 (2018) - 2017
- [j7]Marcel Turkensteen:
The accuracy of carbon emission and fuel consumption computations in green vehicle routing. Eur. J. Oper. Res. 262(2): 647-659 (2017) - [j6]Marcel Turkensteen, Dmitriy S. Malyshev, Boris Goldengorin, Panos M. Pardalos:
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. J. Glob. Optim. 68(3): 601-622 (2017) - 2013
- [c2]Marcel Turkensteen, Christian Larsen:
Transportation Costs and Carbon Emissions in a Vendor Managed Inventory Situation. OR 2013: 459-464 - 2012
- [j5]Remco Germs, Boris Goldengorin, Marcel Turkensteen:
Lower tolerance-based Branch and Bound algorithms for the ATSP. Comput. Oper. Res. 39(2): 291-298 (2012) - [j4]Marcel Turkensteen, Andreas Klose:
Demand dispersion and logistics costs in one-to-many distribution systems. Eur. J. Oper. Res. 223(2): 499-507 (2012) - 2011
- [j3]Marcel Turkensteen, Gerard Sierksma, Jaap E. Wieringa:
Balancing the fit and logistics costs of market segmentations. Eur. J. Oper. Res. 213(1): 340-348 (2011)
2000 – 2009
- 2008
- [j2]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189(3): 775-788 (2008) - 2006
- [j1]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3(1): 63-77 (2006) - 2004
- [c1]Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen:
Tolerance Based Algorithms for the ATSP. WG 2004: 222-234
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 21:22 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:
