Heuristics and reduction methods for multiple constraints 0-1 linear programming problems

DOI10.1016/0377-2217(86)90042-1zbMath0579.90066OpenAlexW1970753980MaRDI QIDQ1067997

Arnaud Fréville, Gérard Plateau

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90042-1

zbMATH Keywords

reductionlower boundcomputational resultsgreedy algorithmscomparative studyheuristic methodsmultiple inequality constraints 0-1 linear programmingsurrogate relaxations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09)

Related Items (21)

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ A simulated annealing approach to the multiconstraint zero-one knapsack problem ⋮ A binary-rounding heuristic for multi-period variable-task-duration assignment problems ⋮ Heuristic methods for evolutionary computation techniques ⋮ Matheuristics: survey and synthesis ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ A production planning problem in FMS ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights ⋮ The case for strategic oscillation ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List ⋮ Using fuzzy numbers in knapsack problems ⋮ A Simulated Annealing Algorithm for General Zero-One Programming Problems ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ Heuristic methods and applications: A categorized survey ⋮ A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• Unnamed Item
• An algorithm for the solution of the 0-1 knapsack problem
• Heuristic improvement methods: How should starting solutions be chosen?
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Pivot and Complement–A Heuristic for 0-1 Programming
• Calculating surrogate constraints
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Enumerative Methods in Integer Programming
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• An Approach to Solving Linear Discrete Optimization Problems
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems