Search
Now showing items 1-10 of 10
Nilpotency of commutative finitely generated algebras satisfying alpha r-x(3) + beta r(x)rx2=0
(Taylor & Francis, 2015)
A Classical Limit of Noumi's q-Integral Operator
(National Academic Sciences Ukraine, 2015)
We demonstrate how a known Whittaker function integral identity arises from the t = 0 and q -> 1 limit of the Macdonald polynomial eigenrelation satisfied by Noumi's q-integral operator.
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
(Springer, 2020)
The sum of squares (SoS) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of this ...
SEMIPRIMALITY AND NILPOTENCY OF NONASSOCIATIVE RINGS SATISFYING x (yz) = y (zx)
(Taylor & Francis Group, 2008)
In this article we study nonassociative rings satisfying the polynomial identity x yz =
y zx , which we call “cyclic rings.” We prove that every semiprime cyclic ring is
associative and commutative and that every cyclic ...
A QPTAS for the general scheduling problem with identical release dates
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
The General Scheduling Problem (GSP) generalizes scheduling problems with sum of cost objectives
such as weighted flow time and weighted tardiness. Given a set of jobs with processing
times, release dates, and job dependent ...
Split scheduling with uniform setup times
(Springer, 2015)
We study a scheduling problem in which jobs
may be split into parts, where the parts of a split job may be
processed simultaneously on more than one machine. Each
part of a job requires a setup time, however, on the ...
Semiprimality and nilpotency of nonassociative rings satisfying x(yz)=y(zx)
(2008)
In this article we study nonassociative rings satisfying the polynomial identity x(yz)=y(zx), which we call "cyclic rings." We prove that every semiprime cyclic ring is associative and commutative and that every cyclic ...
Solvability of a Commutative Algebra which Satisfies (x 2)2 = 0
(2014)
We studied the solvability of the algebra which satisfies the polynomial identity (x 2)2 = 0. We believe that, if A is a finite dimensional commutative algebra over a field F of characteristic not 2 which satisfies (x 2)2 ...
Resolución del problema de enrutamiento de vehículos con limitaciones de capacidad utilizando un procedimiento metaheurístico de dos fases
(Fondo Editorial EIA, 2013-11-26)
This paper presents an alternative procedure to solve the Capacitated Vehicle Routing Problem (CVRP) with homogeneous fleet. The paper proposes a two-phase metaheuristic algorithm: routes design and fleet scheduling. The ...
RESOLUCIÓN DEL PROBLEMA DE ENRUTAMIENTO DE VEHÍCULOS CON LIMITACIONES DE CAPACIDAD UTILIZANDO UN PROCEDIMIENTO METAHEURÍSTICO DE DOS FASES (SOLVING THE CAPACITATED VEHICLE ROUTING PROBLEM USING A TWOPHASE METAHEURISTIC PROCEDURE)
(Fondo Editorial EIA - Universidad EIA, 2013-10-02)
Este artículo presenta un procedimiento alternativo para resolver el problema de enrutamiento de vehículos con limitaciones de capacidad y flota homogénea (CVRP). Se propone un algoritmo metaheurístico que consta de la ...