A facet generation and relaxation technique applied to an assignment problem with side constraints

Ronny Aboudi, Åsa Hallefjord, Kurt Jörnsten

Research output: Contribution to journalArticle

8 Scopus citations


We consider a solution method for combinatorial optimization problems based on a combination of Lagrangean relaxation and constraint generation techniques. The procedure is applied to a constrained assignment problem, where subsets of variables are specified, and variables belonging to the same subset must have the same value. The model can be applied to solve constrained job assignment or classroom assignment problems. The procedure we suggest requires only the solution of classical assignment subproblems. An illustrative numerical example is given.

Original languageEnglish (US)
Pages (from-to)335-344
Number of pages10
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Feb 15 1991



  • Combinatorial optimization
  • Lagrangean relaxation
  • assignment problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this