Pages that link to "Item:Q3474897"
From MaRDI portal
The following pages link to Finding minimum-cost circulations by canceling negative cycles (Q3474897):
Displaying 50 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- A direct barter model for course add/drop process (Q534346) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Improved filtering for the bin-packing with cardinality constraint (Q1617384) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Linear fractional approximations for master problems in column generation (Q1728318) (← links)
- Decomposition theorems for linear programs (Q1785306) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Balanced-flow algorithm for path network planning in hierarchical spaces (Q2283024) (← links)
- Profit maximization in flex-grid all-optical networks (Q2300629) (← links)
- Linking and cutting spanning trees (Q2331458) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Evacuation planning by earliest arrival contraflow (Q2358500) (← links)
- Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (Q2757624) (← links)
- Profit Maximization in Flex-Grid All-Optical Networks (Q2868649) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- On solving maximum and quickest interval-valued flows over time (Q2988443) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
- Finding Minimum-Cost Circulations by Successive Approximation (Q3351112) (← links)
- (Q3384766) (← links)
- Node-Balancing by Edge-Increments (Q3452807) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
