An Improved Enumerative Algorithm for Solving Quadratic Zero-One-Programming

Article Abstract:

A better algorithm is promulgated for the decrease of a quadratic action affected by zero-one aspects of quadratic constraints following the notion of additive penalties. By using negative variables, a quadratic function, wherein every coefficent but constant terms have nonnegativity, is found. The constant becomes a higher bound of the function. Properties are found based on a tighter bound, and workable testing is developed. A basic heuristic technique is used to find a tighter bound. Flexibility issues are considered. Extensive examples and formulations for the algorithm are included.

Computer programming, Measurement, Statistics, Statistics (Data)

---

Representation and management of MOEA populations based on graphs

Article Abstract:

The storage and handling of multi objective evolutionary algorithms (MOEAs) is discussed. The behavior, storage requirements, construction time and management of MOEAs are examined. A new tool for representing and managing populations of MOEAs by use of graphs is discussed.

Multiple criteria decision making, Usage, Varieties, Algorithm, Graph theory, Global economy

---

An extreme point algorithm for a local minimum solution to the quadratic assignment problem

Article Abstract:

The network structure of basic solutions to the quadratic assignment problem (QAP) is reviewed. The concept of a relative local star minimum is introduced.

Peer to peer computing, Network architecture, Network architectures, Equations, Quadratic, Quadratic equations

Similar abstracts:

• Abstracts: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
• Abstracts: Impact fees: a review of alternatives and their implications for planning practice in Britain. Recent changes in territorial planning and the system for controlling urban development in Portugal
• Abstracts: How to approach methods for stimulating innovation. How laughter can reinforce training. Training Goes Electronic
• Abstracts: The Shorter Queue Problem: A Numerical Study Using the Matrix-Geometric Solution. Approximation Algorithms for the m-Dimensional, O-1 Knapsack Problem: Worst Case and Probabilistic Analysis

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.