Generalized cover facet inequalities for the generalized assignment problem
From MaRDI portal
Publication:3553764
DOI10.1080/02331930801951124zbMath1184.90087MaRDI QIDQ3553764
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930801951124
generalized assignment problem; Knapsack problem; special ordered set; generalized cover; facet inequalities
Cites Work
- Unnamed Item
- The generalized assignment problem: Valid inequalities and facets
- (1,k)-configuration facets for the generalized assignment problem
- Solving the generalised assignment problem using polyhedral results
- A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Lifting the facets of zero–one polytopes
- A branch and bound algorithm for the generalized assignment problem
- Technical Note—A Note on Zero-One Programming
- Faces for a linear inequality in 0–1 variables
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- Modeling Facility Location Problems as Generalized Assignment Problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- On the facial structure of set packing polyhedra
- A family of inequalities for the generalized assignment polytope
