Pages that link to "Item:Q3351112"

The following pages link to Finding Minimum-Cost Circulations by Successive Approximation (Q3351112):

Displaying 33 items.

• Efficient algorithms for abstract flow with partial switching (Q2079298) (← links)
• The assignment problem revisited (Q2136890) (← links)
• Computing minimum length representations of sets of words of uniform length (Q2355702) (← links)
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
• A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
• Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
• An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
• Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
• Finding optimal non-datapath caching strategies via network flow (Q2682921) (← links)
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
• A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043) (← links)
• A sparse algorithm for dense optimal transport (Q3300344) (← links)
• Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
• Finding minimum-cost circulations by canceling negative cycles (Q3474897) (← links)
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports (Q3478272) (← links)
• (Q5020876) (← links)
• (Q5020878) (← links)
• Recent developments in maximum flow algorithms (Q5054836) (← links)
• Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
• Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems (Q5230605) (← links)
• Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
• The problem of synthesis of reliable networks (Q5951291) (← links)
• Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
• Maximum skew-symmetric flows (Q6102298) (← links)
• Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
• The balanced \(p\)-median problem with unitary demand (Q6164621) (← links)
• More efficient parallel flow algorithms (Q6487968) (← links)
• Database repairing with soft functional dependencies (Q6536405) (← links)
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems (Q6542455) (← links)
• Software project scheduling under activity duration uncertainty (Q6588492) (← links)