Extending linear relaxation for non-square matrices and soft constraints
From MaRDI portal
(Redirected from Publication:738985)
Recommendations
- A Mathematical Model for the Motion of a Towed Pipeline Bundle
- Hildreth's algorithm with applications to soft constraints for user interface layout
- scientific article; zbMATH DE number 2080309
- scientific article; zbMATH DE number 24371
- Relaxation methods for solving linear inequality systems: converging results
Cites work
- scientific article; zbMATH DE number 412110 (Why is no real title available?)
- scientific article; zbMATH DE number 4215268 (Why is no real title available?)
- scientific article; zbMATH DE number 4162300 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 1178942 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2080309 (Why is no real title available?)
- scientific article; zbMATH DE number 1853005 (Why is no real title available?)
- scientific article; zbMATH DE number 3325215 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A foundation of solution methods for constraint hierarchies
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Algorithms for Weighted Boolean Optimization
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Current approaches for solving over-constrained problems
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Domain specific high-level constraints for user interface layout
- Exploiting Cycle Structures in Max-SAT
- Fast heuristics for the maximum feasible subsystem problem
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Iterative Solution Methods
- Iterative least-squares solutions of coupled sylvester matrix equations
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Methods of conjugate gradients for solving linear systems
- Minimaxsat: an efficient weighted Max-SAT solver
- Misclassification minimization
- Numerical linear algebra and applications
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Preconditioning techniques for large linear systems: A survey
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Extending linear relaxation for non-square matrices and soft constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738985)
