A NOTE ON A TWO DIMENSIONAL KNAPSACK PROBLEM WITH UNLOADING CONSTRAINTS

dc.creatorda Silveira, JLM
dc.creatorXavier, EC
dc.creatorMiyazawa, FK
dc.date2013
dc.dateOCT
dc.date2014-08-01T18:16:44Z
dc.date2015-11-26T17:00:52Z
dc.date2014-08-01T18:16:44Z
dc.date2015-11-26T17:00:52Z
dc.date.accessioned2018-03-28T23:48:39Z
dc.date.available2018-03-28T23:48:39Z
dc.identifierRairo-theoretical Informatics And Applications. Edp Sciences S A, v. 47, n. 4, n. 315, n. 324, 2013.
dc.identifier0988-3754
dc.identifier1290-385X
dc.identifierWOS:000327128600001
dc.identifier10.1051/ita/2013037
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76486
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/76486
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1278583
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionIn this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin B, and a list L of n rectangular items, each item with a class value in {1, ... , C}. The problem is to pack a subset of L into B, maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item a, items with higher class values can not block a. We present a (4+epsilon)-approximation algorithm when the bin is a square. We also present (3+epsilon)-approximation algorithms for two special cases of this problem.
dc.description47
dc.description4
dc.description315
dc.description324
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.languageen
dc.publisherEdp Sciences S A
dc.publisherLes Ulis Cedex A
dc.publisherFrança
dc.relationRairo-theoretical Informatics And Applications
dc.relationRairo-Theor. Inform. Appl.
dc.rightsaberto
dc.sourceWeb of Science
dc.subjectKnapsack problem
dc.subjectapproximation algorithms
dc.subjectunloading/loading constraints
dc.subjectVehicle-routing Problem
dc.subjectLoading Constraints
dc.subjectPacking Problem
dc.subjectAlgorithms
dc.titleA NOTE ON A TWO DIMENSIONAL KNAPSACK PROBLEM WITH UNLOADING CONSTRAINTS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución