Surrogate constraint methods for linear inequalities
From MaRDI portal
Recommendations
- Surrogate methods for linear inequalities
- Surrogate Constraints in Integer Programming
- scientific article; zbMATH DE number 1782269
- The parallel surrogate constraint approach to the linear feasibility problem
- scientific article; zbMATH DE number 1497345
- scientific article; zbMATH DE number 3982927
- scientific article; zbMATH DE number 3963578
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- scientific article; zbMATH DE number 3961344
- scientific article; zbMATH DE number 3936945
Cited in
(10)- New iterative methods for linear inequalities
- Surrogate methods for linear inequalities
- scientific article; zbMATH DE number 3961344 (Why is no real title available?)
- scientific article; zbMATH DE number 3963578 (Why is no real title available?)
- Constraint Generation and Surrogate Relaxation
- The parallel surrogate constraint approach to the linear feasibility problem
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Exploiting nested inequalities and surrogate constraints
- Iterative method for solving the linear feasibility problem
- Surrogate constraint normalization for the set covering problem
This page was built for publication: Surrogate constraint methods for linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035630)