The maximum feasible subset problem (maxFS) and applications
type: Item
instance of: scholarly article
title: The maximum feasible subset problem (maxFS) and applications
DOI: 10.1080/03155986.2019.1607715
author: John W. Chinneck
published in: INFOR: Information Systems and Operational Research
publication date: 2023-03-20T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7665819
zbMATH Keywords: maximum feasible subset problem
zbMATH Keywords: maxfs
zbMATH Keywords: infeasibility analysis
zbMATH Keywords: minULR
zbMATH Keywords: IIS
describes a project that uses: UCI-ml
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/03155986.2019.1607715
OpenAlex ID: W2948135333
Wikidata QID: Q127757732
cites work: The MIN PFS problem and piecewise linear model estimation
cites work: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
cites work: A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: A bounded-error approach to piecewise affine system identification
cites work: A Parametric Optimization Method for Machine Learning
cites work: Algorithms and applications for approximate nonnegative matrix factorization
cites work: A Survey of Compressed Sensing
cites work: On the approximability of the maximum interval constrained coloring problem
cites work: Some results concerning post-infeasibility analysis
cites work: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
cites work: Fast heuristics for the maximum feasible subsystem problem
cites work: Feasibility and infeasibility in optimization. Algorithms and computational methods.
cites work: Compressed sensing
cites work: Q5717952
cites work: Handbook of Combinatorial Optimization
cites work: Consistency, redundancy, and implied equalities in linear systems
cites work: Operations research and health care. A handbook of methods and applications.
cites work: Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
cites work: Some approaches to the solution of optimization problems in supervised learning
cites work: Matching pursuits with time-frequency dictionaries
cites work: Misclassification minimization
cites work: The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: Finding the minimum weight IIS cover of an infeasible system of linear inequalities
cites work: Q3023951
cites work: Branch-and-Cut for the Maximum Feasible Subsystem Problem
cites work: A note on resolving infeasibility in linear programs by constraint relaxation
cites work: Optimization approaches to supervised classification
cites work: Dual averaging with adaptive random projection for solving evolving distributed optimization problems
cites work: On the Complexity of Nonnegative Matrix Factorization
cites work: Large-scale linear programming techniques for the design of protein folding potentials
cites work: Q4858101
Recommended article: Q4263701
Recommended article: Maximization of submodular functions: theory and enumeration algorithms
Recommended article: The approximation of maximum subgraph problems
Recommended article: Fast heuristics for the maximum feasible subsystem problem
Recommended article: Q4524463
Recommended article: Q2934583
Recommended article: Near-optimal algorithms for maximum constraint satisfaction problems
Recommended article: Q3129924
Recommended article: Approximation algorithms for the maximum satisfiability problem
description: scientific article; zbMATH DE number 7665819