The following pages link to (Q4263701):
Displayed 11 items.
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- (Q2741521) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)