The complexity and approximability of finding maximum feasible subsystems of linear relations
From MaRDI portal
(Redirected from Publication:1367542)
Recommendations
Cites work
- scientific article; zbMATH DE number 3942804 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1256665 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A well-characterized approximation problem
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
- Approaches to Diagnosing Infeasible Linear Programs
- Approximate solution of NP optimization problems
- Approximation algorithms for combinatorial problems
- Completeness in approximation classes
- Derandomized graph products
- Efficient probabilistically checkable proofs and applications to approximations
- Explicit construction of linear sized tolerant networks
- Logical definability of NP optimization problems
- On Syntactic versus Computational Views of Approximability
- On the Approximation of Maximum Satisfiability
- On the complexity of approximating the independent set problem
- On the hardness of approximating minimization problems
- Optimization, approximation, and complexity classes
- Polynomially bounded minimization problems which are hard to approximate
- Quantifiers and approximation
- Ramanujan graphs
- The densest hemisphere problem
- Trees and hills: methodology for maximizing functions of systems of linear relations
Cited in
(54)- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Cardinality minimization, constraints, and regularization: a survey
- The MaxSAT problem in the real-valued MV-algebra
- Maximizing agreements with one-sided error with applications to heuristic learning
- Towards Finding Maximal Subrelations with Desired Properties
- On optimal zero-preserving corrections for inconsistent linear systems
- Faster maximum feasible subsystem solutions for dense constraint matrices
- Quantile-based iterative methods for corrupted systems of linear equations
- Error-free and best-fit extensions of partially defined Boolean functions
- Irreducible infeasible sets in convex mixed-integer programs
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Some APX-completeness results for cubic graphs
- Maximizing agreements with one-sided error with applications to heuristic learning
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- On the establishment of distinct identities in overlay networks
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey
- Robust fitting in computer vision: easy or hard?
- On the difficulty of approximately maximizing agreements.
- The generalized definitions of the two-dimensional largest common substructure problems
- Mechanisms for information elicitation
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- Finding maximum linear subsystems of nonlinear systems with outputs
- Covering linear programming with violations
- Inapproximability results for equations over infinite groups
- Maximizing agreements and coagnostic learning
- The maximum feasible subset problem (maxFS) and applications
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Derandomized graph products
- On the largest input-output linearizable subsystem
- A local Vapnik-Chervonenkis complexity
- On the hardness of approximating shortest integer relations among rational numbers
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Complexity and approximability of parameterized MAX-CSPs
- Public Bayesian persuasion: being almost optimal and almost persuasive
- Optimization approaches to supervised classification
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- The MIN PFS problem and piecewise linear model estimation
- Applications of regularized least squares to pattern classification
- Distinguishing string selection problems.
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Robust regression via error tolerance
- Integer programming as a framework for optimization and approximability
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Sublinear P system solutions to NP-complete problems
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Global optimization for low-dimensional switching linear regression and bounded-error estimation
- Approximating maximum satisfiable subsystems of linear equations of bounded width
- On approximate learning by multi-layered feedforward circuits
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- On a class of optimization problems with no ``efficiently computable solution
- Logical analysis of binary data with missing bits
This page was built for publication: The complexity and approximability of finding maximum feasible subsystems of linear relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367542)
