The maximum feasible subset problem (maxFS) and applications
From MaRDI portal
Publication:5884385
DOI10.1080/03155986.2019.1607715OpenAlexW2948135333WikidataQ127757732 ScholiaQ127757732MaRDI QIDQ5884385
Publication date: 20 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2019.1607715
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some approaches to the solution of optimization problems in supervised learning
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Algorithms and applications for approximate nonnegative matrix factorization
- Some results concerning post-infeasibility analysis
- Misclassification minimization
- The MIN PFS problem and piecewise linear model estimation
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Consistency, redundancy, and implied equalities in linear systems
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- On the approximability of the maximum interval constrained coloring problem
- Optimization approaches to supervised classification
- Large-scale linear programming techniques for the design of protein folding potentials
- Operations research and health care. A handbook of methods and applications.
- A note on resolving infeasibility in linear programs by constraint relaxation
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Fast Heuristics for the Maximum Feasible Subsystem Problem
- A Survey of Compressed Sensing
- On the Complexity of Nonnegative Matrix Factorization
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Some NP-complete problems in quadratic and nonlinear programming
- A Parametric Optimization Method for Machine Learning
- Matching pursuits with time-frequency dictionaries
- Handbook of Combinatorial Optimization
- Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
- A bounded-error approach to piecewise affine system identification
- The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
- Compressed sensing
This page was built for publication: The maximum feasible subset problem (maxFS) and applications
