scientific article; zbMATH DE number 3880440

MaRDI QIDQ3346090zbMATH OpenFDO

Authors R. Chandrasekaran

Publication date 1984

zbMATH Keywords

linear integer problemrounding type algorithm

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A rounding algorithm for integer programs
• scientific article; zbMATH DE number 125490
• scientific article; zbMATH DE number 1380414
• A note on an integer programming problem that has a linear programming solution
• On integer fractional linear programming

Cited in

(10)

• Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
• The Linear Complementarity Problems with a Few Variables per Constraint
• An extension of a theorem of Fulkerson and Gross
• Trichotomy for integer linear systems based on their sign patterns
• A combinatorial algorithm for Horn programs
• Total dual integrality of the linear complementarity problem
• A rounding algorithm for integer programs
• Parametric formulation of the general integer linear programming problem
• Simple majority rule and integer programming
• On exact selection of minimally unsatisfiable subformulae

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346090)