Pages that link to "Item:Q811875"

The following pages link to Edge-directions of standard polyhedra with applications to network flows (Q811875):

Displaying 6 items.

• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
• The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
• The partition bargaining problem (Q2473040) (← links)