EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
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
Subject
All
Maximum clique problem 8 Mathematical programming 7 Mathematische Optimierung 7 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 Maximum Clique Problem 2 Nonlinear programming 2 Quadratic 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 colouring 1 Graph density 1 Graph theory 1 Graphentheorie 1 Greedy coloring 1 Harmony search 1
more ... less ...
Online availability
All
Undetermined 8 Free 1
Type of publication
All
Article 11
Type of publication (narrower categories)
All
Article in journal 7 Aufsatz in Zeitschrift 7
Language
All
English 7 Undetermined 4
Author
All
Dellepiane, Umberto 2 Palagi, Laura 2 Assad, Assif 1 Batsyn, Mikhail 1 Birattari, Mauro 1 Bundfuss, Stefan 1 Butenko, Sergiy 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 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) 7 RePEc 4
Showing 1 - 10 of 11
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
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:
Cover Image
On clique relaxation models in network analysis
Pattillo, Jeffrey; Youssef, Nataly; Butenko, Sergiy - In: European Journal of Operational Research 226 (2013) 1, pp. 9-18
Increasing interest in studying community structures, or clusters in complex networks arising in various applications has led to a large and diverse body of literature introducing numerous graph-theoretic models relaxing certain characteristics of the classical clique concept. This paper...
Persistent link: https://www.econbiz.de/10010603399
Saved in:
  • 1
  • 2
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...