Publication
Using interval graphs in an order processing optimization problem
dc.contributor.author | Lopes, Isabel Cristina | |
dc.contributor.author | Carvalho, J. M. Valerio de | |
dc.date.accessioned | 2015-04-24T13:55:11Z | |
dc.date.available | 2015-04-24T13:55:11Z | |
dc.date.issued | 2010 | |
dc.description.abstract | In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders. | por |
dc.identifier.isbn | 978-988-18210-8-9 | |
dc.identifier.issn | 2078-0958 | |
dc.identifier.other | e-ISSN 2078-0966 | |
dc.identifier.uri | http://hdl.handle.net/10400.22/5834 | |
dc.language.iso | eng | por |
dc.peerreviewed | yes | por |
dc.publisher | International Association of Engineers | por |
dc.subject | Integer programming | por |
dc.subject | Interval graphs | por |
dc.subject | Open orders minimization | por |
dc.subject | MOSP | por |
dc.subject | Pathwidth | por |
dc.title | Using interval graphs in an order processing optimization problem | por |
dc.type | conference object | |
dspace.entity.type | Publication | |
oaire.citation.conferencePlace | London, England | por |
oaire.citation.endPage | 1728 | por |
oaire.citation.startPage | 1722 | por |
oaire.citation.title | Proceedings of the World Congress on Engineering 2010, Vol III | por |
person.familyName | Lopes | |
person.givenName | Isabel Cristina | |
person.identifier | 2277025 | |
person.identifier.ciencia-id | BC14-DF88-AEBC | |
person.identifier.orcid | 0000-0002-4833-470X | |
person.identifier.rid | L-7458-2017 | |
person.identifier.scopus-author-id | 36185835200 | |
rcaap.rights | openAccess | por |
rcaap.type | conferenceObject | por |
relation.isAuthorOfPublication | 70af5a18-432a-4ef9-862d-c5a79581c255 | |
relation.isAuthorOfPublication.latestForDiscovery | 70af5a18-432a-4ef9-862d-c5a79581c255 |