Pages that link to "Item:Q1380443"
From MaRDI portal
The following pages link to An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443):
Displaying 22 items.
- Some approaches to the solution of optimization problems in supervised learning (Q267571) (← links)
- A characterization of the 2-additive Choquet integral through cardinal information (Q429418) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
- An aggregation/disaggregation approach to obtain robust conclusions with ELECTRE TRI (Q1600914) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Optimization approaches to supervised classification (Q1753623) (← links)
- Resolving inconsistencies among constraints on the parameters of an MCDA model (Q1869532) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Infeasibility resolution based on goal programming (Q2459385) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- An Interactive Algorithm to Deal with Inconsistencies in the Representation of Cardinal Information (Q3163982) (← links)
- Locating Minimal Infeasible Constraint Sets in Linear Programs (Q4025905) (← links)
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs (Q4427364) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
