Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations

DOI10.1287/ijoc.2016.0700zbMath1348.90392OpenAlexW2472427375MaRDI QIDQ2830960

Mohamed Haouari, Tulay Flamand, Ahmed F. Ghoniem

Publication date: 1 November 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2016.0700

zbMATH Keywords

column generationmixed-integer programmingbranch and pricegeneralized assignment problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (3)

Store-wide space planning balancing Impulse and convenience ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ Retail shelf space planning problems: a comprehensive review and classification framework

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Assignment problems: a golden anniversary survey
• Shelf-space allocation of national and private brands
• Complementary column generation and bounding approaches for set partitioning formulations
• A survey of algorithms for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations
• A Branch-and-Price Algorithm for the Generalized Assignment Problem

This page was built for publication: Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations