A new extended formulation of the generalized assignment problem and some associated valid inequalities
From MaRDI portal
Publication:2009013
DOI10.1016/j.dam.2019.08.015zbMath1433.90082OpenAlexW2973063335MaRDI QIDQ2009013
Publication date: 27 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.015
Related Items (1)
Cites Work
- The generalized assignment problem: Valid inequalities and facets
- (1,k)-configuration facets for the generalized assignment problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- A survey of algorithms for the generalized assignment problem
- Solving the generalised assignment problem using polyhedral results
- A set partitioning heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- (1,k)-configurations and facets for packing problems
- A branch and bound algorithm for the generalized assignment problem
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
This page was built for publication: A new extended formulation of the generalized assignment problem and some associated valid inequalities
