Finding Minimum-cost Circulations by Successive Approximation

Finding Minimum-cost Circulations by Successive Approximation

Bibliographic Details
Main Authors:	Goldberg, Andrew V., Tarjan, Robert E.
Published:	2023
Online Access:	https://hdl.handle.net/1721.1/149133

Similar Items

Finding Minimum-cost Circulations by Canceling Negative Cycles
by: Goldberg, Andrew V., et al.
Published: (2023)

Finding minimum-cost flows by double scaling
by: Ahuja, Ravindra K.
Published: (2009)

Approximating the Minimum-cost Maximum Flow is P-Complete
by: Stein, Clifford, et al.
Published: (2023)

Faster parametric shortest path and minimum balance algorithms
by: Young, Neal E., et al.
Published: (2009)

Finding Minimum Cutsets in Reducible Graphs
by: Shamir, Adi
Published: (2023)

Combinatorial Algorithms for the Generalized Circulation Problem
by: Goldberg, Andrew V., et al.
Published: (2023)

Finding Minimum Rectlinear Distance Paths in the Presence of Barriers
by: Larson, Richard C., 1943-
Published: (2004)

Hardness and approximation of submodular minimum linear ordering problems
by: Farhadi, Majid, et al.
Published: (2023)

An exact combinatorial algorithm for minimum graph bisection
by: Delling, Daniel, et al.
Published: (2016)

A faster algorithm for finding the minimum cut in a graph
Published: (2003)

MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves
by: Tordesillas, Jesus, et al.
Published: (2022)

Minimum-cost control of complex networks
by: Li, Guoqi, et al.
Published: (2016)

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
by: Hashim, Siti Zuraifah
Published: (2007)

Applying integer programming techniques to find minimum integer weights of voting games
by: Strauss, Aaron B., 1980-
Published: (2005)

Minimum-cost control of directed complex networks
by: Ding, Jie
Published: (2018)

Minimum quality standards, fixed costs, and competition
by: Ronnen, Uri.
Published: (2009)

Successive approximation method for Caputo q-fractional IVPs
by: Salahshour, S.S., et al.
Published: (2015)

Analysis of a successive approximation analog-to-digital converter
by: Chong, Chee Hock.
Published: (2008)

The auction algorithm for the minimum cost network flow problem
Published: (2003)

Relaxation methods for minimum cost network flow problems
Published: (2002)

Parallel algorithms for the assignment and minimum-cost flow problems
Published: (2003)

Concurrent disjoint set union
by: Jayanti, Siddhartha V, et al.
Published: (2021)

A near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size
by: Onak, Krzysztof, et al.
Published: (2012)

Approximately Counting Locally-Optimal Structures
by: Goldberg, L, et al.
Published: (2015)

Finding and developing costs in the USA 1945-1985
by: Adelman, Morris Albert
Published: (2005)

Finding and developing costs in the USA 1945-1985
Published: (2005)

Minimum cost decision for the tradeoff between finished goods inventory and product capacity
by: Dutcher, William E
Published: (2013)

The design of a successive approximation register (SAR) ADC for BMS
by: Huang, Junwei
Published: (2023)

Accuracy or approximation? : measurement strategy for successful land reforms in Rwanda
by: Kumar, Sanjay,M.C.P.Massachusetts Institute of Technology.
Published: (2020)

The successive approximation register (SAR) analog to digital converter (ADC)
by: Yap, Xuan Yu
Published: (2019)

A faster strongly polynomial minimum cost flow algorithm
Published: (2004)

A faster strongly polynomial minimum cost flow algorithm
Published: (2003)

Parallel primal-dual methods for the minimum cost flow problem
Published: (2003)

A faster strongly polynomial minimum cost flow algorithm
Published: (2003)

Minimum energetic cost to maintain a target nonequilibrium state
by: Horowitz, Jordan M., et al.
Published: (2017)

GRAPH PARTITIONING AND DILUTE SPIN-GLASSES - THE MINIMUM COST SOLUTION
by: Wong, K, et al.
Published: (1988)

Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem
by: Feizi-Khankandi, Soheil, et al.
Published: (2012)

SHARPS: A new cost-screening technique to attain cost-effective minimum water network
by: Alwi, Sharifah Rafidah Wan, et al.
Published: (2006)

The asynchronous successive approximation register (SAR) analog-to-digital converter (ADC)
by: Qin, Yuxin
Published: (2021)

Key-nodes selection problem for minimum cost control of directed networks
by: Li, Guoqi, et al.
Published: (2020)