Search Results - subject:"Satisfiability problem"

A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems

Croella, Anna Livia; Luteberget, Bjørnar; Mannino, Carlo; … - In: Computers & operations research : an international journal 167 (2024), pp. 1-14

Persistent link: https://www.econbiz.de/10014566861

Flexible scheduling of diagnostic tests in automotive manufacturing

König, Simone; Reihn, Maximilian; Abujamra, Felipe Gelinski - In: Flexible Services and Manufacturing Journal 35 (2022) 2, pp. 320-342

built on a Boolean satisfiability problem on parallel and identical machines with temporal and resource constraints. The …

Persistent link: https://www.econbiz.de/10015328790

A cerebellar operant conditioning-inspired constraint satisfaction approach for product design concept generation

Li, Mingdong; Lou, Shanhe; Gao, Yicong; Zheng, Hao; Hu, … - In: International journal of production research 61 (2023) 17, pp. 5822-5841

Persistent link: https://www.econbiz.de/10014382643

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

Azevedo, Guilherme Henrique Ismael de; Pessoa, Artur; … - In: European journal of operational research : EJOR 289 (2021) 3, pp. 809-824

Persistent link: https://www.econbiz.de/10012433083

Multidimensional appropriate clustering and DBSCAN for SAT solving

Hireche, Celia; Drias, Habiba - In: Data Technologies and Applications 53 (2019) 1, pp. 85-107

implications The proposed approach is developed, in this paper, on the Boolean satisfiability problem because of its well …

Persistent link: https://www.econbiz.de/10014712702

ПРОЦЕДУРЫ ПОСТРОЕНИЯ ДЕКОМПОЗИЦИОННЫХ МНОЖЕСТВ ДЛЯ РАСПРЕДЕЛЕННОГО РЕШЕНИЯ SAT-ЗАДАЧ В ПРОЕКТЕ ДОБРОВОЛЬНЫХ ВЫЧИСЛЕНИЙ SAT@HOME

СЕРГЕЕВИЧ, ЗАИКИН ОЛЕГ; … - In: Управление большими … (2013) 3, pp. 138-156

В статье предложен новый подход к построению декомпози-ционных множеств, используемых для крупноблочного распа-раллеливания SAT-задач и их решения в...

Persistent link: https://www.econbiz.de/10011227145

What makes a phase transition? Analysis of the random satisfiability problem

Zweig, Katharina A.; Palla, Gergely; Vicsek, Tamás - In: Physica A: Statistical Mechanics and its Applications 389 (2010) 8, pp. 1501-1511

In the last 30 years it was found that many combinatorial systems undergo phase transitions. One of the most important examples of these can be found among the random k-satisfiability problems (often referred to as k-SAT), asking whether there exists an assignment of Boolean values satisfying a...

Persistent link: https://www.econbiz.de/10011061156

On semidefinite programming relaxations for the satisfiability problem

Anjos, Miguel F. - In: Computational Statistics 60 (2004) 3, pp. 349-367

This paper is concerned with the analysis and comparison of semidefinite programming (SDP) relaxations for the satisfiability (SAT) problem. Our presentation is focussed on the special case of 3-SAT, but the ideas presented can in principle be extended to any instance of SAT specified by a set...

Persistent link: https://www.econbiz.de/10010847851

On semidefinite programming relaxations for the satisfiability problem

Anjos, Miguel F. - In: Mathematical Methods of Operations Research 60 (2004) 3, pp. 349-367

Persistent link: https://www.econbiz.de/10010950243