Amanote Research

Amanote Research

    RegisterSign In

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

doi 10.21236/ada233588
Full Text
Open PDF
Abstract

Available in full text

Date

April 1, 1989

Authors
Egon BalasDonald MillerJoseph PeknyPaolo Toth
Publisher

Defense Technical Information Center


Related search

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

Journal of Algorithms
1996English

A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem

Transportation Science
CivilTransportationStructural Engineering
2018English

A Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem

International Journal of Advanced Computer Science and Applications
Computer Science
2017English

Fast Implementation of Dijkstra's Algorithm for the Large-Scale Shortest Path Problem

Transactions of the Operations Research Society of Japan
2011English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

An Algorithm of Searching for the Shortest Path

2017English

Slope-Based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem

INTERNATIONAL JOURNAL FOR TRAFFIC AND TRANSPORT ENGINEERING
2014English

A Distributed Auction Algorithm for the Assignment Problem

2008English

All-Pairs Shortest Path Algorithm Based on MPI+CUDA Distributed Parallel Programming Model

Journal of Networks
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy