Pages that link to "Item:Q4080986"

The following pages link to Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (Q4080986):

Displaying 10 items.

• Non-standard approaches to integer programming (Q697562) (← links)
• Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
• An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
• A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
• Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
• Balancing problems in acyclic networks (Q1327220) (← links)
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Iterative Compression and Exact Algorithms (Q3599139) (← links)