Uniqueness of integer solution of linear equations
From MaRDI portal
Publication:601980
DOI10.1007/S11590-010-0183-0zbMATH Open1202.90196OpenAlexW2163200662MaRDI QIDQ601980FDOQ601980
Authors: O. 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
Recommendations
- Probability of unique integer solution to a system of linear equations
- Integer solutions to interval linear equations and unique measurement
- On the uniqueness of solutions to linear programs
- scientific article; zbMATH DE number 962469
- On the uniqueness of the optimal solution in the linear programming
Cites Work
- Uniqueness of solution in linear programming
- Introduction to global optimization
- An Algorithm for Large Zero-One Knapsack Problems
- NP is as easy as detecting unique solutions
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Probability of unique integer solution to a system of linear equations
- Title not available (Why is that?)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
Cited In (6)
- On the compression of linear algebraic equation system
- Rational elimination algorithm and applications
- Title not available (Why is that?)
- On the uniqueness of solutions to linear programs
- Probability of unique integer solution to a system of linear equations
- Integer solutions to interval linear equations and unique measurement
Uses Software
This page was built for publication: Uniqueness of integer solution of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601980)
