Pages that link to "Item:Q2378374"

The following pages link to New convergent heuristics for 0-1 mixed integer programming (Q2378374):

Displaying 21 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• Model-based automatic neighborhood design by unsupervised learning (Q337347) (← 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)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← 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)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← 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)
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
• Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization (Q3509451) (← links)
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)