//--> //--> //--> //-->
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:"Combinatorial optimization"
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
A new branch-and-bound algorit...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Combinatorial optimization
Theorie
30
Theory
30
Mathematical programming
29
Mathematische Optimierung
29
Algorithm
21
Algorithmus
21
Scheduling problem
13
Scheduling-Verfahren
13
Ganzzahlige Optimierung
11
Integer programming
11
Branch and Bound
7
Branch-and-Bound
7
Heuristics
7
Heuristik
7
Packing problem
7
Packproblem
7
Branch-and-bound
4
Column generation
4
Decomposition method
4
Dekompositionsverfahren
4
Dynamic programming
4
Dynamische Optimierung
4
Maximum clique
4
Operations Research
4
Operations research
4
Graph theory
3
Graphentheorie
3
Tourenplanung
3
Vehicle routing problem
3
Approximate coloring
2
Bitstring
2
Branch-and-bound algorithm
2
Computational experiments
2
Exact algorithm
2
Global search
2
Integer linear programming
2
Interdiction problems
2
Lagrangian relaxation
2
Linear programming
2
more ...
less ...
Online availability
All
Undetermined
10
Type of publication
All
Article
12
Type of publication (narrower categories)
All
Article in journal
12
Aufsatz in Zeitschrift
12
Language
All
English
12
Author
All
Furini, Fabio
9
San Segundo, Pablo
9
Ljubić, Ivana
5
Coniglio, Stefano
2
Artieda, Jorge
1
Batsyn, Mikhail
1
Carvalho, José Manuel Vasconcelos Valério de
1
Cordeau, Jean-François
1
León, Rafael
1
Martin, Sébastien
1
Martinovic, John
1
Nikolaev, Alexey
1
Pardalos, Panos M.
1
Sinnl, Markus
1
Strasdat, Nico
1
Strash, Darren
1
Tapia, Cristobal
1
Zhao, Yanlu
1
Álvarez, David
1
more ...
less ...
Published in...
All
European journal of operational research : EJOR
9
Computers & operations research : and their applications to problems of world concern ; an international journal
3
Source
All
ECONIS (ZBW)
12
Showing
1
-
10
of
12
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Efficiently enumerating all maximal cliques with bit-parallelism
San Segundo, Pablo
;
Artieda, Jorge
;
Strash, Darren
- In:
Computers & operations research : and their …
92
(
2018
),
pp. 37-46
Persistent link: https://www.econbiz.de/10011803767
Saved in:
2
The maximum clique interdiction problem
Furini, Fabio
;
Ljubić, Ivana
;
Martin, Sébastien
;
San …
- In:
European journal of operational research : EJOR
277
(
2019
)
1
,
pp. 112-127
Persistent link: https://www.econbiz.de/10012014820
Saved in:
3
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:
4
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:
5
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio
;
Ljubić, Ivana
;
San Segundo, Pablo
; …
- In:
European journal of operational research : EJOR
294
(
2021
)
1
,
pp. 54-69
Persistent link: https://www.econbiz.de/10012591320
Saved in:
6
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:
7
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
San Segundo, Pablo
;
Furini, Fabio
;
León, Rafael
- In:
European journal of operational research : EJOR
299
(
2022
)
2
,
pp. 448-467
Persistent link: https://www.econbiz.de/10013207115
Saved in:
8
Relaxed approximate coloring in exact maximum clique search
San Segundo, Pablo
;
Tapia, Cristobal
- In:
Computers & operations research : and their …
44
(
2014
),
pp. 185-192
Persistent link: https://www.econbiz.de/10010241343
Saved in:
9
Infra-chromatic bound for exact maximum clique search
San Segundo, Pablo
;
Nikolaev, Alexey
;
Batsyn, Mikhail
- In:
Computers & operations research : and their …
64
(
2015
),
pp. 293-303
Persistent link: https://www.econbiz.de/10011373432
Saved in:
10
Benders decomposition for very large scale partial set covering and maximal covering location problems
Cordeau, Jean-François
;
Furini, Fabio
;
Ljubić, Ivana
- In:
European journal of operational research : EJOR
275
(
2019
)
3
,
pp. 882-896
Persistent link: https://www.econbiz.de/10011993607
Saved in:
1
2
Next
Last
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->