A family of inequalities for the generalized assignment polytope

DOI10.1016/S0167-6377(01)00086-4zbMath0981.90050MaRDI QIDQ5949919

Nemhauser, George I., Ismael Regis jun. de Farias

Publication date: 5 December 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

integer programmingbranch-and-cutgeneralized assignment polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (6)

The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem ⋮ The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Models for representing piecewise linear cost functions ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ A computational study of exact knapsack separation for the generalized assignment problem

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized assignment problem: Valid inequalities and facets
• (1,k)-configuration facets for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• MINTO, a Mixed INTeger Optimizer
• A branch and bound algorithm for the generalized assignment problem
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A generalized assignment problem with special ordered sets: a polyhedral approach.

This page was built for publication: A family of inequalities for the generalized assignment polytope