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:"clique problem"
Narrow search

Narrow search

Year of publication
Subject
All
Mathematical programming 16 Mathematische Optimierung 16 Theorie 12 Theory 12 Scheduling problem 10 Scheduling-Verfahren 10 Algorithm 8 Algorithmus 8 Maximum clique problem 8 Branch and Bound 6 Branch-and-Bound 6 Combinatorial optimization 6 Heuristics 5 Heuristik 5 Ganzzahlige Optimierung 4 Graph theory 4 Graphentheorie 4 Integer programming 4 Branch-and-bound 2 Branch-and-bound algorithm 2 Data mining 2 Global optimization 2 Maximum Clique Problem 2 Maximum Weighted Clique Problem 2 Nonlinear programming 2 Quadratic programming 2 Bandwidth 1 Bias 1 Biased random-key genetic algorithm 1 Biological networks 1 Boolean quadratic problem 1 Branch and bound 1 Branch and bound algorithm 1 Branch-and-Bound algorithm 1 Branching ordering 1 Clique problem 1 Clique relaxations 1 Clique's edge neighborhood 1 Cohesive subgroups 1 Combinatorial branch-and-bound 1
more ... less ...
Online availability
All
Undetermined 16 Free 2
Type of publication
All
Article 21 Book / Working Paper 1
Type of publication (narrower categories)
All
Article in journal 17 Aufsatz in Zeitschrift 17
Language
All
English 17 Undetermined 5
Author
All
Furini, Fabio 4 San Segundo, Pablo 3 Butenko, Sergiy 2 Coniglio, Stefano 2 Dellepiane, Umberto 2 Jiang, Hua 2 Li, Chu-Min 2 Manyà, Felip 2 Palagi, Laura 2 Artieda, Jorge 1 Assad, Assif 1 Batsyn, Mikhail 1 Birattari, Mauro 1 Bundfuss, Stefan 1 Bärmann, Andreas 1 Deep, Kusum 1 Dür, Mirjam 1 Fontes, Dalila B. M. M. 1 Gemander, Patrick 1 Goeke, Dominik 1 Gouveia, Luis 1 Hosseinian, Seyedmohammadhossein 1 Kardos, Dóra 1 Li, Yu 1 Liu, Yanli 1 Ljubić, Ivana 1 Mahdavi Pajouh, Foad 1 Martin, Alexander 1 Martins, Pedro 1 Mascia, Franco 1 Maslov, Evgeny 1 Moeini, Mahdi 1 Namayanja, Josephine 1 Nasirian, Farzaneh 1 Pardalos, Panos 1 Pardalos, Panos M. 1 Patassy, Patrik 1 Pattillo, Jeffrey 1 Pellegrini, Paola 1 Pinto, Bruno Q. 1
more ... less ...
Institution
All
Institut for Marketing og Organisation, Aarhus Universitet 1
Published in...
All
European journal of operational research : EJOR 6 Computers & operations research : and their applications to problems of world concern ; an international journal 4 Central European journal of operations research 2 European Journal of Operational Research 2 Journal of Global Optimization 2 EURO journal on computational optimization 1 INFORMS journal on computing : JOC 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 Transportation science 1 Working Papers / Institut for Marketing og Organisation, Aarhus Universitet 1
more ... less ...
Source
All
ECONIS (ZBW) 17 RePEc 5
Showing 11 - 20 of 22
Cover Image
A new upper bound for the maximum weight clique problem
Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu - In: European journal of operational research : EJOR 270 (2018) 1, pp. 66-77
Persistent link: https://www.econbiz.de/10011868925
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 variable neighborhood search heuristic for the maximum ratio clique problem
Goeke, Dominik; Moeini, Mahdi; Poganiuch, David - In: Computers & operations research : and their … 87 (2017), pp. 283-291
Persistent link: https://www.econbiz.de/10011743604
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
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Gouveia, Luis; Martins, Pedro - In: EURO journal on computational optimization 3 (2015) 1, pp. 1-30
Persistent link: https://www.econbiz.de/10010500759
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:
  • First
  • Prev
  • 1
  • 2
  • 3
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...