Pages that link to "Item:Q5558173"

The following pages link to Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities (Q5558173):

Displaying 28 items.

• Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
• A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
• Regions of Petri nets with a/sync connections (Q714824) (← links)
• Applying regions (Q728281) (← links)
• A heuristic approach for the continuous error localization problem in data cleaning (Q868999) (← links)
• Multiple objective linear programming models with interval coefficients -- an illustrated overview (Q877639) (← links)
• Unrestricted variables in linear programming (Q915645) (← links)
• Designing two factor experiments for selecting interactions (Q1151208) (← links)
• Cutting-plane theory: Algebraic methods (Q1257827) (← links)
• A general algorithm for determining all essential solutions and inequalities for any convex polyhedron (Q1339125) (← links)
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
• Flux balance analysis: a geometric perspective (Q1620823) (← links)
• Combinatorial optimization and small polytopes (Q1814809) (← links)
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
• The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
• Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
• How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
• Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution (Q2197166) (← links)
• Universal Lyapunov functions for non-linear reaction networks (Q2207087) (← links)
• PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
• Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
• Binary choice models with discrete regressors: identification and misspecification (Q2448407) (← links)
• Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
• Automatic Editing for Business Surveys: An Assessment of Selected Algorithms (Q3421327) (← links)
• Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables (Q5136075) (← links)
• О безопасности схемы биометрической аутентификации, основанной на нейронной сети (Q5152356) (← links)