A generalized assignment problem with special ordered sets: a polyhedral approach.
From MaRDI portal
Publication:5926336
DOI10.1007/s101070000185zbMath1060.90081MaRDI QIDQ5926336
Ellis L. Johnson, Ismael Regis jun. de Farias, Nemhauser, George I.
Publication date: 2 July 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
An LP-based heuristic procedure for the generalized assignment problem with special ordered sets ⋮ The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ Models for representing piecewise linear cost functions ⋮ A special ordered set approach for optimizing a discontinuous separable piecewise linear function ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ A family of inequalities for the generalized assignment polytope ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations ⋮ An ejection chain approach for the generalized assignment problem ⋮ Mixed integer models for the stationary case of gas network optimization
