Logic cuts for multilevel generalized assignment problems.
From MaRDI portal
Publication:1406973
DOI10.1016/S0377-2217(02)00576-3zbMath1033.90066MaRDI QIDQ1406973
Manuel Laguna, Maria A. Osorio
Publication date: 7 September 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
An implementation of exact knapsack separation, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, A Survey of the Generalized Assignment Problem and Its Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating cuts in integer programming with families of special ordered sets
- Representability in mixed integer programming. I: Characterization results
- Relaxation heuristics for a generalized assignment problem
- Logic cuts for processing networks with fixed charges
- A set partitioning heuristic for the generalized assignment problem
- Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
- Generalized resolution for 0--1 linear inequalities
- A genetic algorithm for the generalised assignment problem
- Tabu search for the multilevel generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- Mixed logical-linear programming
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
