New convergent heuristics for 0-1 mixed integer programming

DOI10.1016/j.ejor.2008.01.044zbMath1161.90448OpenAlexW2147414046MaRDI QIDQ2378374

Saïd Hanafi, Christophe Wilbaut

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.044

zbMATH Keywords

relaxationheuristicmultidimensional knapsack problem0-1 mixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (21)

A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ Model-based automatic neighborhood design by unsupervised learning ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities ⋮ Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Minimum cost delivery of multi-item orders in e-commerce logistics ⋮ Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Alternating control tree search for knapsack/covering problems ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Memory and Learning in Metaheuristics

Uses Software

• OR-Library
• MIPTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• A survey of very large-scale neighborhood search techniques
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Exploiting nested inequalities and surrogate constraints
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
• Zero-one programming with many variables and few constraints
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• Local branching
• The multidimensional 0-1 knapsack problem: an overview.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Improved results on the 0--1 multidimensional knapsack problem
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Variable neighborhood search and local branching
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Canonical Cuts on the Unit Hypercube

This page was built for publication: New convergent heuristics for 0-1 mixed integer programming