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 1 - 10 of 22
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
A note on computational approaches for the antibandwidth problem
Sinnl, Markus - In: Central European journal of operations research 29 (2021) 3, pp. 1057-1077
Persistent link: https://www.econbiz.de/10012587744
Saved in:
Cover Image
A stochastic optimization approach to energy-efficient underground timetabling under uncertain dwell and running times
Gemander, Patrick; Bärmann, Andreas; Martin, Alexander - In: Transportation science 57 (2023) 6, pp. 1627-1645
Persistent link: https://www.econbiz.de/10014464525
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 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
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo - In: European journal of operational research : EJOR 289 (2021) 2, pp. 435-455
Persistent link: https://www.econbiz.de/10012416751
Saved in:
Cover Image
A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 747-762
Persistent link: https://www.econbiz.de/10012294726
Saved in:
Cover Image
Exact algorithms for the minimum cost vertex blocker clique problem
Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Namayanja, … - In: Computers & operations research : and their … 103 (2019), pp. 296-309
Persistent link: https://www.econbiz.de/10011991152
Saved in:
Cover Image
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
Segundo, Pablo San; Furini, Fabio; Artieda, Jorge - In: Computers & operations research : and their … 110 (2019), pp. 18-33
Persistent link: https://www.econbiz.de/10012065068
Saved in:
Cover Image
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; … - In: European journal of operational research : EJOR 278 (2019) 1, pp. 76-90
Persistent link: https://www.econbiz.de/10012102594
Saved in:
  • 1
  • 2
  • 3
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...