A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

M.G.C. van Krieken, Hein Fleuren and M.J.P. Peeters
Additional contact information
M.G.C. van Krieken: Tilburg University, Center For Economic Research
M.J.P. Peeters: Tilburg University, Center For Economic Research

No 2004-44, Discussion Paper from Tilburg University, Center for Economic Research

Keywords: integer programming; set partitioning; Branch and bound; lagrangean relaxation (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://repository.tilburguniversity.edu/bitstream ... 0e9473f581c/download (application/pdf)

Related works:
Working Paper: A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems (2004)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tiu:tiucen:411424a6-e9ef-4e13-8684-a6cf98bd6b46

Access Statistics for this paper

More papers in Discussion Paper from Tilburg University, Center for Economic Research
Bibliographic data for series maintained by Richard Broekman ().