//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"The longest common palindromic subsequence problem"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
A* search
1
Algorithm
1
Algorithmus
1
Anytime algorithms
1
Beam search
1
Heuristics
1
Heuristik
1
Hybrid algorithms
1
Mathematical programming
1
Mathematische Optimierung
1
The longest common palindromic subsequence problem
1
Theorie
1
Theory
1
more ...
less ...
Online availability
All
Undetermined
1
Type of publication
All
Article
1
Type of publication (narrower categories)
All
Article in journal
1
Aufsatz in Zeitschrift
1
Language
All
English
1
Author
All
Blum, Christian
1
Djukanovic, Marko
1
Raidl, Günther
1
Published in...
All
Computers & operations research : and their applications to problems of world concern ; an international journal
1
Source
All
ECONIS (ZBW)
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Anytime algorithms for
the
longest
common
palindromic
subsequence
problem
Djukanovic, Marko
;
Raidl, Günther
;
Blum, Christian
- In:
Computers & operations research : and their …
114
(
2020
),
pp. 1-20
Persistent link: https://www.econbiz.de/10012146641
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->