Fast Heuristics for the Maximum Feasible Subsystem Problem
From MaRDI portal
Publication:2884507
DOI10.1287/ijoc.13.3.210.12632zbMath1238.90093OpenAlexW2082030917MaRDI QIDQ2884507
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.13.3.210.12632
Related Items (20)
The maximum feasible subset problem (maxFS) and applications ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures ⋮ Error correction for massive datasets ⋮ Solution techniques for the large set covering problem ⋮ Faster maximum feasible subsystem solutions for dense constraint matrices ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Heuristic algorithms in computational molecular biology ⋮ A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ Repairing MIP infeasibility through local branching ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Optimization approaches to supervised classification ⋮ Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ Extending linear relaxation for non-square matrices and soft constraints ⋮ Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions ⋮ Mathematical programming based heuristics for improving LP-generated classifiers for the multiclass supervised classification problem ⋮ Hildreth's algorithm with applications to soft constraints for user interface layout
This page was built for publication: Fast Heuristics for the Maximum Feasible Subsystem Problem
