Pages that link to "Item:Q1367542"
From MaRDI portal
The following pages link to The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542):
Displaying 50 items.
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Inapproximability results for equations over infinite groups (Q974745) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- Global optimization for low-dimensional switching linear regression and bounded-error estimation (Q1640233) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Optimization approaches to supervised classification (Q1753623) (← links)
- Derandomized graph products (Q1842777) (← links)
- On the establishment of distinct identities in overlay networks (Q1954205) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Robust regression via error tolerance (Q2134056) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Robust fitting in computer vision: easy or hard? (Q2193856) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- A local Vapnik-Chervonenkis complexity (Q2281678) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Applications of regularized least squares to pattern classification (Q2381579) (← links)
- Mechanisms for information elicitation (Q2389691) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- On a class of optimization problems with no ``efficiently computable'' solution (Q2628942) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- Finding maximum linear subsystems of nonlinear systems with outputs (Q2730229) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On the largest input-output linearizable subsystem (Q4875964) (← links)
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey (Q4969627) (← links)
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs (Q5060524) (← links)
- Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations (Q5071437) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions (Q5241241) (← links)
- Towards Finding Maximal Subrelations with Desired Properties (Q5410494) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
