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:"Practical solutions of NP complete problems"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Combinatorial optimization
2
Mathematical programming
2
Mathematische Optimierung
2
Scheduling problem
2
Scheduling-Verfahren
2
Theorie
2
Theory
2
Clique and chromatic numbers
1
Greedy coloring
1
LP relaxation bounds
1
Maximum clique problem
1
Practical solutions of NP complete problems
1
Practical solutions of NP-complete problems
1
Weighted maximum clique
1
Zero-one linear programming
1
more ...
less ...
Online availability
All
Free
1
Undetermined
1
Type of publication
All
Article
2
Type of publication (narrower categories)
All
Article in journal
2
Aufsatz in Zeitschrift
2
Language
All
English
2
Author
All
Szabó, Sándor
2
Kardos, Dóra
1
Patassy, Patrik
1
Zaválnij, Bogdán
1
Published in...
All
Central European journal of operations research
1
Operations research forum
1
Source
All
ECONIS (ZBW)
2
Showing
1
-
2
of
2
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Numerical experiments with LP formulations of the maximum clique problem
Kardos, Dóra
;
Patassy, Patrik
;
Szabó, Sándor
; …
- In:
Central European journal of operations research
30
(
2022
)
4
,
pp. 1353-1367
Persistent link: https://ebvufind01.dmz1.zbw.eu/10013445722
Saved in:
2
A clique search problem and its application to machine scheduling
Szabó, Sándor
- In:
Operations research forum
2
(
2021
)
4
,
pp. 1-12
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012794437
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
