Jove
Visualize
Contact Us

Related Experiment Videos

Orthogonal projections applied to the assignment problem.

W J Wolfe1, R M Ulmer

  • 1Dept. of Comput. Sci. and Eng., Colorado Univ., Denver, CO.

IEEE Transactions on Neural Networks
|January 1, 1997
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Harmonic analysis of homogeneous networks.

IEEE transactions on neural networks·1995
Same author

Inhibitory grids and the assignment problem.

IEEE transactions on neural networks·1993
Same author

K-winner networks.

IEEE transactions on neural networks·1991
Same author

Failure of hyperthermia to activate experimental epileptogenic foci in monkey.

The Journal of pediatrics·1956
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

This study introduces a novel neural network approach for the assignment problem (AP), enhancing accuracy and speed. By projecting onto the feasible space (F) and using a "clip" operator, performance is significantly improved.

Area of Science:

  • Computational Mathematics
  • Artificial Intelligence
  • Operations Research

Background:

  • The assignment problem (AP) is a fundamental combinatorial optimization problem.
  • Traditional neural network approaches for AP have limitations in efficiency and accuracy.
  • Existing projection methods for AP are computationally complex.

Purpose of the Study:

  • To present a significantly improved neural network approach for solving the assignment problem (AP).
  • To simplify the orthogonal projection onto the feasible space (F) for AP.
  • To enhance the accuracy and runtime performance of neural AP solvers.

Main Methods:

  • Identifying the feasible space (F) as a linear subspace of R(n(2)).
  • Developing a simplified formula for orthogonal projection onto F.

Related Experiment Videos

  • Integrating a novel "clip" operator at the boundaries of the activation cube.

    • Main Results:

    • The simplified projection formula is easily integrated into traditional neural models.
    • The "clip" operator improves AP solution accuracy and runtime by an order of magnitude.
    • Statistical results for APs (n=10 to n=50) confirm the theoretical improvements.

    Conclusions:

    • The proposed method offers a more efficient and accurate neural network solution for the assignment problem.
    • Constraining the network to operate within the feasible space (F) with clipping enhances performance.
    • This approach represents a significant advancement over existing neural AP algorithms.