Pages that link to "Item:Q1357487"

The following pages link to The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487):

Displaying 15 items.

• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← 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)
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
• Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)