A generalized assignment problem with special ordered sets: a polyhedral approach.

DOI10.1007/S101070000185MaRDI QIDQ5926336zbMATH OpenFDO

Authors I. R. jun. de Farias, Ellis L. Johnson, G. L. Nemhauser

Publication date 2 July 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S101070000185

zbMATH Keywords

branch-and-cut schemegeneralized assignment problemproduction scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The generalized assignment problem: Valid inequalities and facets
• A family of inequalities for the generalized assignment polytope
• Generalized cover facet inequalities for the generalized assignment problem
• (1,k)-configuration facets for the generalized assignment problem
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets

Cited in

(18)

• S3 sets. An extension of the Beale-Tomlin special ordered sets
• Models for representing piecewise linear cost functions
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Solving linear programs with complementarity constraints using branch-and-cut
• A polyhedral study of the semi-continuous knapsack problem
• An ejection chain approach for the generalized assignment problem
• Mixed integer models for the stationary case of gas network optimization
• Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• A family of inequalities for the generalized assignment polytope
• A Survey of the Generalized Assignment Problem and Its Applications
• Polylithic modeling and solution approaches using algebraic modeling systems
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
• (1,k)-configuration facets for the generalized assignment problem
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem

This page was built for publication: A generalized assignment problem with special ordered sets: a polyhedral approach.

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