Red Eléctrica de España uses integer programming for annual salary revisions

In this paper, we present a mixed-integer linear programming model for determining salary-revision matrices for an organization based on that organization?s general strategies. The solution obtained from this model consists of salary increases for each employee; these increases consider the employee?s professional performance, salary level relative to peers within the organization, and professional group. In addition to budget constraints, we modeled other elements typical of compensation systems, such as equity and justice. Red Eléctrica de España (REE), the transmission agent and operator of the Spanish electricity system, used the model to revise its 2010 and 2011 salary policies, and achieved results that were aligned with the company strategy. REE incorporated the model into the salary management module within its information system, and plans to continue to use the model in revisions of the module.

A Code for zero-one integer programming, ILLIP-2 : a programming manual for ILLIP-2 /

"UILU-ENG 77 1711."

Optimum network design using NOR and NOR-AND gates by integer programming,

Bibliography: p. 44.

An implicit enumeration program for zero-one integer programming -- ILLIP-2 /

Thesis (M.S.)--Illinois.

A study of the effect of additional inequalities in integer programming for logical design.

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

Synthesis of optimal networks with NOR and NAND gates by integer programming /

"January 18, 1971."

On the synthesis by integer programming of optimal NOR gate networks for four variable switching functions /

"Supported in part by the National Science Foundation under grant no. NSF GJ-503."

An Implicit enumeration program for zero-one integer programming,

Bibliography: p. 41-42.

Synthesis of optimal double-rail logic networks using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

Computational experience in all-integer, binary variable, integer programming problems using Gomory's all-integer algorithm,

Bibliographical footnotes.

Implicit enumeration algorithm of integer programming on Illiac IV,

Bibliography: p. 29.

Optimum network design using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE