Solving the generalised assignment problem using polyhedral results

DOI10.1016/S0377-2217(97)00054-4zbMath0951.90008MaRDI QIDQ1296797

Jurgen Tistaert, Zeger Degraeve, Dirk G. Cattrysse

Publication date: 14 November 1999

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

zbMATH Keywords

integer programmingdecompositiongeneralized assignment problembranch-and-boundknapsack polytope

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, A Survey of the Generalized Assignment Problem and Its Applications, Generalized cover facet inequalities for the generalized assignment problem, A new extended formulation of the generalized assignment problem and some associated valid inequalities, An ejection chain approach for the generalized assignment problem, Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Heuristic algorithms for the multiple knapsack problem
• A survey of algorithms for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Solving Large-Scale Zero-One Linear Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A branch and bound algorithm for the generalized assignment problem
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Facets of the Knapsack Polytope From Minimal Covers
• The Snow Disposal Assignment Problem