Results 21 to 30 of about 72 (70)
A Greedy Randomized Adaptive Search Procedure For The Quadratic Assignment Problem
. A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems.
Mauricio G.C. Resende +4 more
core +1 more source
A note on variability of interval data
Interval data, Linear and quadratic programming, Search algorithms, 68T20, 90C05, 90C20,
Miroslav Brzezina +2 more
core +1 more source
A criss-cross algoritmus új változatai lineáris komplementaritási feladatokra
Új típusú criss-cross módszereket általánosítunk elégséges mátrixú lineáris komplementaritási feladatokra (LCP). A legtöbb LCP megoldó algoritmus előre feltételez bizonyos tulajdonságokat a feladat mátrixáról.
CSIZMADIA, Zsolt, ILLÉS, Tibor
core +1 more source
Quadratic nonconvex optimization, Regularized Lagrangian, Strong duality, Quadratic constraints, Linear equality constraints, Trust-region problems, Alternative theorems, 90C26, 90C46, 90C20, 90C30,
V. Jeyakumar, Guoyin Li
core +1 more source
Investigação experimental do transiente térmico no processo de sucção de compressores de refrigeração doméstica [PDF]
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Mecânica, Florianópolis, 2009.A análise térmica detalhada do sistema de sucção de compressores pode permitir um aumento ...
Morriesen, André
core
Robust One Period Option Modelling [PDF]
AMS classifications: 90C15; 90C20; 90C90; 49M29;return on investment;option pricing models;optimization;portfolio ...
Sturm, J.F., Lutgens, F.
core
Convex Relaxations Of 0-1 Quadratic Programming
We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When
Svatopluk Poljak, Henry Wolkowicz
core
Effectively managing diagnostic tests to monitor the COVID-19 outbreak in Italy. [PDF]
Lampariello L, Sagratella S.
europepmc +1 more source
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value.
Ivo Nowak
core
Steerable Near-Quadrature Filter Pairs in Three Dimensions. [PDF]
Tang TM, Tagare HD.
europepmc +1 more source

