Generalized cover facet inequalities for the generalized assignment problem

DOI10.1080/02331930801951124MaRDI QIDQ3553764zbMATH OpenOpenAlexFDO

Authors Elsie Sterbin Gottlieb

Publication date 21 April 2010

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930801951124

zbMATH Keywords

generalized assignment problemspecial ordered setgeneralized coverKnapsack problemfacet inequalities

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• The generalized assignment problem: Valid inequalities and facets
• Solving the generalised assignment problem using polyhedral results
• (1,k)-configuration facets for the generalized assignment problem
• A family of inequalities for the generalized assignment polytope
• A Branch-and-Price Algorithm for the Generalized Assignment Problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• (1,k)-configuration facets for the generalized assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A family of inequalities for the generalized assignment polytope
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Faces for a linear inequality in 0–1 variables
• Lifting the facets of zero–one polytopes
• Modeling Facility Location Problems as Generalized Assignment Problems
• On the facial structure of set packing polyhedra
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving the generalised assignment problem using polyhedral results
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Technical Note—A Note on Zero-One Programming
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• The generalized assignment problem: Valid inequalities and facets
• Valid Inequalities and Superadditivity for 0–1 Integer Programs

Cited in

(4)

• (1,k)-configuration facets for the generalized assignment problem
• A generalized assignment problem with special ordered sets: a polyhedral approach.
• The generalized assignment problem: Valid inequalities and facets
• A family of inequalities for the generalized assignment polytope

This page was built for publication: Generalized cover facet inequalities for the generalized assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553764)