Pages that link to "Item:Q1099588"
From MaRDI portal
The following pages link to A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588):
Displaying 33 items.
- Global optimization of statistical functions with simulated annealing (Q59975) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- A new hybrid method for solving global optimization problem (Q426339) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Profit margin oriented course scheduling at Lufthansa Technical Training Ltd. (Q1387946) (← links)
- Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- Dynamic tabu list management using the reverse elimination method (Q2366993) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A Simulated Annealing Algorithm for General Zero-One Programming Problems (Q3360004) (← links)
- Simulated annealing: An initial application in econometrics (Q4018055) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- Probabilistic and deterministic local search for solving the binary multiknapsack problem (Q4836763) (← links)
- An efficient algorithm to allocate shelf space (Q5937352) (← links)
