On using the linear programming relaxation of assignment type mixed integer problems

J.A.E.E. van Nunen; J.F. Benders; A.J.M. Beulens

doi:10.1007/978-3-642-69546-9_65

On using the linear programming relaxation of assignment type mixed integer problems

J.A.E.E. van Nunen, J.F. Benders, A.J.M. Beulens

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.

Original language	English
Title of host publication	DGOR
Subtitle of host publication	Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung
Editors	H. Steckhan, W. Bühler, K.E. Jäger, Ch. Schneeweiss, J. Schwarze
Place of Publication	Berlin
Publisher	Springer
Chapter	65
Pages	297-297
Number of pages	1
ISBN (Electronic)	978-3-642-69546-9
ISBN (Print)	3-540-13134-5, 978-3-540-13134-2
DOIs	https://doi.org/10.1007/978-3-642-69546-9_65
Publication status	Published - 1984
Event	12th Annual Meeting of DGOR - Mannheim, Germany Duration: 21 Sept 1983 → 23 Sept 1983

Publication series

Name	Operations Research Proceedings (ORP)
Volume	1983

Conference

Conference	12th Annual Meeting of DGOR
Country/Territory	Germany
City	Mannheim
Period	21/09/83 → 23/09/83

Access to Document

10.1007/978-3-642-69546-9_65

Cite this

van Nunen, J. A. E. E., Benders, J. F., & Beulens, A. J. M. (1984). On using the linear programming relaxation of assignment type mixed integer problems. In H. Steckhan, W. Bühler, K. E. Jäger, C. Schneeweiss, & J. Schwarze (Eds.), DGOR: Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung (pp. 297-297). (Operations Research Proceedings (ORP); Vol. 1983). Springer. https://doi.org/10.1007/978-3-642-69546-9_65

van Nunen, J.A.E.E. ; Benders, J.F. ; Beulens, A.J.M. / On using the linear programming relaxation of assignment type mixed integer problems. DGOR: Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung. editor / H. Steckhan ; W. Bühler ; K.E. Jäger ; Ch. Schneeweiss ; J. Schwarze. Berlin : Springer, 1984. pp. 297-297 (Operations Research Proceedings (ORP)).

@inproceedings{49db33b14e2a40fab627748cf9fc4d4b,

title = "On using the linear programming relaxation of assignment type mixed integer problems",

abstract = "It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.",

author = "{van Nunen}, J.A.E.E. and J.F. Benders and A.J.M. Beulens",

year = "1984",

doi = "10.1007/978-3-642-69546-9_65",

language = "English",

isbn = "3-540-13134-5",

series = "Operations Research Proceedings (ORP)",

publisher = "Springer",

pages = "297--297",

editor = "H. Steckhan and W. B{\"u}hler and K.E. J{\"a}ger and Ch. Schneeweiss and J. Schwarze",

booktitle = "DGOR",

address = "Germany",

note = "12th Annual Meeting of DGOR ; Conference date: 21-09-1983 Through 23-09-1983",

}

van Nunen, JAEE, Benders, JF & Beulens, AJM 1984, On using the linear programming relaxation of assignment type mixed integer problems. in H Steckhan, W Bühler, KE Jäger, C Schneeweiss & J Schwarze (eds), DGOR: Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung. Operations Research Proceedings (ORP), vol. 1983, Springer, Berlin, pp. 297-297, 12th Annual Meeting of DGOR, Mannheim, Germany, 21/09/83. https://doi.org/10.1007/978-3-642-69546-9_65

On using the linear programming relaxation of assignment type mixed integer problems. / van Nunen, J.A.E.E.; Benders, J.F.; Beulens, A.J.M.
DGOR: Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung. ed. / H. Steckhan; W. Bühler; K.E. Jäger; Ch. Schneeweiss; J. Schwarze. Berlin: Springer, 1984. p. 297-297 (Operations Research Proceedings (ORP); Vol. 1983).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - On using the linear programming relaxation of assignment type mixed integer problems

AU - van Nunen, J.A.E.E.

AU - Benders, J.F.

AU - Beulens, A.J.M.

PY - 1984

Y1 - 1984

N2 - It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.

AB - It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.

U2 - 10.1007/978-3-642-69546-9_65

DO - 10.1007/978-3-642-69546-9_65

M3 - Conference contribution

SN - 3-540-13134-5

SN - 978-3-540-13134-2

T3 - Operations Research Proceedings (ORP)

SP - 297

EP - 297

BT - DGOR

A2 - Steckhan, H.

A2 - Bühler, W.

A2 - Jäger, K.E.

A2 - Schneeweiss, Ch.

A2 - Schwarze, J.

PB - Springer

CY - Berlin

T2 - 12th Annual Meeting of DGOR

Y2 - 21 September 1983 through 23 September 1983

ER -

van Nunen JAEE, Benders JF, Beulens AJM. On using the linear programming relaxation of assignment type mixed integer problems. In Steckhan H, Bühler W, Jäger KE, Schneeweiss C, Schwarze J, editors, DGOR: Papers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung. Berlin: Springer. 1984. p. 297-297. (Operations Research Proceedings (ORP)). doi: 10.1007/978-3-642-69546-9_65

On using the linear programming relaxation of assignment type mixed integer problems

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this