Pages that link to "Item:Q4296521"
From MaRDI portal
The following pages link to The Minimum Satisfiability Problem (Q4296521):
Displayed 18 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- On reoptimizing multi-class classifiers (Q1009262) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
- Subset-conjunctive rules for breast cancer diagnosis (Q2489654) (← links)
- Quantum computation techniques for gauging reliability of interval and fuzzy data (Q3086372) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)