scientific article; zbMATH DE number 4181140

MaRDI QIDQ3204330zbMATH OpenFDO

Authors Ronny Aboudi, G. L. Nemhauser

Publication date 1990

zbMATH Keywords

assignmentsbranch-and- boundstrong cutting-planestrong valid inequalities

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• A facet generation and relaxation technique applied to an assignment problem with side constraints
• Some Facets for an Assignment Problem with Side Constraints
• A computational study of a cutting plane algorithm for university course timetabling
• A truncated exponential algorithm for the lightly constrained assignment problem
• The singly constrained assignment problem: An AP basis algorithm

Cited in

(3)

• Scheduling jobs of equal length: Complexity, facets and computational results
• Assignment problem with conflicts
• A facet generation and relaxation technique applied to an assignment problem with side constraints

This page was built for publication:

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