An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations
- 18 February 2020
- journal article
- research article
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 53 (7) , 5157-5188
Abstract
No abstract availableKeywords
Funding Information
- Universitat de Girona (MPCUdG2016/055, MPCUdG2016/055)
- Universitat de Girona (MPCUdG2016/055, MPCUdG2016/055)
- MINECO/FEDER, UE (TIN2015-66293-R, TIN2015-66293-R)
- MINECO/FEDER, UE (TIN2015-66293-R, TIN2015-66293-R)
- MINECO and FSE, Ayudas para Contratos Predoctorales (BES-2016-076867)
- MICINN/FEDER, UE (RTI2018-095609-B-I00, RTI2018-095609-B-I00)
- MICINN/FEDER, UE (RTI2018-095609-B-I00, RTI2018-095609-B-I00)
This publication has 29 references indexed in Scilit:
- Reformulation based MaxSAT robustnessConstraints, 2012
- Project scheduling with resource capacities and requests varying with time: a case studyFlexible Services and Manufacturing Journal, 2012
- New Encodings of Pseudo-Boolean Constraints into CNF2009
- Effective Preprocessing with Hyper-Resolution and Equality ReductionLecture Notes in Computer Science, 2004
- Multidimensional Knapsack Problems2004
- Combinatorial Auctions: A SurveyINFORMS Journal on Computing, 2003
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- PSPLIB - A project scheduling problem libraryEuropean Journal of Operational Research, 1997
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960