#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 534 CITATIONS

## Optimization of job shop scheduling with material handling by automated guided vehicle

VIEW 5 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## A Lagrangian-Relaxation Based Network Profit Optimization For Mesh SONET-Over-WDM Networks

VIEW 10 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Aerial Path Planning for Multi-Vehicles

VIEW 4 EXCERPTS

CITES BACKGROUND, RESULTS & METHODS

HIGHLY INFLUENCED

## VISIR-1.b: ocean surface gravity waves and currents for energy-efficient navigation

VIEW 4 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Auction dynamics: A volume constrained MBO scheme

VIEW 5 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Joint Power Control and Routing in Multihop D2D Assisted Cellular Systems

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Objective Variation Network Simplex Algorithm for Concave Continuous Piecewise Linear Network Flow Problems

VIEW 5 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Algorithms for Multiphase Partitioning

VIEW 5 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Duality in convex minimum cost flow problems on infinite networks and hypernetworks

VIEW 7 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**70**Highly Influenced Citations**Averaged 39 Citations**per year from 2017 through 2019

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 393 REFERENCES

## Efficient Parallel Algorithms for the Minimum Cost Flow Problem

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## A Fast and Simple Algorithm for the Maximum Flow Problem

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Signature Methods for the Assignment Problem

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Nondifferentiable optimization via approximation

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Traffic assignment problem for a general network

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Paths, Trees, and Flowers

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## A primal-dual algorithm for the capacitated Hitchcock problem

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A Parallel Asynchronous Implementation of the e-Relaxation Method for the Linear Minimum Cost Flow Problem

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## A cutting plane algorithm for convex programming that uses analytic centers

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Special cases of travelling salesman problems and heuristics

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL