Knapsack Problem
Mostrando 1-12 de 18 artigos, teses e dissertações.
-
1. Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
Abstract Paper aims We propose a modified Sequential Heuristic Procedure (MSHP) to reduce the cutting waste and number of setups for the One-Dimensional Cutting Stock Problem with Setup Cost. Originality This heuristic modifies Haessler’s sequential heuristic procedure (1975) by adapting the Integer Bounded Knapsack Problem to generate cutting patterns
Prod.. Publicado em: 18/10/2018
-
2. STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
ABSTRACT In this paper, we study the stochastic knapsack problem with expectation constraint. We solve the relaxed version of this problem using a stochastic gradient algorithm in order to provide upper bounds for a branch-and-bound framework. Two approaches to estimate the needed gradients are studied, one based on Integration by Parts and one using Finite
Pesqui. Oper.. Publicado em: 2017-09
-
3. An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem
The 0-1 exact k-item quadratic knapsack problem (E - kQKP) consists of maximizing a quadratic function subject to two linear constraints: the first one is the classical linear capacity constraint; the second one is an equality cardinality constraint on the number of items in the knapsack. Most instances of this NP-hard problem with more than forty variables
Pesqui. Oper.. Publicado em: 2014-04
-
4. Local search-based heuristics for the multiobjective multidimensional knapsack problem
In real optimization problems it is generally desirable to optimize more than one performance criterion (or objective) at the same time. The goal of the multiobjective combinatorial optimization (MOCO) is to optimize simultaneously r > 1 objectives. As in the single-objective case, the use of heuristic/metaheuristic techniques seems to be the most promising
Prod.. Publicado em: 30/10/2012
-
5. New mechanized system for circle spraying of oil palms seedling emergence
A new machine system has been designed, developed and evaluated for extensive circle spraying of oil palms (Elaeis guineensis Jacq.) in an effort to overcome the inefficient spraying problem with the conventional spraying system. The machine system consists of a four-wheeled drive 4WD prime mover with front mounted machine attachments for the circle spraying
Scientia Agricola. Publicado em: 2012-04
-
6. A hybrid methodology to solve the container loading problem with weight distribution and cutting problems
Transport of goods has represented an important role in economic development throughout the history and ship containerization brought great advantages. Its invention in mid-1950s brought down the cost of transport and reduced time for loading and unloading cargo. Consequently, it increased efficiency of port working and reduced handling cargo to hours instea
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/09/2011
-
7. Geração de colunas para problemas de corte em duas fases / Column generation for two starge cutting stock problems
The Compartmentalized Knapsack Problem is an extension of the classical Knapsack Problem, where the ordered items are partitioned into classes, in such way that the knapsack must be divided into compartments, each one having limited capacity. In addition, the building of a compartment has a fixed cost and involves a loss of the overall capacity. The objectiv
Publicado em: 2009
-
8. Implementação e análise de algoritmos BSP/CGM em um Beowulf e no InteGrade
As the science and technology advanced in all diverse areas, problems which require more and more computer power to be solved were risen. In the beginning, these problems were solved by high performance parallel computers which were huge and very expensive. After that, though, making clusters with PCs which worked together to offer a higher processing capaci
Publicado em: 2009
-
9. Programação dinâmica eficiente com algoritmos Cache-Oblivious / Efficient cache-oblivious dynamic programming algorithms
A memória nos computadores modernos geralmente está organizada em uma hierarquia complexa. Dessa forma, torna-se importante projetar algoritmos que utilizem a cache de forma eficiente. Além disso, as configurações da memória e da cache tem grande variação de computador para computador. Assim, é necessário também que os algoritmos desenvolvidos dep
Publicado em: 2009
-
10. Uma proposta de um sistema criptografico de chave publica utilizando codigos convolucionais classicos e quanticos / A proposal of a cryptographic system of public key using classical and quantum convolutional codes
The proposal of a cryptographic system of public key that uses classical and quantum convolutional codes of unit-memory presented in this work, is based on the use of trapdoors functions which when applied to submatrices reduce the capacity of correction of errors of the code. This process gives us an increase in the degree of privacy of information being se
Publicado em: 2008
-
11. A methodology applied to selection of taxpayers for audit proposals. / Uma metodologia aplicada à seleção de contribuintes do ICMS para fins de auditoria.
With the advent of the Real Plan, the brazilian states has initiated an improvement process of the management instruments in their tax agencies. It is included among such instruments planning of the tax case, which had been incorporated new systematics for the taxpayer selection of the value added taxes on sales and services (ICMS). This work presents a comb
Publicado em: 2006
-
12. Heuristicas e metaheuristicas para otimização combinatoria multiobjetivo
This work presents contributions to the development of heuristic methods for multiobjective combinatorial problems. The goal of the proposed methods is to generate in a reazonable time a set of approximately Pareto-optimal solutions, allowing the decision maker to choose a solution of interest. The methods are tested on the flowshop scheduling problem and th
Publicado em: 2002