Solving systems of linear one-sided equations in integer monoid and group rings
Abstract
References
Index Terms
- Solving systems of linear one-sided equations in integer monoid and group rings
Recommendations
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) problem by first reformulating a QP as a linear complementary problem, and then using binary variables and big-M constraints to model its complementary ...
An interior point method for solving systems of linear equations and inequalities
A simple interior point method is proposed for solving a system of linear equations subject to nonnegativity constraints. The direction of update is defined by projection of the current solution on a linear manifold defined by the equations. ...
Analyzing Infeasible Mixed-Integer and Integer Linear Programs
<P>Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been developed in recent years, but few such tools exist for infeasible mixed-integer or integer linear programs. One approach that has proven especially ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 193Total Downloads
- Downloads (Last 12 months)17
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in