Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Linear assignment procedures

Article Abstract:

Combinatorial optimization problems such as the Traveling Salesman Problem and quadratic assignment can be made easier by the Linear Assignment Problem (LAP). There are several algorithms available for LAP and these include one that could be used with incomplete cost matrices. An LAP algorithm with bipartite matching in the first phase was also developed by Hao and Kocur which works faster on small cost range problems and slower on sparse problem instances and large cost ranges.

Author: Volgenant, A., Jonker, R.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Research, Systems engineering, Linear systems

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Solving the k-cardinality assignment problem by transformation

Article Abstract:

A transformation that enables to solve k-cardinality Linear Assignment Problem (k-LAP) and the group assignment problem by any standard linear assignment algorithm is discussed. The results suggest that the transformation approach is suited to solve the considered test problems within short computing times for the test instances.

Author: Volgenant, A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
Analysis, Evaluation, Algorithms, Mathematical logic, Algorithm, Symbolic and mathematical logic, Numbers, Cardinal, Cardinal numbers, Algebras, Linear, Linear algebra

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A branch-and-bound algorithm for the singly constrained assignment problem

Article Abstract:

A method for solving the assignment problems of computers, using branch and bound algorithms, is presented.

Author: Volgenant, A., Lieshout, P.M.D.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
Electronic computers, Europe, Computers, Electronic Computer Manufacturing, Computers & Auxiliary Equip, Management dynamics, Management, Company business management, Branch and bound algorithms, Software/hardware leasing

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Usage
Similar abstracts:
  • Abstracts: A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. Effective algorithm and heuristic for the generalized assignment problem
  • Abstracts: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem. A note of the approximation of the asymmetric traveling salesman problem
  • Abstracts: Decision aiding: a model for ordinally constructing additive objective functions. A GARCH option pricing model with alpha-stable innovations
  • Abstracts: Entranced by London's high-rise housing. Life after death. Window dressing
  • Abstracts: Why Sars didn't return. Own goal. Editorial: AsiaEs health threat
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.