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

Ronny Aboudi; Åsa Hallefjord; Kurt Jörnsten

doi:10.1016/0377-2217(91)90265-W

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

Ronny Aboudi, Åsa Hallefjord, Kurt Jörnsten

Management Science

Research output: Contribution to journal › Article

8 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	335-344
Number of pages	10
Journal	European Journal of Operational Research
Volume	50
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(91)90265-W
State	Published - Feb 15 1991

Fingerprint

Keywords

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

Aboudi, R., Hallefjord, Å., & Jörnsten, K. (1991). A facet generation and relaxation technique applied to an assignment problem with side constraints. European Journal of Operational Research, 50(3), 335-344. https://doi.org/10.1016/0377-2217(91)90265-W

@article{595c92571b5b4014be57726ec5190a6e,

title = "A facet generation and relaxation technique applied to an assignment problem with side constraints",

abstract = "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.",

keywords = "Combinatorial optimization, Lagrangean relaxation, assignment problem",

author = "Ronny Aboudi and {\AA}sa Hallefjord and Kurt J{\"o}rnsten",

year = "1991",

month = feb

day = "15",

doi = "10.1016/0377-2217(91)90265-W",

language = "English (US)",

volume = "50",

pages = "335--344",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

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

AU - Aboudi, Ronny

AU - Hallefjord, Åsa

AU - Jörnsten, Kurt

PY - 1991/2/15

Y1 - 1991/2/15

N2 - 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.

AB - 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.

KW - Combinatorial optimization

KW - Lagrangean relaxation

KW - assignment problem

UR - http://www.scopus.com/inward/record.url?scp=0026107479&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026107479&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(91)90265-W

DO - 10.1016/0377-2217(91)90265-W

M3 - Article

AN - SCOPUS:0026107479

VL - 50

SP - 335

EP - 344

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -

Access to Document

10.1016/0377-2217(91)90265-W