Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/353456
Type: Artigo
Title: Two-dimensional disjunctively constrained knapsack problem : Heuristic and exact approaches
Author: Queiroz, Thiago Alves de
Hokama, Pedro Henrique Del Bianco
Schouery, Rafael Crivellari Saliba
Miyazawa, Flávio Keidi
Abstract: This work deals with the 0–1 knapsack problem in its two-dimensional version considering a conflict graph, where each edge in this graph represents a pair of items that must not be packed together. This problem arises as a subproblem of the bin packing pr
Subject: Programação inteira
Otimização combinatória
Métodos iterativos (Matemática)
Problema da mochila (Matemática)
Integer programming
Combinatorial optimization
Iterative methods (Mathematics)
Knapsack problem (Mathematics)
Country: Reino Unido
Editor: Elsevier
Rights: fechado
Identifier DOI: 10.1016/j.cie.2017.01.015
Address: https://www.sciencedirect.com/science/article/pii/S0360835217300347
Date Issue: 2017
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-85010648338.pdf957.66 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.