On the public citation graph
Algorithms for the maximum satisfiability problem
0 signed · 363 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/978-94-011-7557-9_2openalex-snapshot
Les Procedures D’exploration et D’optimisation par Separation Et Evaluation
inferredcites →https://doi.org/10.1007/bf00940812openalex-snapshot
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
inferredcites →https://doi.org/10.1007/bf01531073openalex-snapshot
The tabu search metaheuristic: How we used it
inferredcites →https://doi.org/10.1007/bf01580586openalex-snapshot
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1016/0020-0190(76)90079-xopenalex-snapshot
A cascade algorithm for the logical closure of a set of binary relations
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0020-0190(86)90136-5openalex-snapshot
Resolution deduction to detect satisfiability for another class including non-horn sentences in propositional logic
inferredcites →https://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferredcites →https://doi.org/10.1016/0020-0190(87)90200-6openalex-snapshot
An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
inferredcites →https://doi.org/10.1016/0166-218x(84)90081-7openalex-snapshot
A simplified NP-complete satisfiability problem
inferredcites →https://doi.org/10.1016/0196-6774(82)90022-0openalex-snapshot
Algorithmic extremal problems in combinatorial optimization
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1016/0377-2217(84)90231-5openalex-snapshot
A thermodynamically motivated simulation procedure for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/0743-1066(85)90020-2openalex-snapshot
Integrity constraints in logic databases
inferredcites →https://doi.org/10.1016/s0019-9958(83)80027-8openalex-snapshot
The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0167-5060(08)70343-1openalex-snapshot
Methods of Nonlinear 0-1 Programming
inferredcites →https://doi.org/10.1017/s0021900200031387openalex-snapshot
Simulated annealing methods with general acceptance probabilities
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322248.322260openalex-snapshot
Complexity of Partial Satisfaction
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.1.3.137openalex-snapshot
Input Proofs and Rank One Cutting Planes
inferredcites →https://doi.org/10.4153/cjm-1973-048-xopenalex-snapshot
Some Extremal Properties of Bipartite Subgraphs
inferredcites →https://doi.org/10.4153/cjm-1982-036-8openalex-snapshot
A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199909)34:2<162::aid-net9>3.0.co;2-9openalex-snapshot
A tabu search heuristic for the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1002/1520-6750(199304)40:3<373::aid-nav3220400307>3.0.co;2-aopenalex-snapshot
Global minimization of indefinite quadratic functions subject to box constraints
inferred← citeshttps://doi.org/10.1002/1520-684x(200103)32:3<33::aid-scj4>3.0.co;2-popenalex-snapshot
On metaheuristic algorithms for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1002/9781118600207.ch14openalex-snapshot
Local Search: Complexity and Approximation
inferred← citeshttps://doi.org/10.1002/9781118755815.ch05openalex-snapshot
Construction of Energy Functions for Lattice Heteropolymer Models: Efficient Encodings for Constraint Satisfaction Programming and Quantum Annealing
inferred← citeshttps://doi.org/10.1002/9781119005353.ch14openalex-snapshot
Local Search: Complexity and Approximation
inferred← citeshttps://doi.org/10.1002/int.1064openalex-snapshot
An artificial neural network satisfiability tester
inferred← citeshttps://doi.org/10.1002/mde.4090110512openalex-snapshot
Artificial intelligence, heuristic frameworks and tabu search
inferred← citeshttps://doi.org/10.1002/net.10081openalex-snapshot
Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search
inferred← citeshttps://doi.org/10.1002/sys.21370openalex-snapshot
Patterns in System Architecture Decisions
inferred← citeshttps://doi.org/10.1006/jagm.1994.1045openalex-snapshot
On the Approximation of Maximum Satisfiability
inferred← citeshttps://doi.org/10.1006/jagm.2000.1075openalex-snapshot
New Upper Bounds for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1006/jcss.1998.1612openalex-snapshot
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0100openalex-snapshot
Parallel Satisfiability Test with Synchronous Simulated Annealing on Distributed-Memory Multiprocessor
inferred← citeshttps://doi.org/10.1007/0-306-47812-9_4openalex-snapshot
Genetic Algorithms for Incore Fuel Management and Other Recent Developments in Optimisation
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_195openalex-snapshot
Graph coloring; Greedy randomized adaptive search procedures; Heuristics for maximum clique and independent set; Replicator dynamics in combinatorial optimization HEURISTICS FOR MAXIMUM CLIQUE AND INDEPENDENT SET
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_277openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_1openalex-snapshot
Metaheuristic Agent Processes (MAPS)
inferred← citeshttps://doi.org/10.1007/0-387-29550-x_4openalex-snapshot
A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial
inferred← citeshttps://doi.org/10.1007/11427186_32openalex-snapshot
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/11427186_43openalex-snapshot
Efficient and Experimental Meta-heuristics for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1007/11527695_24openalex-snapshot
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
inferred← citeshttps://doi.org/10.1007/11564751_65openalex-snapshot
Test Instance Generation for MAX 2SAT
inferred← citeshttps://doi.org/10.1007/11671541_2openalex-snapshot
A Survey of Approximation Results for Local Search Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44868-3_57openalex-snapshot
Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/3-540-44868-3_58openalex-snapshot
Designing a Phenotypic Distance Index for Radial Basis Function Neural Networks
inferred← citeshttps://doi.org/10.1007/3-540-44886-1_12openalex-snapshot
Iterated Robust Tabu Search for MAX-SAT
inferred← citeshttps://doi.org/10.1007/3-540-44886-1_13openalex-snapshot
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
inferred← citeshttps://doi.org/10.1007/3-540-45034-3_60openalex-snapshot
Efficient Initial Solution to Extremal Optimization Algorithm for Weighted MAXSAT Problem
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_21openalex-snapshot
Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing
inferred← citeshttps://doi.org/10.1007/3-540-45400-4_5openalex-snapshot
Reactive Search for Traffic Grooming in WDM Networks
inferred← citeshttps://doi.org/10.1007/3-540-45517-5_5openalex-snapshot
Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_32openalex-snapshot
Improved Exact Algorithms for Max-Sat
inferred← citeshttps://doi.org/10.1007/3-540-46148-5_6openalex-snapshot
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
inferred← citeshttps://doi.org/10.1007/3-540-48747-6_16openalex-snapshot
Handling Inconsistency Efficiently in the Incremental Construction of Stratified Belief Bases
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_12openalex-snapshot
Some Prospects forEfficient Fixed Parameter Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-49795-1_19openalex-snapshot
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_5openalex-snapshot
New local search approximation techniques for maximum generalized satisfiability problems
inferred← citeshttps://doi.org/10.1007/3-540-61291-2_67openalex-snapshot
Enhancing maximum satisfiability algorithms with pure literal strategies
inferred← citeshttps://doi.org/10.1007/3-540-61551-2_75openalex-snapshot
Empirical studies of heuristic local search for constraint solving
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_14openalex-snapshot
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_264openalex-snapshot
Heuristics for Maximum Clique and Independent Set
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_364openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_18openalex-snapshot
Reactive Search Optimization: Learning While Optimizing
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_15openalex-snapshot
Binary Unconstrained Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_19openalex-snapshot
A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_15-1openalex-snapshot
QUBO: Quadratic Unconstrained Binary Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_20openalex-snapshot
Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-4329-9_3openalex-snapshot
Electric Generator Maintenance Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_29openalex-snapshot
Solving the Progressive Party Problem by Local Search
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_30openalex-snapshot
An Introduction to Variable Neighborhood Search
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-31423-1_7openalex-snapshot
Constraint Learning: An Appetizer
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_364-1openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-032-08977-9_16openalex-snapshot
Exploring the Configuration Space of BusyBox Vulnerabilities with CONFER
inferred← citeshttps://doi.org/10.1007/978-3-032-15455-2_3openalex-snapshot
Reactive Tabu Search for MAX-SAT, an Analysis of Sampling Strategies
inferred← citeshttps://doi.org/10.1007/978-3-032-28994-0_28openalex-snapshot
A Mixed Integer Programming Approach to Solve Probabilistic Argumentation Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-1openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-2openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-66266-4_19openalex-snapshot
SMT-Based Synthesis of Fault-Tolerant Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-77449-7_5openalex-snapshot
Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_15openalex-snapshot
Reactive Search Optimization: Learning While Optimizing
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_3openalex-snapshot
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot
Solving MaxSAT with Bit-Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_14openalex-snapshot
Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_17openalex-snapshot
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24621-3_9openalex-snapshot
Recombination Operators for Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_50openalex-snapshot
Efficient Strategies for (Weighted) Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-540-30217-9_6openalex-snapshot
Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_25openalex-snapshot
Solving Max-SAT as Weighted CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-78604-7_1openalex-snapshot
Adaptive Tabu Tenure Computation in Local Search
inferred← citeshttps://doi.org/10.1007/978-3-540-88636-5_4openalex-snapshot
Strength Two Covering Arrays Construction Using a SAT Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_26openalex-snapshot
A Theoretical Analysis of Search in GSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_19openalex-snapshot
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_6openalex-snapshot
Computing the Density of States of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_8openalex-snapshot
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_5openalex-snapshot
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_8openalex-snapshot
A Non-adaptive Stochastic Local Search Algorithm for the CHeSC 2011 Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_26openalex-snapshot
Partitioning Problems in Cluster Analysis: A Review of Mathematical Programming Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-55537-4_29openalex-snapshot
School Bus Routing and Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_54openalex-snapshot
Stochastic Local Search Algorithms: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_15openalex-snapshot
Phase Transition for Local Search on Planted SAT
inferred← citeshttps://doi.org/10.1007/978-3-662-62048-9_8openalex-snapshot
Datenqualität – Lebenselixier der Digitalisierung
inferred← citeshttps://doi.org/10.1007/978-3-662-67782-7_8openalex-snapshot
Data Quality—Lifeblood of Digitalization
inferred← citeshttps://doi.org/10.1007/978-3-662-73649-4_8openalex-snapshot
Datenqualität – Lebenselixier der Digitalisierung
inferred← citeshttps://doi.org/10.1007/978-3-7091-7535-4_89openalex-snapshot
Simulated Annealing Artificial Neural Networks for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-7908-1818-5_16openalex-snapshot
Computational Aspects of Probability Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_8openalex-snapshot
Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1007/bf00167526openalex-snapshot
Loading problems with tool management in flexible manufacturing systems: A few integer programming models
inferred← citeshttps://doi.org/10.1007/bf01328740openalex-snapshot
Heuristics for the design of part-orienting systems
inferred← citeshttps://doi.org/10.1007/bf01531072openalex-snapshot
Boolean query optimization and the 0-1 hyperbolic sum problem
inferred← citeshttps://doi.org/10.1007/bf01531073openalex-snapshot
The tabu search metaheuristic: How we used it
inferred← citeshttps://doi.org/10.1007/bf01719248openalex-snapshot
Strategies with memories: local search in an application oriented environment
inferred← citeshttps://doi.org/10.1007/bf02022095openalex-snapshot
Probabilistic bounds and algorithms for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02125460openalex-snapshot
Heuristic reliability optimization by tabu search
inferred← citeshttps://doi.org/10.1007/bf02592142openalex-snapshot
Resolution and the integrality of satisfiability problems
inferred← citeshttps://doi.org/10.1007/bf02618466openalex-snapshot
Clustering and clique partitioning: Simulated annealing and tabu search approaches
inferred← citeshttps://doi.org/10.1007/bfb0017440openalex-snapshot
Tabu search for maximal constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/bfb0027029openalex-snapshot
Local search in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bfb0098228openalex-snapshot
Randomness in heuristics: An experimental investigation for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/s00291-003-0153-3openalex-snapshot
A unified modeling and solution framework for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s00453-004-1145-7openalex-snapshot
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
inferred← citeshttps://doi.org/10.1007/s004530010074openalex-snapshot
Reactive Local Search for the Maximum Clique Problem1
inferred← citeshttps://doi.org/10.1007/s00521-023-08465-5openalex-snapshot
Group learning algorithm: a new metaheuristic algorithm
inferred← citeshttps://doi.org/10.1007/s10107-009-0285-6openalex-snapshot
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
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/s10472-005-7036-zopenalex-snapshot
Improving exact algorithms for MAX-2-SAT
inferred← citeshttps://doi.org/10.1007/s10472-011-9233-2openalex-snapshot
Boolean lexicographic optimization: algorithms & applications
inferred← citeshttps://doi.org/10.1007/s10472-015-9466-6openalex-snapshot
Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
inferred← citeshttps://doi.org/10.1007/s10479-006-0015-xopenalex-snapshot
A theoretical analysis of the cross-nested logit model
inferred← citeshttps://doi.org/10.1007/s10489-006-8514-7openalex-snapshot
An effective heuristic algorithm for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/s10489-009-0195-6openalex-snapshot
Boosting learning and inference in Markov logic through metaheuristics
inferred← citeshttps://doi.org/10.1007/s10489-020-01657-9openalex-snapshot
A team of pursuit learning automata for solving deterministic optimization problems
inferred← citeshttps://doi.org/10.1007/s10489-021-02232-6openalex-snapshot
Discovering relational and numerical expressions from plan traces for learning action models
inferred← citeshttps://doi.org/10.1007/s10589-005-4562-xopenalex-snapshot
A Tabu Search Algorithm for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/s10732-007-9023-5openalex-snapshot
Modelling the dynamics of stochastic local search on k-sat
inferred← citeshttps://doi.org/10.1007/s10817-020-09558-9openalex-snapshot
Probably Partially True: Satisfiability for Łukasiewicz Infinitely-Valued Probabilistic Logic and Related Topics
inferred← citeshttps://doi.org/10.1007/s10851-014-0545-9openalex-snapshot
Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm
inferred← citeshttps://doi.org/10.1007/s10852-008-9077-xopenalex-snapshot
Scatter Search and Genetic Algorithms for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1007/s10852-012-9202-8openalex-snapshot
Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach
inferred← citeshttps://doi.org/10.1007/s10878-008-9142-4openalex-snapshot
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
inferred← citeshttps://doi.org/10.1007/s10878-014-9734-0openalex-snapshot
The unconstrained binary quadratic programming problem: a survey
inferred← citeshttps://doi.org/10.1007/s10898-007-9166-9openalex-snapshot
An efficient solver for weighted Max-SAT
inferred← citeshttps://doi.org/10.1007/s10915-022-01882-zopenalex-snapshot
Discrete Dynamical System Approaches for Boolean Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/s11668-018-0466-9openalex-snapshot
An Overview of the Approaches for Automotive Safety Integrity Levels Allocation
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00196-4openalex-snapshot
New local search approximation techniques for maximum generalized satisfiability problems
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90248-9openalex-snapshot
Finding a feasible course schedule using Tabu search
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90024-iopenalex-snapshot
A fixed point operator for the generalised maximum satisfiability problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90206-2openalex-snapshot
Probabilistic estimates for the generalized maximum satisfiability problem
inferred← citeshttps://doi.org/10.1016/0167-9236(93)e0040-kopenalex-snapshot
Microcomputer-based heuristic approach to vehicle routing for after-sales servicing
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90048-copenalex-snapshot
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
inferred← citeshttps://doi.org/10.1016/0305-0548(93)e0023-mopenalex-snapshot
Genetic algorithms and tabu search: Hybrids for optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00029-1openalex-snapshot
A comparison of neighborhood search techniques for multi-objective combinatorial problems
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90207-popenalex-snapshot
Location and sizing of offshore platforms for oil exploration
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90009-4openalex-snapshot
A tabu search algorithm for computing an operational timetable
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90125-2openalex-snapshot
Minimization of a quadratic pseudo-Boolean function
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90279-5openalex-snapshot
Epcot: An efficient procedure for coloring optimally with Tabu Search
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50007-1openalex-snapshot
BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.005openalex-snapshot
Compiling propositional weighted bases
inferred← citeshttps://doi.org/10.1016/j.artint.2005.01.004openalex-snapshot
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.asoc.2012.01.013openalex-snapshot
Adaptive memory-based local search for MAX-SAT
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.016openalex-snapshot
Deconstructing Nowicki and Smutnicki's -TSAB tabu search algorithm for the job-shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.12.015openalex-snapshot
Revisiting simulated annealing: A component-based analysis
inferred← citeshttps://doi.org/10.1016/j.dam.2003.03.002openalex-snapshot
Improved exact algorithms for MAX-SAT
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.012openalex-snapshot
Variable neighborhood search for the maximum clique
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.01.005openalex-snapshot
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.07.034openalex-snapshot
An inventory–routing problem with the objective of travel time minimization
inferred← citeshttps://doi.org/10.1016/j.enbuild.2023.113161openalex-snapshot
Heuristic optimization for designing centralized air distribution systems in non-residential buildings
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.01.009openalex-snapshot
Combining finite learning automata with GSAT for the satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2026.116314openalex-snapshot
Evolutionary optimization of neuron-state distributions for logic-driven associative memory systems
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.112821openalex-snapshot
A systematic survey of computer-aided diagnosis in medicine: Past and present developments
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.118900openalex-snapshot
RAGE: A novel strategy for solving non-polynomial problems through the random generation of solutions and incremental reduction of the number of candidates: A case study applied to the design of the network infrastructure for connected vehicles
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.04.006openalex-snapshot
Formal methods for reasoning and uncertainty reduction in evidential grid maps
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106390openalex-snapshot
On optimization problems in acyclic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jss.2024.112036openalex-snapshot
Goal-conflict identification based on local search and fast boundary-condition verification based on incremental satisfiability filter
inferred← citeshttps://doi.org/10.1016/j.omega.2005.01.013openalex-snapshot
Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona
inferred← citeshttps://doi.org/10.1016/j.orl.2007.11.007openalex-snapshot
Solving weighted MAX-SAT via global equilibrium search
inferred← citeshttps://doi.org/10.1016/j.scico.2023.102946openalex-snapshot
Max-SAT-based synthesis of optimal and Nash equilibrium strategies for multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.030openalex-snapshot
A finite state intersection approach to propositional satisfiability
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00404-3openalex-snapshot
Worst-case study of local search for MAX-k-SAT
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00030-xopenalex-snapshot
Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00116-xopenalex-snapshot
Best second order bounds for two-terminal network reliability with dependent edge failures
inferred← citeshttps://doi.org/10.1016/s0260-8774(03)00019-0openalex-snapshot
Improving the structure of deep frozen and chilled food chain with tabu search procedure
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00031-2openalex-snapshot
Variable neighborhood search
inferred← citeshttps://doi.org/10.1016/s0308-521x(98)00064-xopenalex-snapshot
Tabu search not an optimal choice for models of agricultural systems
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00100-4openalex-snapshot
Variable neighborhood search: Principles and applications
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00282-2openalex-snapshot
A tabu search Hooke and Jeeves algorithm for unconstrained optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00059-3openalex-snapshot
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00292-0openalex-snapshot
Global optimization for artificial neural networks: A tabu search application
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00459-2openalex-snapshot
Algorithmic approach to the satisfactory graph partitioning problem
inferred← citeshttps://doi.org/10.1016/s0378-7796(99)00079-6openalex-snapshot
A Tabu search algorithm for maintenance scheduling of generating units
showing the first 200 of 322 · page through all 322
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.