Solving the generalised assignment problem using polyhedral results
From MaRDI portal
Publication:1296797
DOI10.1016/S0377-2217(97)00054-4zbMATH Open0951.90008MaRDI QIDQ1296797FDOQ1296797
Authors: Zeger Degraeve, Jurgen Tistaert, Dirk Cattrysse 
Publication date: 14 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A survey of algorithms for the generalized assignment problem
- Solving Large-Scale Zero-One Linear Programming Problems
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- A branch and bound algorithm for the generalized assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Title not available (Why is that?)
- Heuristic algorithms for the multiple knapsack problem
- A set partitioning heuristic for the generalized assignment problem
- The Snow Disposal Assignment Problem
- A property of assignment type mixed integer linear programming problems
Cited In (9)
- 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
- Preprocessing rules for integer programming solutions to the generalised assignment problem
Uses Software
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)
