ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
4
views
13
references
Top references
cited by
22
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,845
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
New trends in exact algorithms for the 0–1 knapsack problem
Author(s):
Silvano Martello
,
David Pisinger
,
Paolo Toth
Publication date
Created:
June 2000
Publication date
(Print):
June 2000
Journal:
European Journal of Operational Research
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
General Collective Intelligence Platforms and Hive Minds
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
Discrete-Variable Extremum Problems
George Dantzig
(1957)
0
comments
Cited
90
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Computing Partitions with Applications to the Knapsack Problem
Ellis Horowitz
,
Sartaj Sahni
(1974)
0
comments
Cited
55
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An Algorithm for Large Zero-One Knapsack Problems
Eitan Zemel
,
Egon Balas
(1980)
0
comments
Cited
37
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
European Journal of Operational Research
Abbreviated Title:
European Journal of Operational Research
Publisher:
Elsevier BV
ISSN (Print):
03772217
Publication date Created:
June 2000
Publication date (Print):
June 2000
Volume
: 123
Issue
: 2
Pages
: 325-332
Article
DOI:
10.1016/S0377-2217(99)00260-X
SO-VID:
1a802b2b-7d72-49cc-9175-16fb494a7c27
Copyright ©
© 2000
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,845
Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems
Authors:
Hiroyuki Sato
,
Hernán E. Aguirre
,
Kiyoshi Tanaka
Blockchain-based Knapsack System for Security and Privacy Preserving to Medical Data
Authors:
Ranjith J
,
Mahantesh K
A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem.
Authors:
G. X.Zhang
See all similar
Cited by
22
An improved typology of cutting and packing problems
Authors:
Holger Schumann
,
Gerhard Wäscher
,
Heike Haußner
The multidimensional 0–1 knapsack problem: An overview
Authors:
Arnaud Fréville
Where are the hard knapsack problems?
Authors:
David Pisinger
See all cited by
Most referenced authors
37
P Toth
S Sahni
E Horowitz
See all reference authors