Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Academic 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:"T-join"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
T-join
2
Algorithm
1
Algorithmus
1
Approximation algorithm
1
Integrality gap
1
Kasteleyn city
1
Maximum cut
1
Perfect matching
1
Planar graph
1
Rundreiseproblem
1
Theorie
1
Theory
1
Tourenplanung
1
Traveling salesman problem
1
Travelling salesman problem
1
Vehicle routing problem
1
more ...
less ...
Online availability
All
Undetermined
2
Type of publication
All
Article
2
Type of publication (narrower categories)
All
Article in journal
1
Aufsatz in Zeitschrift
1
Language
All
English
1
Undetermined
1
Author
All
Liers, F.
1
Pardella, G.
1
Traub, Vera
1
Published in...
All
Computational Optimization and Applications
1
Operations research letters
1
Source
All
ECONIS (ZBW)
1
RePEc
1
Showing
1
-
2
of
2
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Improving on best-of-many-christofides for T-tours
Traub, Vera
- In:
Operations research letters
48
(
2020
)
6
,
pp. 798-804
Persistent link: https://www.econbiz.de/10012430155
Saved in:
2
Partitioning planar graphs: a fast combinatorial approach for max-cut
Liers, F.
;
Pardella, G.
- In:
Computational Optimization and Applications
51
(
2012
)
1
,
pp. 323-344
Persistent link: https://www.econbiz.de/10010998254
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
