Pages that link to "Item:Q756930"

The following pages link to An O(n log n)-algorithm for solving a special class of linear programs (Q756930):

Displaying 8 items.

• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
• An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure (Q1073717) (← links)
• An efficient algorithm for solving a special class of LP's (Q1074311) (← links)
• An algorithm for solving a structured class of linear programming problems (Q1078069) (← links)
• Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
• A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773) (← links)
• A decision procedure for linear ``big O'' equations (Q2642465) (← links)
• A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension (Q5691289) (← links)