A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale linear programming techniques for the design of protein folding potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MIN PFS problem and piecewise linear model estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Heuristics for the Maximum Feasible Subsystem Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Codes for the Analysis of Infeasible Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to Diagnosing Infeasible Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the minimum weight IIS cover of an infeasible system of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for terrestrial digital broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametric Optimization Method for Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results concerning post-infeasibility analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on resolving infeasibility in linear programs by constraint relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer classification problems by decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple but powerful goal programming models for discriminant problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of a robust mixed-integer approach to existing methods for establishing classification rules for the discriminant problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Misclassification minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity embedded in nonconvex programs / rank
 
Normal rank

Latest revision as of 11:40, 27 June 2024

scientific article
Language Label Description Also known as
English
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
scientific article

    Statements

    A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2007
    0 references
    linear inequality system
    0 references
    maximum feasible subsystem
    0 references
    bilinear formulation
    0 references
    linearization
    0 references
    variable fixing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers