European Journal of Operational Research

• First exact method for nesting problems with guillotine cuts • An innovative branch and cut based on the dotted board model • Extension of the dotted board model to new nesting problem variants Cutting and packing problems have been widely studied because of their potential to improve industrial processes economically and environmentally. While many variants have been studied, some, particularl…

• Exact branch-and-cut algorithm using fragments. • Algorithm is easily configured to solve flexible or fix return problems. • First use of fragments in a problem where requests must be served multiple time. • Significantly outperforms existing exact algorithms for the problem. We present a new fragment-based model for two versions of the Skip Pickup and Delivery Problem (SPDP). Our new algorithm…

• A new measure capturing fairness of a schedule in a tournament: ranking fairness • We provide real-life examples illustrating the relevance of ranking fairness • An intricate construction providing ranking-fair single-break schedules • Integer programming-based solutions for computing ranking-fair single-break schedules • The Canonical Pattern Set does not admit ranking-fair schedules We introd…