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
MIP models for connected facil...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Branch and Bound
Mathematical programming
38
Mathematische Optimierung
38
Theorie
30
Theory
30
Integer programming
22
Ganzzahlige Optimierung
20
Decomposition method
16
Dekompositionsverfahren
16
Combinatorial optimization
14
Algorithm
10
Algorithmus
10
Benders decomposition
10
Betriebliche Standortwahl
9
Firm location choice
9
Branch-and-cut
8
Operations Research
8
Operations research
8
Location theory
7
Scheduling problem
7
Scheduling-Verfahren
7
Standorttheorie
7
Tourenplanung
7
Vehicle routing problem
7
Telecommunications
5
Stochastic process
4
Stochastischer Prozess
4
Telekommunikation
4
branch and cut
4
Branch-and-Bound
3
Graph theory
3
Graphentheorie
3
Heuristics
3
Heuristik
3
OR in telecommunications
3
Social network
3
Soziales Netzwerk
3
generalized Benders decomposition
3
mixed-integer programming
3
Bilevel optimization
2
more ...
less ...
Online availability
All
Undetermined
3
Type of publication
All
Article
3
Type of publication (narrower categories)
All
Article in journal
3
Aufsatz in Zeitschrift
3
Language
All
English
3
Author
All
Ljubić, Ivana
3
Sinnl, Markus
2
Coniglio, Stefano
1
Furini, Fabio
1
Goycoolea, Marcos
1
Leitner, Markus
1
Luipersbeck, Martin
1
San Segundo, Pablo
1
Álvarez-Miranda, Eduardo
1
more ...
less ...
Published in...
All
European journal of operational research : EJOR
2
INFORMS journal on computing : JOC
1
Source
All
ECONIS (ZBW)
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
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:
2
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:
3
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...
