//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
accessRights:"restricted"
~accessRights:"free"
~person:"San Segundo, Pablo"
~person:"Savelsbergh, Martin W. P."
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
Search: subject_exact:"Branch-and-Bound"
Narrow search
Delete all filters
| 4 applied filters
Year of publication
From:
To:
Subject
All
Mathematical programming
8
Mathematische Optimierung
8
Theorie
8
Theory
8
Algorithm
5
Algorithmus
5
Branch and Bound
5
Branch-and-Bound
5
Scheduling problem
5
Scheduling-Verfahren
5
Combinatorial optimization
4
Ganzzahlige Optimierung
4
Integer programming
4
Branch-and-bound
3
Operations Research
3
Operations research
3
Bitstring
2
Branch and bound
2
Branch-and-bound algorithm
2
0-1 knapsack problem
1
Approximation algorithm
1
Binary optimization
1
Branch office
1
Coal
1
Computational complexity
1
Decomposition method
1
Dekompositionsverfahren
1
Exact algorithm
1
Filiale
1
Graph theory
1
Graphentheorie
1
Knapsack Problem with Conflicts
1
Kohle
1
Learning process
1
Lernprozess
1
Machine learning
1
Massive
1
Maximal clique
1
Maximum Weighted Clique Problem
1
Maximum clique
1
more ...
less ...
Online availability
All
Undetermined
Free
Type of publication
All
Article
9
Type of publication (narrower categories)
All
Article in journal
9
Aufsatz in Zeitschrift
9
Language
All
English
9
Author
All
San Segundo, Pablo
Savelsbergh, Martin W. P.
Sprecher, Arno
17
Drexl, Andreas
15
Leus, Roel
8
Scholl, Armin
8
Briskorn, Dirk
7
Demeulemeester, Erik
7
Pereira, Jordi
6
Walter, Rico
6
Chu, Feng
5
Furini, Fabio
5
Kowalczyk, Daniel
5
Lim, Andrew
5
Brusco, Michael
4
Davari, Morteza
4
Hartmann, Sönke
4
Kim, Hyun-Jung
4
Parragh, Sophie N.
4
Qin, Hu
4
Toth, Paolo
4
Tricoire, Fabien
4
Wang, Shijin
4
Watermeyer, Kai
4
Wu, Chin-Chia
4
Zimmermann, Jürgen
4
Altınel, İ. Kuban
3
Bai, Danyu
3
Boland, Natashia
3
Boysen, Nils
3
Chu, Chengbin
3
Coniglio, Stefano
3
Dolgui, Alexandre
3
Forget, Nicolas
3
Gazdag-Tóth, Boglárka
3
Gendron, Bernard
3
Hnaien, Faicel
3
Klein, Robert
3
Kucukkoc, Ibrahim
3
Lev, Benjamin
3
more ...
less ...
Published in...
All
European journal of operational research : EJOR
4
Computers & operations research : and their applications to problems of world concern ; an international journal
2
INFORMS journal on computing : JOC
1
Journal of scheduling
1
Operations research
1
Source
All
ECONIS (ZBW)
9
Showing
1
-
9
of
9
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu
;
Boland, Natashia
;
Dilkina, Bistra
; …
- In:
European journal of operational research : EJOR
301
(
2022
)
3
,
pp. 828-840
Persistent link: https://www.econbiz.de/10013267791
Saved in:
2
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:
3
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu
;
Boland, Natashia
;
Savelsbergh, Martin W. P.
- In:
INFORMS journal on computing : JOC
33
(
2021
)
4
,
pp. 1354-1367
Persistent link: https://www.econbiz.de/10012796862
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 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:
6
Decomposition branching for mixed integer programming
Yıldız, Barış
;
Boland, Natashia
;
Savelsbergh, …
- In:
Operations research
70
(
2022
)
3
,
pp. 1854-1872
Persistent link: https://www.econbiz.de/10013366273
Saved in:
7
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:
8
Scheduling reclaimers serving a stock pad at a coal terminal
Kalinowski, Thomas
;
Kapoor, Reena
;
Savelsbergh, Martin W. P.
- In:
Journal of scheduling
20
(
2017
)
1
,
pp. 85-101
Persistent link: https://www.econbiz.de/10011672019
Saved in:
9
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:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->