Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Tight bounds on the number of minimum-mean cycle cancellations and related results
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Recent developments and future directions in mathematical programming
IBM Systems Journal
Efficient algorithms for the Hitchcock transportation problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Network routing models applied to aircraft routing problems
WSC '95 Proceedings of the 27th conference on Winter simulation
A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On dual minimum cost flow algorithms (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
A fully combinatorial algorithm for submodular function minimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fully combinatorial algorithm for submodular function minimization
Journal of Combinatorial Theory Series B
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Reverse Center Location Problem
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Computers and Operations Research
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
QoS for data relaying in hierarchical wireless sensor networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
INFORMS Journal on Computing
A double scaling algorithm for the constrained maximum flow problem
Computers and Operations Research
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Optimal homologous cycles, total unimodularity, and linear programming
Proceedings of the forty-second ACM symposium on Theory of computing
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
The maximum flow problem with minimum lot sizes
ICCL'11 Proceedings of the Second international conference on Computational logistics
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
SIAM Journal on Computing
A semantic framework for test coverage
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A faster polynomial algorithm for the constrained maximum flow problem
Computers and Operations Research
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
George Dantzig's impact on the theory of computation
Discrete Optimization
Bilevel time minimizing transportation problem
Discrete Optimization
Color constrained combinatorial optimization problems
Operations Research Letters
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
A dual version of tardos's algorithm for linear programming
Operations Research Letters
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
Hi-index | 0.00 |