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
Retain my current filters
~subject:"Branch and Bound"
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
The maximum clique interdictio...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Branch and Bound
Mathematical programming
65
Mathematische Optimierung
65
Theorie
61
Theory
61
Integer programming
30
Algorithm
29
Algorithmus
29
Ganzzahlige Optimierung
28
Combinatorial optimization
20
Decomposition method
17
Dekompositionsverfahren
17
Scheduling problem
17
Scheduling-Verfahren
17
OECD-Staaten
14
OECD countries
13
Operations Research
13
Operations research
13
Branch-and-Bound
10
Heuristics
10
Heuristik
10
Benders decomposition
9
Betriebliche Standortwahl
9
Firm location choice
9
Tourenplanung
9
Vehicle routing problem
9
Branch-and-cut
8
Location theory
8
Standorttheorie
8
Arbeitsmarkt
7
Labour market
7
Packing problem
7
Packproblem
7
Column generation
6
Arbeitsmobilität
5
Einkommensverteilung
5
Income distribution
5
Labour mobility
5
Telecommunications
5
branch and cut
5
more ...
less ...
Online availability
All
Undetermined
8
Type of publication
All
Article
10
Type of publication (narrower categories)
All
Article in journal
10
Aufsatz in Zeitschrift
10
Language
All
English
10
Author
All
Furini, Fabio
6
San Segundo, Pablo
5
Ljubić, Ivana
3
Coniglio, Stefano
2
Pardalos, Panos M.
2
Sinnl, Markus
2
Artieda, Jorge
1
Goycoolea, Marcos
1
Iori, Manuel
1
Jiménez, Agustín
1
Leitner, Markus
1
Lopez, Alvaro
1
Luipersbeck, Martin
1
Martello, Silvano
1
Monaci, Michele
1
Rodríguez-Losada, Diego
1
Segundo, Pablo San
1
Traversi, Emiliano
1
Yagiura, Mutsunori
1
Álvarez, David
1
Álvarez-Miranda, Eduardo
1
more ...
less ...
Published in...
All
Computers & operations research : and their applications to problems of world concern ; an international journal
4
European journal of operational research : EJOR
4
INFORMS journal on computing : JOC
2
Source
All
ECONIS (ZBW)
10
Showing
1
-
10
of
10
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
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:
2
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:
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
An exact bit-parallel algorithm for the maximum clique problem
San Segundo, Pablo
;
Rodríguez-Losada, Diego
;
Jiménez, …
- In:
Computers & operations research : and their …
38
(
2011
)
2
,
pp. 571-581
Persistent link: https://www.econbiz.de/10008669900
Saved in:
5
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo
;
Lopez, Alvaro
;
Pardalos, Panos M.
- In:
Computers & operations research : and their …
66
(
2016
),
pp. 81-94
Persistent link: https://www.econbiz.de/10011428989
Saved in:
6
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:
7
Exact approaches for the knapsack problem with setups
Furini, Fabio
;
Monaci, Michele
;
Traversi, Emiliano
- In:
Computers & operations research : and their …
90
(
2018
),
pp. 208-220
Persistent link: https://www.econbiz.de/10011775328
Saved in:
8
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio
;
Iori, Manuel
;
Martello, Silvano
; …
- In:
INFORMS journal on computing : JOC
27
(
2015
)
2
,
pp. 392-405
Persistent link: https://www.econbiz.de/10011291290
Saved in:
9
A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
Leitner, Markus
;
Ljubić, Ivana
;
Luipersbeck, Martin
; …
- In:
INFORMS journal on computing : JOC
30
(
2018
)
2
,
pp. 402-420
Persistent link: https://www.econbiz.de/10011878363
Saved in:
10
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Álvarez-Miranda, Eduardo
;
Goycoolea, Marcos
;
Ljubić, Ivana
- In:
European journal of operational research : EJOR
289
(
2021
)
3
,
pp. 1013-1029
Persistent link: https://www.econbiz.de/10012433323
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
