On the public citation graph

Improved Exact Solver for the Weighted MAX-SAT Problem

https://doi.org/10.29007/38lm
0 signed · 87 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751_31openalex-snapshot
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_18openalex-snapshot
On Inconsistent Clause-Subsets for Max-SAT Solving
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_43openalex-snapshot
Exploiting Cycle Structures in Max-SAT
inferredcites →https://doi.org/10.1016/j.artint.2007.05.006openalex-snapshot
A logical approach to efficient Max-SAT solving
inferredcites →https://doi.org/10.1016/j.cor.2004.09.030openalex-snapshot
Semidefinite programming based approaches to the break minimization problem
inferredcites →https://doi.org/10.1016/s0004-3702(01)00159-xopenalex-snapshot
Algorithm for optimal winner determination in combinatorial auctions
inferredcites →https://doi.org/10.1109/iccad.2001.968634openalex-snapshot
Efficient conflict driven learning in a Boolean satisfiability solver
inferredcites →https://doi.org/10.1109/tcad.2003.811450openalex-snapshot
Sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing
inferredcites →https://doi.org/10.1287/opre.1040.0189openalex-snapshot
Optimal Protein Structure Alignment Using Maximum Cliques
inferredcites →https://doi.org/10.7936/k74j0cb1openalex-snapshot
An Algorithm for Optimal Winner Determination in Combinatorial Auctions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-14082-3_9openalex-snapshot
Flight Gate Assignment with a Quantum Annealer
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_6openalex-snapshot
Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_16openalex-snapshot
Inference in MaxSAT and MinSAT
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_22openalex-snapshot
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_14openalex-snapshot
Antichain-Based QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-28067-2_10openalex-snapshot
Analyzing Pathways Using ASP-Based Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_40openalex-snapshot
Natural Max-SAT Encoding of Min-SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_13openalex-snapshot
Exploiting the Power of mip Solvers in maxsat
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_12openalex-snapshot
Improving WPM2 for (Weighted) Partial MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_21openalex-snapshot
Postponing Optimization to Speed Up MAXSAT Solving
inferred← citeshttps://doi.org/10.1007/s10462-020-09908-4openalex-snapshot
Stochastic local search for Partial Max-SAT: an experimental evaluation
inferred← citeshttps://doi.org/10.1007/s10601-013-9146-2openalex-snapshot
Iterative and core-guided MaxSAT solving: A survey and assessment
inferred← citeshttps://doi.org/10.1007/s10732-015-9300-7openalex-snapshot
Exploiting subproblem optimization in SAT-based MaxSAT algorithms
inferred← citeshttps://doi.org/10.1007/s10844-016-0422-7openalex-snapshot
Constraint-based and SAT-based diagnosis of automotive configuration problems
inferred← citeshttps://doi.org/10.1007/s11390-013-1325-5openalex-snapshot
A Taxonomy of Exact Methods for Partial Max-SAT
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.004openalex-snapshot
Optimizing with minimum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2014.03.005openalex-snapshot
Computational protein design as an optimization problem
inferred← citeshttps://doi.org/10.1016/j.artint.2015.12.006openalex-snapshot
MaxSAT by improved instance-specific algorithm configuration
inferred← citeshttps://doi.org/10.1016/j.artint.2016.11.001openalex-snapshot
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.003openalex-snapshot
WPM3: An (in)complete algorithm for weighted partial MaxSAT
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103397openalex-snapshot
Understanding the power of Max-SAT resolution through UP-resilience
inferred← citeshttps://doi.org/10.1016/j.cogsys.2024.101291openalex-snapshot
Optimizing resource allocation in home care services using MaxSAT
inferred← citeshttps://doi.org/10.1016/j.cor.2013.04.009openalex-snapshot
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107195openalex-snapshot
Solving weighted Maximum Satisfiability with Branch and Bound and clause learning
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.028openalex-snapshot
Generalized k -ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.001openalex-snapshot
Book drawings of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.physrep.2024.03.002openalex-snapshot
A review on Quantum Approximate Optimization Algorithm and its variants
inferred← citeshttps://doi.org/10.1038/nphys2900openalex-snapshot
Evidence for quantum annealing with more than one hundred qubits
inferred← citeshttps://doi.org/10.1038/s41598-019-43176-9openalex-snapshot
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
inferred← citeshttps://doi.org/10.1038/s41598-025-13923-2openalex-snapshot
Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
inferred← citeshttps://doi.org/10.1088/1367-2630/16/4/045006openalex-snapshot
Max 2-SAT with up to 108 qubits
inferred← citeshttps://doi.org/10.1088/1367-2630/ada572openalex-snapshot
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
inferred← citeshttps://doi.org/10.1088/2058-9565/ac6973openalex-snapshot
Evaluation of QAOA based on the approximation ratio of individual samples
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004370openalex-snapshot
Toward an efficient, highly scalable maximum clique solver for massive graphs
inferred← citeshttps://doi.org/10.1109/csci.2017.21openalex-snapshot
Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming
inferred← citeshttps://doi.org/10.1109/ecce50734.2022.9948058openalex-snapshot
Quantum Approximate Optimization Algorithm-Enabled DER Disturbance Analysis of Networked Microgrids
inferred← citeshttps://doi.org/10.1109/ictai.2012.129openalex-snapshot
Iterative SAT Solving for Minimum Satisfiability
inferred← citeshttps://doi.org/10.1109/ictai.2013.142openalex-snapshot
Model-Guided Approaches for MaxSAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2013.51openalex-snapshot
Using MaxSAT to Correct Errors in AES Key Schedule Images
inferred← citeshttps://doi.org/10.1109/ictai.2016.0075openalex-snapshot
Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00032openalex-snapshot
Towards Bridging the Gap Between SAT and Max-SAT Refutations
inferred← citeshttps://doi.org/10.1109/ictai52525.2021.00101openalex-snapshot
Inferring Clauses and Formulas in Max-SAT
inferred← citeshttps://doi.org/10.1109/itec53557.2022.9813820openalex-snapshot
Dynamics Analysis of Microgrids Integrated with EV Charging Stations based on Quantum Approximate Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/smc-it.2014.14openalex-snapshot
A Quantum Approach to Diagnosis of Multiple Faults in Electrical Power Systems
inferred← citeshttps://doi.org/10.1109/tc.2014.2346196openalex-snapshot
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/tits.2019.2891235openalex-snapshot
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
inferred← citeshttps://doi.org/10.1109/tqe.2020.3012068openalex-snapshot
Subdivided Phase Oracle for NISQ Search Algorithms
inferred← citeshttps://doi.org/10.1137/120886777openalex-snapshot
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
inferred← citeshttps://doi.org/10.1140/epjst/e2015-02347-yopenalex-snapshot
A quantum annealing approach for fault detection and diagnosis of graph-based systems
inferred← citeshttps://doi.org/10.1142/9781786348210_0010openalex-snapshot
Quantum Machine Learning
inferred← citeshttps://doi.org/10.1145/3464420openalex-snapshot
Benchmarking Quantum Computers and the Impact of Quantum Noise
inferred← citeshttps://doi.org/10.13039/501100003176openalex-snapshot
Finding safe policies in model-based active learning
inferred← citeshttps://doi.org/10.1371/journal.pone.0164513openalex-snapshot
Evaluating Transcription Factor Activity Changes by Scoring Unexplained Target Genes in Expression Data
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.1781openalex-snapshot
MaxSAT Encoding for MC-Net-Based Coalition Structure Generation Problem with Externalities
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.1812openalex-snapshot
Extending MaxSAT to Solve the Coalition Structure Generation Problem with Externalities Based on Agent Relations
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8790openalex-snapshot
Generating Content for Scenario-Based Serious-Games Using CrowdSourcing
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9124openalex-snapshot
Maximum Satisfiability Using Core-Guided MaxSAT Resolution
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9128openalex-snapshot
MaxSAT by Improved Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1613/jair.1.13811openalex-snapshot
Proofs and Certificates for Max-SAT
inferred← citeshttps://doi.org/10.1613/jair.4953openalex-snapshot
An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.21236/ada605962openalex-snapshot
A Quantum Computing Approach to Model Checking for Advanced Manufacturing Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2022/739openalex-snapshot
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/ijcai.2023/787openalex-snapshot
Proofs and Certificates for Max-SAT (Extended Abstract)
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-303openalex-snapshot
Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning
inferred← citeshttps://doi.org/10.3233/aic-140636openalex-snapshot
MaxSAT-based encodings for Group MaxSAT
inferred← citeshttps://doi.org/10.3233/aic-2012-0527openalex-snapshot
Solving disjunctive temporal problems with preferences using maximum satisfiability
inferred← citeshttps://doi.org/10.3233/aic-210178openalex-snapshot
Boosting branch-and-bound MaxSAT solvers with clause learning
inferred← citeshttps://doi.org/10.3233/sat190104openalex-snapshot
ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
inferred← citeshttps://doi.org/10.37236/6862openalex-snapshot
Large Cuts with Local Algorithms on Triangle-Free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5034openalex-snapshot
Using the Crowd to Generate Content for Scenario-Based Serious-Games
inferred← citeshttps://doi.org/10.48550/arxiv.1403.2150openalex-snapshot
Constraint-based Causal Discovery from Multiple Interventions over Overlapping Variable Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06096openalex-snapshot
Unsatisfiable Cores and Lower Bounding for Constraint Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1811.09465openalex-snapshot
Flight Gate Assignment with a Quantum Annealer
inferred← citeshttps://doi.org/10.48550/arxiv.2101.07813openalex-snapshot
Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms
inferred← citeshttps://doi.org/10.5220/0005679102800287openalex-snapshot
Exposing Design Mistakes During Requirements Engineering by Solving Constraint Satisfaction Problems to Obtain Minimum Correction Subsets
inferred← citeshttps://doi.org/10.70675/90961a35z8128z45eaz9859z1d246d7621d4openalex-snapshot
Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.