Bicriteria multiresource generalized assignment problem
dc.citation.epage | 636 | en_US |
dc.citation.issueNumber | 8 | en_US |
dc.citation.spage | 621 | en_US |
dc.citation.volumeNumber | 61 | en_US |
dc.contributor.author | Karsu, O. | en_US |
dc.contributor.author | Azizoglu, M. | en_US |
dc.date.accessioned | 2016-02-08T10:59:21Z | |
dc.date.available | 2016-02-08T10:59:21Z | |
dc.date.issued | 2014 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:59:21Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2014 | en |
dc.identifier.doi | 10.1002/nav.21607 | en_US |
dc.identifier.eissn | 1520-6750 | |
dc.identifier.issn | 0894-069X | |
dc.identifier.uri | http://hdl.handle.net/11693/26404 | |
dc.language.iso | English | en_US |
dc.publisher | John Wiley & Sons | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1002/nav.21607 | en_US |
dc.source.title | Naval Research Logistics | en_US |
dc.subject | Branch and bound | en_US |
dc.subject | Generalized assignment problem | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Linear programming relaxation | en_US |
dc.subject | Branch and bound method | en_US |
dc.subject | Combinatorial optimization | en_US |
dc.subject | Linear programming | en_US |
dc.subject | Bi-criteria | en_US |
dc.subject | Computational results | en_US |
dc.subject | Generalized assignment problem | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Linear programming relaxation | en_US |
dc.subject | Lower and upper bounds | en_US |
dc.subject | Multi-resource generalized assignment problem | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.title | Bicriteria multiresource generalized assignment problem | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Bicriteria_multiresource_generalized_assignment_problem.pdf
- Size:
- 154.55 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version