The following pages link to (Q5692642):
Displaying 12 items.
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Infeasible/feasible search trajectories and directional rounding in integer programming (Q930155) (← 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)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization (Q3509451) (← links)
- An adaptive memory programming method for risk logistics operations (Q4678215) (← links)