The maximum feasible subset problem (maxFS) and applications
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1342119
- Maximization of submodular functions: theory and enumeration algorithms
- The approximation of maximum subgraph problems
- Fast heuristics for the maximum feasible subsystem problem
- scientific article; zbMATH DE number 1552232
- scientific article; zbMATH DE number 6381632
- Near-optimal algorithms for maximum constraint satisfaction problems
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
Cites work
- A bounded-error approach to piecewise affine system identification
- A note on resolving infeasibility in linear programs by constraint relaxation
- A Parametric Optimization Method for Machine Learning
- A survey of compressed sensing
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Algorithms and applications for approximate nonnegative matrix factorization
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Compressed sensing
- Consistency, redundancy, and implied equalities in linear systems
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Exact and approximate sparse solutions of underdetermined linear equations
- Fast heuristics for the maximum feasible subsystem problem
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Handbook of combinatorial optimization. In 5 volumes
- scientific article; zbMATH DE number 2186837 (Why is no real title available?)
- scientific article; zbMATH DE number 825000 (Why is no real title available?)
- scientific article; zbMATH DE number 2246589 (Why is no real title available?)
- Large-scale linear programming techniques for the design of protein folding potentials
- Matching pursuits with time-frequency dictionaries
- Misclassification minimization
- On the approximability of the maximum interval constrained coloring problem
- On the complexity of nonnegative matrix factorization
- Operations research and health care. A handbook of methods and applications.
- Optimization approaches to supervised classification
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Some approaches to the solution of optimization problems in supervised learning
- Some NP-complete problems in quadratic and nonlinear programming
- Some results concerning post-infeasibility analysis
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
- The MIN PFS problem and piecewise linear model estimation
Cited in
(12)- Maxima units search (MUS) algorithm: methodology and applications
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Faster maximum feasible subsystem solutions for dense constraint matrices
- Augmenting approach for some maximum set problems
- Fast heuristics for the maximum feasible subsystem problem
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- scientific article; zbMATH DE number 1342119 (Why is no real title available?)
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Human-centred feasibility restoration in practice
- Cardinality minimization, constraints, and regularization: a survey
This page was built for publication: The maximum feasible subset problem (maxFS) and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5884385)
