Pages that link to "Item:Q4080986"
From MaRDI portal
The following pages link to Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (Q4080986):
Displaying 50 items.
- New solutions for disjoint paths in P systems (Q256435) (← links)
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- The data transfer problem in a system of systems (Q319366) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Topology optimisation of repairable flow networks for a maximum average availability (Q356397) (← links)
- Towards an optimization theory for deforming dense granular materials: minimum cost maximum flow solutions (Q380567) (← links)
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Maximum likelihood estimation of Gaussian mixture models using stochastic search (Q411952) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- A generalized bi-criteria fuzzy integer flow sharing problem (Q448933) (← links)
- A min-flow algorithm for minimal critical set detection in resource constrained project scheduling (Q456733) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Selecting a discrete portfolio (Q478119) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Popular mixed matchings (Q541674) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- Updating network flows given multiple, heterogeneous arc attribute changes (Q655194) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Maximizing network throughput under stochastic user equilibrium with elastic demand (Q724322) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
