Pages that link to "Item:Q4296521"

The following pages link to The Minimum Satisfiability Problem (Q4296521):

Displaying 35 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)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• Optimizing with minimum satisfiability (Q1761303) (← links)
• Stabilizing network bargaining games by blocking players (Q1801001) (← links)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
• A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
• Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
• On the intractability landscape of digraph intersection representations (Q2169961) (← links)
• A non-clausal tableau calculus for \textsc{MinSat} (Q2234795) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
• Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case (Q2415359) (← links)
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
• Subset-conjunctive rules for breast cancer diagnosis (Q2489654) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• (Q2762521) (← links)
• The Minimum Oracle Circuit Size Problem. (Q2954981) (← 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)
• On dependent randomized rounding algorithms (Q4645933) (← links)
• The computational complexity of the pooling problem (Q5964238) (← links)
• Robust optimization with belief functions (Q6116536) (← links)
• Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
• The no-meet matroid (Q6558676) (← links)