Solving the generalised assignment problem using polyhedral results

DOI10.1016/S0377-2217(97)00054-4MaRDI QIDQ1296797zbMATH OpenFDO

Authors Zeger Degraeve, Jurgen Tistaert, Dirk Cattrysse

Publication date 14 November 1999

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

zbMATH Keywords

decompositioninteger programmingbranch-and-boundgeneralized assignment problemknapsack polytope

Mathematics Subject Classification ID

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

Recommendations

• Solving the generalized assignment problem: an optimizing and heuristic approach
• The generalized assignment problem
• Generalized cover facet inequalities for the generalized assignment problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• A set partitioning heuristic for the generalized assignment problem

Cites work

• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A set partitioning heuristic for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Facet of regular 0–1 polytopes
• Facets of the Knapsack Polytope From Minimal Covers
• Facets of the knapsack polytope
• Heuristic algorithms for the multiple knapsack problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving Large-Scale Zero-One Linear Programming Problems
• The Snow Disposal Assignment Problem

Cited in

(9)

• Preprocessing rules for integer programming solutions to the generalised assignment problem
• Generalized cover facet inequalities for the generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• A computational study of exact knapsack separation for the generalized assignment problem
• An ejection chain approach for the generalized assignment problem
• A new extended formulation of the generalized assignment problem and some associated valid inequalities
• Reducing the elastic generalized assignment problem to the standard generalized assignment problem
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: Solving the generalised assignment problem using polyhedral results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296797)