Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem

DOI10.1613/JAIR.1.12670MaRDI QIDQ5094015zbMATH OpenOpenAlexFDO

Authors Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret

Publication date 2 August 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.12670

zbMATH Keywords

constraint satisfactionschedulingsatisfiabilityproblem solving

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• A comparative study of MIP and CP formulations for the B2B scheduling optimization problem
• MaxSAT-based scheduling of B2B meetings
• scientific article; zbMATH DE number 2088801
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Reconsidering mixed integer programming and MIP-based hybrids for scheduling

Cited in

(4)

• Maximum satisfiability formulations for nonlinear integer programming
• Solving weighted maximum satisfiability with branch and bound and clause learning
• New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems
• MaxSAT resolution for regular propositional logic

This page was built for publication: Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094015)