Polyhedral study of simple plant location problem with order

Simple item page
dc.contributor.author Vasilyev,I en
dc.contributor.author Xenia Klimentova en
dc.contributor.author Boccia,M en
dc.date.accessioned 2018-01-03T17:15:07Z
dc.date.available 2018-01-03T17:15:07Z
dc.date.issued 2013 en
dc.description.abstract This paper is addressed to the generalization of simple plant location problem where customer's preferences are taken into account. Some basic polyhedral studies and a new family of facet-defining inequalities are given. The effectiveness of the proposed approach is illustrated by the computational experience. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/5413
dc.identifier.uri http://dx.doi.org/10.1016/j.orl.2012.12.006 en
dc.language eng en
dc.relation 5577 en
dc.rights info:eu-repo/semantics/embargoedAccess en
dc.title Polyhedral study of simple plant location problem with order en
dc.type article en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
P-00F-XM3.pdf
Size:
350.25 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
CEGI - Indexed Articles in Journals
 CESE - Other Publications