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.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...