Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
type: Item
instance of: scholarly article
title: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
zbMATH Open document ID: 0579.90066
DOI: 10.1016/0377-2217(86)90042-1
published in: European Journal of Operational Research
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3928720
zbMATH Keywords: multiple inequality constraints 0-1 linear programming
zbMATH Keywords: greedy algorithms
zbMATH Keywords: lower bound
zbMATH Keywords: surrogate relaxations
zbMATH Keywords: comparative study
zbMATH Keywords: heuristic methods
zbMATH Keywords: reduction
zbMATH Keywords: computational results
author: Arnaud Fréville
author: Gérard Plateau
MaRDI profile type: Publication
full work available at URL: 0377-2217(86)90042-1
OpenAlex ID: W1970753980
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: Q4133397
cites work: Calculating surrogate constraints
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior
cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
cites work: Heuristic improvement methods: How should starting solutions be chosen?
cites work: An Approach to Solving Linear Discrete Optimization Problems
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Enumerative Methods in Integer Programming
cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
description: scientific article; zbMATH DE number 3928720