Pages that link to "Item:Q1861918"

The following pages link to Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918):

Displaying 25 items.

• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
• Second-order cover inequalities (Q927162) (← links)
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
• Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
• A trust branching path heuristic for zero-one programming (Q1014935) (← 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)
• Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300) (← links)
• Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
• A dual heuristic for mixed integer programming (Q1785392) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
• (Q4321918) (← links)