Now showing items 41-50 of 8748
ON THE MAXIMIZATION OF A CONCAVE QUADRATIC FUNCTION WITH BOX CONSTRAINTS
(Siam PublicationsPhiladelphia, 1994)
Continuous-time multiobjective optimization problems via invexity
(Hindawi Publishing CorporationNew YorkEUA, 2007)
An adaptation of the dual-affine interior point method for the surface flatness problem
(Elsevier B.V., 2007-09-16)
This paper presents an adaptation of the dual-affine interior point method for the surface flatness problem. In order to determine how flat a surface is, one should find two parallel planes so that the surface is between ...
An innovative data structure to handle the geometry of nesting problems
As in many other combinatorial optimisation problems, research on nesting problems (aka irregular packing problems) has evolved around the dichotomy between continuous (time consuming) and discrete (memory consuming) ...
Projeto E análise de uma rede neural para resolver problemas de programação dinâmica
Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements. Neural networks with ...
Branch and bound algorithm for transmission network expansion planning using DC model
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
(World Scientific and Engineering Acad and Soc, 2014)
A Lagrangian bound for many-to-many assignment problems
On the solution of mathematical programming problems with equilibrium constraints
(Physica-verlag Gmbh & CoHeidelbergAlemanha, 2001)
Solving a multicoloring problem with overlaps using integer programming
(Elsevier Science, 2010-02)
This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify ...