Fast heuristics for the maximum feasible subsystem problem

DOI10.1287/IJOC.13.3.210.12632MaRDI QIDQ2884507zbMATH OpenOpenAlexFDO

Authors John W. Chinneck

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

zbMATH Keywords

artificial intelligenceheuristic analysis of algorithmslinear programming

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Faster maximum feasible subsystem solutions for dense constraint matrices
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• The maximum feasible subset problem (maxFS) and applications
• scientific article; zbMATH DE number 1342119

Cited in

(22)

• The MIN PFS problem and piecewise linear model estimation
• 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
• Hildreth's algorithm with applications to soft constraints for user interface layout
• Repairing MIP infeasibility through local branching
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Mathematical programming based heuristics for improving LP-generated classifiers for the multiclass supervised classification problem
• Faster maximum feasible subsystem solutions for dense constraint matrices
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
• Implementing conflict resolution
• Preferential reducts and constructs in robust multiple criteria ranking and sorting
• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
• Error correction for massive datasets
• The maximum feasible subset problem (maxFS) and applications
• Heuristics for Finding Sparse Solutions of Linear Inequalities
• Heuristic algorithms in computational molecular biology
• Cardinality minimization, constraints, and regularization: a survey
• Extending linear relaxation for non-square matrices and soft constraints
• Solution techniques for the large set covering problem

This page was built for publication: Fast heuristics for the maximum feasible subsystem problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884507)