A simulated annealing approach to the multiconstraint zero-one knapsack problem
- 1 March 1988
- journal article
- Published by Springer Nature in Computing
- Vol. 40 (1) , 1-8
- https://doi.org/10.1007/bf02242185
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Reconstruction of polycrystalline structures: a new application of combinatorial optimizationComputing, 1987
- Probabilistic exchange algorithms and Euclidean traveling salesman problemsOR Spectrum, 1986
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approachEuropean Journal of Operational Research, 1986
- Heuristics and reduction methods for multiple constraints 0–1 linear programming problemsEuropean Journal of Operational Research, 1986
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- A thermodynamically motivated simulation procedure for combinatorial optimization problemsEuropean Journal of Operational Research, 1984
- A heuristic algorithm for the multidimensional zero-one knapsack problemEuropean Journal of Operational Research, 1984
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack ProblemJournal of the Operational Research Society, 1979
- Three Problems in Rationing CapitalThe Journal of Business, 1955