default search action
Jens Clausen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j22]Julienne LaChance, Kevin Suh, Jens Clausen, Daniel J. Cohen:
Learning the rules of collective cell migration using deep attention networks. PLoS Comput. Biol. 18(4) (2022) - 2020
- [j21]Walter L. Boyajian, Jens Clausen, Lea M. Trenkwalder, Vedran Dunjko, Hans J. Briegel:
On the convergence of projective-simulation-based reinforcement learning in Markov decision processes. Quantum Mach. Intell. 2(2): 1-21 (2020)
2010 – 2019
- 2019
- [i2]Jens Clausen, Walter L. Boyajian, Lea M. Trenkwalder, Vedran Dunjko, Hans J. Briegel:
On the convergence of projective-simulation-based reinforcement learning in Markov decision processes. CoRR abs/1910.11914 (2019) - 2016
- [i1]Jens Clausen, Hans J. Briegel:
Quantum machine learning with glow for episodic tasks and decision games. CoRR abs/1601.07358 (2016) - 2010
- [j20]Jens Clausen, Allan Larsen, Jesper Larsen:
Foreword. Comput. Oper. Res. 37(5): 807-808 (2010) - [j19]Jens Clausen, Allan Larsen, Jesper Larsen, Natalia J. Rezanova:
Disruption management in the airline industry - Concepts, models and methods. Comput. Oper. Res. 37(5): 809-821 (2010)
2000 – 2009
- 2009
- [j18]Anders Dohn, Esben Kolind, Jens Clausen:
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Comput. Oper. Res. 36(4): 1145-1157 (2009) - [j17]Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte:
Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12): 1708-1718 (2009) - [c9]Jens Clausen, Gabriele Di Stefano:
ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2009 - [p1]Julie Jespersen-Groth, Daniel Potthoff, Jens Clausen, Dennis Huisman, Leo G. Kroon, Gábor Maróti, Morten N. Nielsen:
Disruption Management in Passenger Railway Transportation. Robust and Online Large-Scale Optimization 2009: 399-421 - [e2]Jens Clausen, Gabriele Di Stefano:
ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, IT University of Copenhagen, Denmark, September 10, 2009. OASIcs 12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 [contents] - 2007
- [c8]Anders Dohn, Esben Kolind, Jens Clausen:
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints. ICAPS 2007: 120-127 - [c7]Jens Clausen:
Applied Railway Optimization in Production Planning at DSB S-tog - tasks, tools and challenges. ATMOS 2007 - [c6]Jens Clausen:
Disruption Management in PassengerTransportation - from Air to Tracks. ATMOS 2007 - 2006
- [j16]Jens Clausen, Suquan Ju:
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case. Eur. J. Oper. Res. 175(2): 1141-1150 (2006) - [j15]C. V. Fabritius, N. L. Madsen, Jens Clausen, Jesper Larsen:
Finding the best visualization of an ontology. J. Oper. Res. Soc. 57(12): 1482-1490 (2006) - [j14]Gershon Kurizki, Nir Bar-Gill, Jens Clausen, Michal Kolár, Tomás Opatrný:
Cheating on Complementarity and Interference by Translational - Internal Entanglement. Quantum Inf. Process. 5(6): 463-479 (2006) - [c5]Mads Hofman, Line Madsen, Julie Jespersen, Jens Clausen, Jesper Larsen:
Robustness and Recovery in Train Scheduling - a Case Study from DSB S-tog a/s. ATMOS 2006 - 2002
- [c4]Michael Løve, Kim Riis Sørensen, Jesper Larsen, Jens Clausen:
Disruption Management for an Airline - Rescheduling of Aircraft. EvoWorkshops 2002: 315-324 - 2000
- [j13]Stefan E. Karisch, Franz Rendl, Jens Clausen:
Solving Graph Bisection Problems with Semidefinite Programming. INFORMS J. Comput. 12(3): 177-191 (2000)
1990 – 1999
- 1999
- [j12]Jens Clausen, Michael Perregaard:
On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. Ann. Oper. Res. 90: 1-17 (1999) - [j11]Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen:
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. Computing 63(4): 351-403 (1999) - 1998
- [j10]Michael Perregaard, Jens Clausen:
Parallel branch-and-bound methods for thejob-shop scheduling problem. Ann. Oper. Res. 83: 137-160 (1998) - [j9]Jens Clausen, Stefan E. Karisch, Michael Perregaard, Franz Rendl:
On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. 10(2): 127-147 (1998) - [j8]Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard:
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM. J. Parallel Distributed Comput. 50(1/2): 157-169 (1998) - 1997
- [j7]Jens Clausen, Michael Perregaard:
Solving Large Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. 8(2): 111-127 (1997) - [c3]Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard:
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel. IPPS 1997: 418- - 1996
- [j6]Stephen Alstrup, Jens Clausen, Kristian Jørgensen:
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. Inf. Process. Lett. 59(1): 9-11 (1996) - [c2]Jens Clausen:
Parallel Search-Based Methods in Optimization. PARA 1996: 176-185 - 1995
- [j5]Jens Clausen, Jakob Krarup:
A Family of Bipartite Cardinality Matching Problems Solvable in O(n2) Time. Nord. J. Comput. 2(4): 496-501 (1995) - [e1]Egon Balas, Jens Clausen:
Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings. Lecture Notes in Computer Science 920, Springer 1995, ISBN 3-540-59408-6 [contents] - 1994
- [j4]Jens Clausen, Jesper Larsson Träff:
Do Inherently Sequential Branch-and-Bound Algorithms Exist? Parallel Process. Lett. 4: 3-13 (1994) - [c1]Christian Schutt, Jens Clausen:
Parallel Algorithms for the Assignment Problem - An Experimental Evaluation of Three Distributed Algorithms. Parallel Processing of Discrete Optimization Problems 1994: 337-351 - 1991
- [j3]Jens Clausen, Jesper Larsson Träff:
Implementation of parallel branch-and-bound algorithms - experiences with the graph partitioning problem. Ann. Oper. Res. 33(5): 329-349 (1991)
1980 – 1989
- 1988
- [j2]Jens Clausen, Jakob Krarup:
Arranging Apples in an Array. BIT 28(3): 552-568 (1988) - 1984
- [j1]Peter Johansen, Neil D. Jones, Jens Clausen:
A method for detecting structure in polyhedra. Pattern Recognit. Lett. 2(4): 217-225 (1984)
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:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint