Pages that link to "Item:Q579125"

The following pages link to A note on detecting simple redundancies in linear systems (Q579125):

Displaying 13 items.

• Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• The structure of bases in bicircular matroids (Q912110) (← links)
• On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
• A constraint selection technique for a class of linear programs (Q1105487) (← links)
• A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
• Uncovering generalized-network structure in matrices (Q1308737) (← links)
• A constraint selection technique in limit analysis (Q1823877) (← links)
• Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• Nonseparating Cocircuits in Binary Matroids (Q5020847) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
• Presolving linear bilevel optimization problems (Q6169995) (← links)