CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
1 research outputs found
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
Author
A Przybylski
A Przybylski
+33Â more
A Thesen
Anthony Przybylski
Audrey Cerqueus
B Gavish
C Bazgan
C Bazgan
DE Goldberg
E Page
EL Ulungu
F Glover
F Sourd
Frédéric Saubion
G Mavrotas
H Kellerer
JR Figueira
K Florios
M Ehrgott
M Ehrgott
M Ehrgott
M Visée
ME Captivo
N Cesa-Bianchi
P Auer
PJ Kolesar
S Martello
S Martello
W Shih
W Zhang
X Gandibleux
Xavier Gandibleux
Y Hamadi
YP Aneja
Ă– Ă–zpeynirci
Publication venue
'Springer Science and Business Media LLC'
Publication date
Field of study
No full text
Crossref