✦ LIBER ✦

An ejection chain algorithm for the quadratic assignment problem

✍ Scribed by Cesar Rego; Tabitha James; Fred Glover

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 397 KB
Volume: 56
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20360

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parametric-based heuristic program for

A parametric-based heuristic program for the quadratic assignment problem

✍ D. J. White 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

An approximation algorithm for quadratic

An approximation algorithm for quadratic cost 0–1 mixed integer programming problems

✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.

The formulation and numerical method for

The formulation and numerical method for partial quadratic eigenvalue assignment problems

✍ Yun-Feng Cai; Jiang Qian; Shu-Fang Xu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

An expanded maximum neural network algor

An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks

✍ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be