- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1099-1425
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Pseudo-Boolean optimisation for RobinX sports timetabling ; volume:25 ; number:3 ; day:18 ; month:6 ; year:2022 ; pages:287-299 ; date:6.2022
Journal of scheduling ; 25, Heft 3 (18.6.2022), 287-299, 6.2022
- Urheber
-
Lester, Martin Mariusz
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10951-022-00737-7
- URN
-
urn:nbn:de:101:1-2022082920073650489660
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:34 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lester, Martin Mariusz
- SpringerLink (Online service)
Ähnliche Objekte (12)
Pseudo-Boolean Optimization
Pseudo-Boolean : Programming and applications
Logic programming with pseudo-Boolean constraints
Clausal proofs for pseudo-boolean reasoning
Towards Faster Conflict-Driven Pseudo-Boolean Solving
A Proof Complexity View of Pseudo-Boolean Solving
ON (m,n)-DISTRIBUTIVITY OF PSEUDO BOOLEAN ALGEBRAS
ON M-REPRESENTATION OF M-COMPLETE PSEUDO BOOLEAN ALGEBRA
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
On the compounding of higher order monotonic pseudo-Boolean functions
Pseudo-Boolean constraint encodings for conjunctive normal form and their applications
Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions
Pseudo-Boolean Optimization
Pseudo-Boolean : Programming and applications
Logic programming with pseudo-Boolean constraints
Clausal proofs for pseudo-boolean reasoning
Towards Faster Conflict-Driven Pseudo-Boolean Solving
A Proof Complexity View of Pseudo-Boolean Solving
ON (m,n)-DISTRIBUTIVITY OF PSEUDO BOOLEAN ALGEBRAS
ON M-REPRESENTATION OF M-COMPLETE PSEUDO BOOLEAN ALGEBRA
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
On the compounding of higher order monotonic pseudo-Boolean functions
Pseudo-Boolean constraint encodings for conjunctive normal form and their applications
Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions
Pseudo-Boolean Optimization
Pseudo-Boolean : Programming and applications
Logic programming with pseudo-Boolean constraints
Clausal proofs for pseudo-boolean reasoning
Towards Faster Conflict-Driven Pseudo-Boolean Solving
A Proof Complexity View of Pseudo-Boolean Solving
ON (m,n)-DISTRIBUTIVITY OF PSEUDO BOOLEAN ALGEBRAS
ON M-REPRESENTATION OF M-COMPLETE PSEUDO BOOLEAN ALGEBRA
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
On the compounding of higher order monotonic pseudo-Boolean functions
Pseudo-Boolean constraint encodings for conjunctive normal form and their applications