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
Exact Max-SAT solvers for over...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Branch and bound
Mathematical programming
3
Mathematische Optimierung
3
Scheduling problem
3
Scheduling-Verfahren
3
Theorie
3
Theory
3
Branch and Bound
2
Branch-and-Bound
2
Algorithm
1
Algorithmus
1
Branch-and-bound
1
Branching ordering
1
Combinatorial optimization
1
Exact and heuristic solvers
1
Heuristics
1
Heuristik
1
Incremental MaxSAT Reasoning
1
Longest common subsequence
1
Maximum clique problem
1
Maximum weight clique problem
1
Transformation to maximum clique
1
Upper bound
1
Weight cover
1
more ...
less ...
Online availability
All
Undetermined
1
Type of publication
All
Article
1
Type of publication (narrower categories)
All
Article in journal
1
Aufsatz in Zeitschrift
1
Language
All
English
1
Author
All
Jiang, Hua
1
Li, Chu-Min
1
Li, Yu
1
Liu, Yanli
1
Manyà, Felip
1
Published in...
All
European journal of operational research : EJOR
1
Source
All
ECONIS (ZBW)
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
A new upper bound for the maximum weight clique problem
Li, Chu-Min
;
Liu, Yanli
;
Jiang, Hua
;
Manyà, Felip
;
Li, Yu
- In:
European journal of operational research : EJOR
270
(
2018
)
1
,
pp. 66-77
Persistent link: https://www.econbiz.de/10011868925
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
