scientific article; zbMATH DE number 2209664

Publication date: 28 September 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ New convergent heuristics for 0-1 mixed integer programming ⋮ Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ Infeasible/feasible search trajectories and directional rounding in integer programming ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

This page was built for publication: