Uniqueness of integer solution of linear equations

DOI10.1007/s11590-010-0183-0zbMath1202.90196OpenAlexW2163200662MaRDI QIDQ601980

Olvi L. Mangasarian, Michael C. Ferris

Publication date: 29 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0183-0

zbMATH Keywords

absolute value equations

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Probability of unique integer solution to a system of linear equations, Rational elimination algorithm and applications

Uses Software

• Matlab
• CPLEX

Cites Work

• Unnamed Item
• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• NP is as easy as detecting unique solutions
• Uniqueness of solution in linear programming
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Introduction to global optimization
• Probability of unique integer solution to a system of linear equations
• An Algorithm for Large Zero-One Knapsack Problems