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:"Maximum clique problem"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Maximum clique problem
9
Mathematical programming
8
Mathematische Optimierung
8
Scheduling problem
5
Scheduling-Verfahren
5
Theorie
5
Theory
5
Heuristics
4
Heuristik
4
Algorithm
3
Algorithmus
3
Branch and Bound
2
Branch-and-Bound
2
Combinatorial optimization
2
Data mining
2
Global optimization
2
Graph theory
2
Graphentheorie
2
Maximum Clique Problem
2
Nonlinear programming
2
Quadratic programming
2
Semidefinite programming
2
Bias
1
Biased random-key genetic algorithm
1
Biological networks
1
Branch and bound algorithm
1
Branch-and-bound
1
Branch-and-bound algorithm
1
Branching ordering
1
Clique relaxations
1
Cohesive subgroups
1
Copositive matrices
1
Data Mining
1
Evalutionary algorithm
1
Evolutionary algorithm
1
Evolutionärer Algorithmus
1
Exact algorithm
1
Graph coloring problem
1
Graph colouring
1
Graph density
1
more ...
less ...
Online availability
All
Undetermined
9
Free
1
Type of publication
All
Article
12
Type of publication (narrower categories)
All
Article in journal
8
Aufsatz in Zeitschrift
8
Language
All
English
8
Undetermined
4
Author
All
Dellepiane, Umberto
2
Palagi, Laura
2
Assad, Assif
1
Batsyn, Mikhail
1
Battista, Federico
1
Birattari, Mauro
1
Bundfuss, Stefan
1
Butenko, Sergiy
1
De Santis, Marianna
1
Deep, Kusum
1
Dür, Mirjam
1
Furini, Fabio
1
Jiang, Hua
1
Kardos, Dóra
1
Li, Chu-Min
1
Manyà, Felip
1
Mascia, Franco
1
Maslov, Evgeny
1
Pardalos, Panos
1
Pardalos, Panos M.
1
Patassy, Patrik
1
Pattillo, Jeffrey
1
Pellegrini, Paola
1
Pinto, Bruno Q.
1
Plastino, Alexandre
1
Ribeiro, Celso C.
1
Rosseti, Isabel
1
San Segundo, Pablo
1
Sponsel, Julia
1
Stützle, Thomas G.
1
Szabó, Sándor
1
Youssef, Nataly
1
Zaválnij, Bogdán
1
Álvarez, David
1
more ...
less ...
Published in...
All
European journal of operational research : EJOR
3
European Journal of Operational Research
2
Journal of Global Optimization
2
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies
1
Central European journal of operations research
1
Computers & operations research : and their applications to problems of world concern ; an international journal
1
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS)
1
Opsearch : journal of the Operational Research Society of India
1
more ...
less ...
Source
All
ECONIS (ZBW)
8
RePEc
4
Showing
1
-
10
of
12
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
Battista, Federico
;
De Santis, Marianna
- In:
4OR : quarterly journal of the Belgian, French and …
23
(
2025
)
1
,
pp. 65-95
Persistent link: https://www.econbiz.de/10015434810
Saved in:
2
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://www.econbiz.de/10013445722
Saved in:
3
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo
;
Furini, Fabio
;
Álvarez, David
; …
- In:
European journal of operational research : EJOR
307
(
2023
)
3
,
pp. 1008-1025
Persistent link: https://www.econbiz.de/10014282934
Saved in:
4
A biased random-key genetic algorithm for the maximum quasi-clique problem
Pinto, Bruno Q.
;
Ribeiro, Celso C.
;
Rosseti, Isabel
; …
- In:
European journal of operational research : EJOR
271
(
2018
)
3
,
pp. 849-865
Persistent link: https://www.econbiz.de/10011903225
Saved in:
5
A heuristic based harmony search algorithm for
maximum
clique
problem
Assad, Assif
;
Deep, Kusum
- In:
Opsearch : journal of the Operational Research Society …
55
(
2018
)
2
,
pp. 411-433
Persistent link: https://www.econbiz.de/10011882101
Saved in:
6
On minimization of the number of branches in branch-and-bound algorithms for the
maximum
clique
problem
Li, Chu-Min
;
Jiang, Hua
;
Manyà, Felip
- In:
Computers & operations research : and their …
84
(
2017
),
pp. 1-15
Persistent link: https://www.econbiz.de/10011710166
Saved in:
7
Using SVM to combine global heuristics for the Standard Quadratic Problem
Dellepiane, Umberto
;
Palagi, Laura
- In:
European journal of operational research : EJOR
241
(
2015
)
3
,
pp. 596-605
Persistent link: https://www.econbiz.de/10010487598
Saved in:
8
An analysis of parameter adaptation in reactive tabu search
Mascia, Franco
;
Pellegrini, Paola
;
Birattari, Mauro
; …
- In:
International transactions in operational research : …
21
(
2014
)
1
,
pp. 127-152
Persistent link: https://www.econbiz.de/10010234635
Saved in:
9
Using SVM to combine global heuristics for the Standard Quadratic Problem
Dellepiane, Umberto
;
Palagi, Laura
- In:
European Journal of Operational Research
241
(
2015
)
3
,
pp. 596-605
selects the “best” heuristic. We test our method on StQP arising from the
Maximum
Clique
Problem
on a graph which is a …
Persistent link: https://www.econbiz.de/10011117495
Saved in:
10
Speeding up branch and bound algorithms for solving the
maximum
clique
problem
Maslov, Evgeny
;
Batsyn, Mikhail
;
Pardalos, Panos
- In:
Journal of Global Optimization
59
(
2014
)
1
,
pp. 1-21
In this paper we consider two branch and bound algorithms for the
maximum
clique
problem
which demonstrate the best …
Persistent link: https://www.econbiz.de/10010994124
Saved in:
1
2
Next
Last
Results per page
10
25
50
100
250
A service of the
zbw
FAQ-Assistent (beta)
×
Loading...
