Pages that link to "Item:Q1776956"

The following pages link to Improved results on the 0--1 multidimensional knapsack problem (Q1776956):

Displaying 50 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• Second-order cover inequalities (Q927162) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
• A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
• Algorithmic aspects for power-efficient hardware/software partitioning (Q1010046) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
• Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
• Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
• New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
• Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems (Q2453178) (← links)
• A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem (Q2798113) (← links)
• CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• Intelligent water drops algorithm (Q3526263) (← links)
• Modeling multiple plant sourcing decisions (Q3532786) (← links)
• (Q3570781) (← links)
• Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum (Q4201825) (← links)
• (Q5091235) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)