A simulated annealing approach to the multiconstraint zero-one knapsack problem
From MaRDI portal
Publication:1099588
DOI10.1007/BF02242185zbMath0638.65053MaRDI QIDQ1099588
Publication date: 1988
Published in: Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Dynamic tabu list management using the reverse elimination method, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, An improved typology of cutting and packing problems, A RNN-based hyper-heuristic for combinatorial problems, Probabilistic and deterministic local search for solving the binary multiknapsack problem, Metaheuristics: A bibliography, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, Simulated annealing: An initial application in econometrics, A Modified Binary Particle Swarm Optimization for Knapsack Problems, Profit margin oriented course scheduling at Lufthansa Technical Training Ltd., Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, A heuristic algorithm for resource allocation/reallocation problem, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, A new hybrid method for solving global optimization problem, Methods for the one-dimensional space allocation problem, Global optimization and multi knapsack: a percolation algorithm., The multidimensional 0-1 knapsack problem: an overview., Essential particle swarm optimization queen with tabu search for MKP resolution, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem, Global optimization of statistical functions with simulated annealing, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, An efficient algorithm to allocate shelf space, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Kernel search: a general heuristic for the multi-dimensional knapsack problem, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Improved results on the 0--1 multidimensional knapsack problem, A Simulated Annealing Algorithm for General Zero-One Programming Problems, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Euclidean matching problems and the metropolis algorithm
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- An Algorithm for Large Zero-One Knapsack Problems
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
