scientific article; zbMATH DE number 30946

zbMATH Open0739.90044MaRDI QIDQ3987192FDOQ3987192

Authors: Atidel Hadj-Alouane, Katta G. Murty 

Publication date: 28 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Two kinds of constrained assignment problems
• The assignment problem with seniority and job priority constraints
• A Lagrangean relaxation method for the constrained assignment problem
• The singly constrained assignment problem: An AP basis algorithm
• The stability of marriage and university admissions—zero-one programming method

zbMATH Keywords

LP relaxationconstrained assignmentgeneralized network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Discrete location and assignment (90B80)

Cited In (5)

• An optimal assignment problem with choice strategy
• Title not available (Why is that?)
• Resource constrained assignment problems
• Adjacency on the constrained assignment problem
• ON A PERSONNEL ASSIGNMENT PROBLEM

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 Q3987192)