0 1 Integer Programming
Mostrando 1-9 de 9 artigos, teses e dissertações.
-
1. A NEW MATHEMATICAL MODEL FOR THE WORKOVER RIG SCHEDULING PROBLEM
ABSTRACT One of the most important activities in the oil and gas industry is the intervention in wellsfor maintenance services, which is necessary to ensure the constant production of oil. These interventions are carried out by workover rigs. Thus, the Workover Rig Scheduling Problem (WRSP) consists of finding the best schedule to service the wells while con
Pesqui. Oper.. Publicado em: 2016-08
-
2. OPTIMIZATION WITH LINEAR COMPLEMENTARITY CONSTRAINTS
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and i
Pesqui. Oper.. Publicado em: 2014-12
-
3. Um estudo computacional da busca tabu paramétrica para programação inteira mista 0-1 / A computational study of parametric tabu search for 0-1 mixed integer programs
Este trabalho apresenta um estudo computacional da busca tabu paramétrica para resolver problemas de programação inteira mista (PIM) com variáveis binárias. Trata-se de uma heurística genérica para problemas PIM gerais que resolve uma série de problemas de programação linear ao incorporar inequações de ramificação de variáveis inteiras como te
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 02/07/2010
-
4. Crop rotation Scheduling - modeling and solution methodolies / Programação de rotação de culturas - modelos e métodos de solução
Over the last decades, various proposals for techniques and processes to increase agricultural sustainability have been put forward. These proposals bring new planning models in which technical and ecological production aspects must be considered, as well as the access of small farmers to the consumer market. In this type of agricultural production planning,
Publicado em: 2009
-
5. Algoritmos relax-and-cut para problemas de programação inteira 0-1 / Relax-and-cut algorithms for 0-1 integer programming problems
Uma das principais motivações para o estudo de Otimização Discreta reside no elevado número de problemas do nosso cotidiano representáveis através de modelos de Otimização Inteira e Combinatória. Em particular, muitos destes problemas podem ser formulados com Programação Inteira 0-1, o que desperta especial interesse em técnicas capazes de resol
Publicado em: 2008
-
6. Uso de cortes canonicos no metodo de ramificação local para problemas inteiros 0-1 mistos / Use of canonical cuts in the local branching method for mixed 0-1 integer
Nesta dissertação propomos um uso mais geral dos Cortes Canônicos (CCs) introduzidos por Balas e Jeroslow ([2]) no método de Ramificação Local (RamLoc) de Fischetti e Lodi ([6]). A ramificação local é uma heurística de propósito geral para Programação Inteira Mista (MIP) que explora vizinhanças definidas através da adição de inequações lin
Publicado em: 2006
-
7. Solving the unit commitment problem of hydropower plants via Lagrangian Relaxation and Sequential Quadratic Programming
We consider the optimal scheduling of hydropower plants in a hydrothermal interconnected system. This problem, of outmost importance for large-scale power systems with a high proportion of hydraulic generation, requires a detailed description of the so-called hydro unit production function. In our model, we relate the amount of generated hydropower to nonlin
Computational & Applied Mathematics. Publicado em: 2005-12
-
8. ANÁLISE CONVEXA E MÉTODOS LIFT-AND-PROJECT PARA PROGRAMAÇÃO INTEIRA / CONVEX ANALYSIS AND LIFT-AND-PROJECT METHODS FOR INTEGER PROGRAMMING / ANÁLISIS CONVEXA Y MÉTODOS LIFT-AND-PROJECT PARA PROGRAMACIÓN ENTERA
Algorithms for general 0-1 mixed integer programs can be successfully developed by using lift-and-project methods to generate cuts. Cuts are generated by solving a cut- generation-program that depends on a certain normalization. From a theoretical point of view, the good numerical behavior of these cuts is not completely understood yet, specially, concerning
Publicado em: 2001
-
9. ALGORITHM RELAX-AND-CUT FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM / UM ALGORITMO RELAX-AND-CUT PARA O PROBLEMA QUADRÁTICO DA MOCHILA 0-1
We consider the 0-1 Quadratic Knapsack Problem (QKP), which consists of maximizing a quadratic Boolean function subject to a linear capacity constraint. The problem has applications in several areas such as telecommunications, financial engineering, location problems, graph theory (Max Clique). We propose a Branch-and-Bound algorithm to solve the QKP to opti
Publicado em: 1999