Pages that link to "Item:Q3820348"
From MaRDI portal
The following pages link to Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348):
Displaying 21 items.
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- A composite algorithm for a concave-cost network flow problem (Q3827773) (← links)
- Time-partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot-sizing problems (Q4266754) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- A branch-and-price algorithm for switch-box routing (Q4785215) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- (Q5009490) (← links)
- An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- (Q5743427) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)
- Faster algorithms for Steiner tree and related problems: from theory to practice (Q6606515) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)