On the public citation graph

The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool

https://doi.org/10.1007/bf00247210
0 signed · 84 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800280107openalex-snapshot
Surrogate duality in a branch‐and‐bound procedure
inferredcites →https://doi.org/10.1007/978-1-4613-1361-8_25openalex-snapshot
Critical Event Tabu Search for Multidimensional Knapsack Problems
inferredcites →https://doi.org/10.1007/978-1-4613-1361-8_27openalex-snapshot
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferredcites →https://doi.org/10.1007/bf01588301openalex-snapshot
(1,k)-configurations and facets for packing problems
inferredcites →https://doi.org/10.1007/bf02022561openalex-snapshot
Dynamic tabu list management using the reverse elimination method
inferredcites →https://doi.org/10.1007/bf02241754openalex-snapshot
An algorithm for the solution of the 0–1 knapsack problem
inferredcites →https://doi.org/10.1007/bf02242185openalex-snapshot
A simulated annealing approach to the multiconstraint zero-one knapsack problem
inferredcites →https://doi.org/10.1007/bf02252196openalex-snapshot
Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problem
inferredcites →https://doi.org/10.1007/bf02591863openalex-snapshot
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
inferredcites →https://doi.org/10.1007/bf02592954openalex-snapshot
Lagrangean decomposition: A model yielding stronger lagrangean bounds
inferredcites →https://doi.org/10.1016/0166-218x(93)90044-oopenalex-snapshot
Efficient reformulation for 0–1 programs — methods and computational results
inferredcites →https://doi.org/10.1016/0166-218x(94)90208-9openalex-snapshot
An exact algorithm for the 0–1 collapsing knapsack problem
inferredcites →https://doi.org/10.1016/0166-218x(94)90209-7openalex-snapshot
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
inferredcites →https://doi.org/10.1016/0167-6377(90)90034-3openalex-snapshot
Coefficient reduction for knapsack-like constraints in 0–1 programs with variable upper bounds
inferredcites →https://doi.org/10.1016/0377-2217(78)90093-0openalex-snapshot
Zero-one programming with many variables and few constraints
inferredcites →https://doi.org/10.1016/0377-2217(84)90053-5openalex-snapshot
Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
inferredcites →https://doi.org/10.1016/0377-2217(86)90042-1openalex-snapshot
Heuristics and reduction methods for multiple constraints 0–1 linear programming problems
inferredcites →https://doi.org/10.1016/0377-2217(88)90176-2openalex-snapshot
Surrogate duality in a branch-and-bound procedure for integer programming
inferredcites →https://doi.org/10.1016/0377-2217(92)90085-nopenalex-snapshot
On tightening cover induced inequalities
inferredcites →https://doi.org/10.1016/0377-2217(93)90197-uopenalex-snapshot
An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem
inferredcites →https://doi.org/10.1051/ro/1987210403071openalex-snapshot
Lagrangean decomposition for integer programming : theory and applications
inferredcites →https://doi.org/10.1051/ro/1993270201691openalex-snapshot
Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
inferredcites →https://doi.org/10.1080/03155986.1994.11732253openalex-snapshot
Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
inferredcites →https://doi.org/10.1086/294081openalex-snapshot
Three Problems in Rationing Capital
inferredcites →https://doi.org/10.1111/j.1540-5915.1977.tb01074.xopenalex-snapshot
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
inferredcites →https://doi.org/10.1137/0127003openalex-snapshot
Constructive Duality in Integer Programming
inferredcites →https://doi.org/10.1145/321864.321873openalex-snapshot
Approximate Algorithms for the 0/1 Knapsack Problem
inferredcites →https://doi.org/10.1145/321906.321909openalex-snapshot
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
inferredcites →https://doi.org/10.1145/322077.322090openalex-snapshot
`` Strong '' NP-Completeness Results
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.6.4.445openalex-snapshot
Preprocessing and Probing Techniques for Mixed Integer Programming Problems
inferredcites →https://doi.org/10.1287/mnsc.13.9.736openalex-snapshot
Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects
inferredcites →https://doi.org/10.1287/mnsc.23.1.27openalex-snapshot
An Efficient Algorithm for the 0-1 Knapsack Problem
inferredcites →https://doi.org/10.1287/mnsc.34.5.633openalex-snapshot
A New Algorithm for the 0-1 Knapsack Problem
inferredcites →https://doi.org/10.1287/opre.13.6.879openalex-snapshot
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
inferredcites →https://doi.org/10.1287/opre.18.5.924openalex-snapshot
Surrogate Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.19.6.1374openalex-snapshot
Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
inferredcites →https://doi.org/10.1287/opre.23.3.434openalex-snapshot
Surrogate Constraint Duality in Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.28.5.1130openalex-snapshot
An Algorithm for Large Zero-One Knapsack Problems
inferredcites →https://doi.org/10.1287/opre.29.1.49openalex-snapshot
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferredcites →https://doi.org/10.2307/1907744openalex-snapshot
On the Solution of Discrete Programming Problems
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118600207.ch8openalex-snapshot
0–1 Knapsack Problems
inferred← citeshttps://doi.org/10.1002/9781119005353.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005353.ch8openalex-snapshot
0–1 Knapsack Problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_318openalex-snapshot
Multidimensional Knapsack Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-16054-7_9openalex-snapshot
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31137-6_6openalex-snapshot
Solving Multidimensional 0–1 Knapsack Problem with an Artificial Fish Swarm Algorithm
inferred← citeshttps://doi.org/10.1007/s10479-005-3448-8openalex-snapshot
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
inferred← citeshttps://doi.org/10.1007/s10852-015-9275-2openalex-snapshot
Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm
inferred← citeshttps://doi.org/10.1007/s10878-005-4105-5openalex-snapshot
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2003.11.005openalex-snapshot
An exact algorithm for the knapsack sharing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.05.017openalex-snapshot
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.013openalex-snapshot
Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.02.058openalex-snapshot
A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.05.033openalex-snapshot
A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.11.011openalex-snapshot
A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.037openalex-snapshot
A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
inferred← citeshttps://doi.org/10.1016/j.swevo.2013.09.002openalex-snapshot
Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00858-5openalex-snapshot
Global optimization and multi knapsack: A percolation algorithm
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00274-1openalex-snapshot
The multidimensional 0–1 knapsack problem: An overview
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00296-8openalex-snapshot
An efficient tabu search approach for the 0–1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1023/a:1009642405419openalex-snapshot
A Genetic Algorithm for the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1023/a:1011203002719openalex-snapshot
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
inferred← citeshttps://doi.org/10.1023/a:1013385216761openalex-snapshot
The Knapsack Sharing Problem: An Exact Algorithm
inferred← citeshttps://doi.org/10.1023/a:1019920507008openalex-snapshot
An Efficient Algorithm for the Knapsack Sharing Problem
inferred← citeshttps://doi.org/10.1051/ro:2001123openalex-snapshot
Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
inferred← citeshttps://doi.org/10.1080/00207160.2014.885020openalex-snapshot
Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
inferred← citeshttps://doi.org/10.1109/icetet.2008.163openalex-snapshot
A Socio-Cognitive Particle Swarm Optimization for Multi-Dimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1109/wsc.1999.823060openalex-snapshot
Input models for synthetic optimization problems
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00836.xopenalex-snapshot
Hybrid approaches for the two‐scenario max–min knapsack problem
inferred← citeshttps://doi.org/10.1145/324138.324175openalex-snapshot
Input models for synthetic optimization problems
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0330openalex-snapshot
Synthetic Optimization Problem Generation: Show Us the Correlations!
inferred← citeshttps://doi.org/10.1287/mnsc.46.2.302.11930openalex-snapshot
The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
inferred← citeshttps://doi.org/10.1287/opre.51.5.826.16757openalex-snapshot
An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
inferred← citeshttps://doi.org/10.1504/ijbic.2016.078641openalex-snapshot
A self-adaptive harmony search combined with a stochastic local search for the 0-1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1504/ijise.2008.018231openalex-snapshot
Exploiting empirical knowledge for bi-dimensional knapsack problem heuristics
inferred← citeshttps://doi.org/10.19030/ijmis.v17i1.7589openalex-snapshot
Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.23919/icitst.2017.8356419openalex-snapshot
intel-LEACH: An optimal framework for node selection using dynamic clustering for wireless sensor networks
inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.926523openalex-snapshot
Algoritmos para o problema do mapeamento de redes virtuais
inferred← citeshttps://doi.org/10.70675/77bb03b1z6f68z47dbz931cze0d45ddac1f0openalex-snapshot
Heuristic methods for solving knapsack type problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.