Pages that link to "Item:Q817185"

The following pages link to The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185):

Displaying 34 items.

• 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)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
• Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
• Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← 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)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• A novel multi-objective approach for link selection in aeronautical telecommunication networks (Q2108796) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← 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)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints (Q2806828) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
• A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)