Examples of using Integer programming in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
Integer programming is NP-complete.
We propose in this study two integer programming formulations to model the problem.
Abstract Vehicle routing problem is a classical problem of integer programming area.
Mixed integer programming has many applications in industrial production.
This study aims to present andevaluate models of mixed integer programming for scheduling of port berths.
An integer programming model is proposed and tackled by exact methods, meta-heuristics and a multi-objective approach.
Contributions to the integration of integer programming and constraint programming techniques, AV. EXT.
These problems may be analyzed using graph-theoretic methods,by dynamic programming, or by integer programming.
It is used in a special case of integer programming, in which all the decision variables are integers.
Integer programming studies linear programs in which some or all variables are constrained to take on integer values.
For the model solution, in order to mitigate the difficulties inherent of integer programming, step-by-step processes were proposed.
In this context, we propose a mixed integer programming model to allocate resources considering the joint coordination of survivability and fragmentation.
In this work we aimed to investigate the e ectiveness of the application of continuous optimization techniques in the solution of integer programming tasks.
For investment in shares, this work proposed modeling in integer programming fundamentalist financial multiple of assets listed in ibrx.
To solve integer programming problems, which are those that restrict the decision variables to integer values, the branch-and-bound and cutting-plane method will be presented. the case of totally unimodul.
The selection portfolio project problem can be modeled as an integer programming 0-1 problem, known as the knapsack problem.
These include various types of integer programming problems in operations research, many problems in logistics, protein structure prediction in biology, and the ability to find formal proofs of pure mathematics theorems.
This work performs an exhaustive evaluation and comparison of three integer programming models proposed in the literature for the index tracking problem.
This dissertation deals with a real problem of operating rooms programming for elective patientsin a lisbon hospital. for this problem, we propose a reformulation of the integer programming model proposed by marques et al.
Included are state-of-the-art solvers in integer programming, nonlinear optimization, linear programming, stochastic programming, and complemetarity problems.
For instance, many problems in operations research are NP-complete,such as some types of integer programming and the travelling salesman problem.
The optimization problem is formulated as a mixed integer programming model that is defined on a directed graph whose nodes represent contractual and spot voyages.
For the solution of this problem were studied severalmodels proposed in the literature and about the most appropriate model is presented a formulation of integer programming and mixed integer programming formulation based on the concept of network flow.
Methods for solving this problem using linear mixed integer programming and heuristic algorithms of differential evolution(binary differential evolution and discretized differential evolution) are proposed using binary variables.
The present study proposes optimization approaches for the programming and scheduling of harvest fronts for a multiple period-planning horizon e.g., weeks or months of in the harvest season,based on mixed integer programming models for GLSPPL to support decisions about harvesting, crop planting, and reform of harvest blocks.
In this context,a mixed integer programming model and a solution method were proposed for glass containers industry lot sizing and scheduling problem, the main difference between this work and the others in literature is the inclusion of process specific technological constraints.
The project aim is to enable the candidate to deepen his knowledge in integer programming area, using the vehicle routing problem as motivation.
The lot sizing mixed integer programming problem is a quite difficult one to be solved in its optimality, due to the great amount of variables and, mainly, of existing restraints. that is why, in this work, the problem is decomposed(by products), through the dantzig-wolf decomposition, targeting the reformulation of the original problem, generating an equivalent problem.
OptTek's OptQuest optimization engine combines tabu search,scatter search, integer programming, and neural networks algorithms to efficiently identify ideal scenarios according to parameters you specify.
In this paper the comfort problem will be mathematically described as a integer programming optimization problem and it will be demonstrated by computer simulations that it is possible to achieve high levels of economic saving without a great impact on the user comfort level by making the controller optimize a combination of both objective functions.