The following pages link to (Q4058442):
Displaying 35 items.
- An auction algorithm for the max-flow problem (Q1906750) (← links)
- New algorithms for the weighted maximum cut problem on graphs (Q1907796) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Firing partial orders in a Petri net (Q2117188) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Enhanced instance space analysis for the maximum flow problem (Q2171589) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity (Q2336806) (← links)
- The \(\alpha\)-maximum flow model with uncertain capacities (Q2338453) (← links)
- The symbolic algorithms for maximum flow in networks (Q2433386) (← links)
- A combinatorial algorithm for weighted stable sets in bipartite graphs (Q2492214) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
- Algorithms for flows with parametric capacities (Q3823390) (← links)
- Exact cuts in networks (Q3827810) (← links)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836) (← links)
- Decomposition algorithms for locating minimal cuts in a network (Q3931039) (← links)
- Optimal sharing (Q3941156) (← links)
- A good algorithm for lexicographically optimal flows in multi-terminal networks (Q4126084) (← links)
- Implementing Goldberg's max-flow-algorithm ? A computational investigation (Q4207771) (← links)
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (Q4301637) (← links)
- Exploiting locality in LT-RAM computations (Q5054773) (← links)
- Recent developments in maximum flow algorithms (Q5054836) (← links)
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration (Q5090297) (← links)
- On implementing push-relabel method for the maximum flow problem (Q5101413) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- Inverse Shortest Path Models Based on Fundamental Cycle Bases (Q5176285) (← links)
- Parallel algorithms for the maximum flow problem with minimum lot sizes (Q5176286) (← links)
- Simplifications and speedups of the pseudoflow algorithm (Q5326778) (← links)
- On stable flows and preflows (Q6039791) (← links)
- A fast maximum flow algorithm (Q6065305) (← links)
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)
- On the impact of initialisation strategies on maximum flow algorithm performance (Q6551097) (← links)
