BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Patrick De Causmaecker

Patrick De Causmaecker contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Artificial Intelligencemath.CODiscrete Mathematicsmath.NT

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Transforming Constraint Programs to Input for Local Search

Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for some metaheuristic algorithm. In this paper, we establish a link between symmetry properties of constraint optimization problems and local search neighborhoods, and we use this link to automatically generate neighborhoods from a constraint specification in the context of the IDP system. We evaluate the obtained neighborhoods for six classical optimization problems. The resulting observations support the viability of this technique.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs

This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible to a given undirected graph in order to obtain a Hamiltonian graph. This problem has mainly been studied in the context of various specific kinds of undirected graphs (e.g. trees, unicyclic graphs and series-parallel graphs). The proposed algorithm, however, concentrates on solving HCP for general undirected graphs. It can be considered to belong to the category of matheuristics, because it integrates an exact linear time solution for trees into a local search algorithm for general graphs. This integration makes use of the close relation between HCP and the minimum path partition problem, which makes the algorithm equally useful for solving the latter problem. Furthermore, a benchmark set of problem instances is constructed for demonstrating the quality of the proposed algorithm. A comparison with state-of-the-art solvers indicates that the proposed algorithm is able to achieve high-quality results.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---

In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II). First, we describe the problem formulation, which, differently from INRC-I, is a multi-stage procedure. Second, we illustrate all the necessary infrastructure do be used together with the participant's solver, including the testbed, the file formats, and the validation/simulation tools. Finally, we state the rules of the competition. All update-to-date information about the competition is available at http://mobiz.vives.be/inrc2/.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

On the number of antichains of sets in a finite universe

Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected antichains and the number of fully distinguishing antichains. The latter establish a connection with Stirling numbers of the second kind. Decomposition properties of intervals in the lattice of antichains are proven. A new operator allowing partitioning the full lattice in intervals derived from lower dimensional sub-lattices is introduced. Special posets underlying an interval of antichains are defined. The poset allows the derivation of a powerful formula for the size of an interval. This formula allows computing intervals in the six dimensional space. Combinatorial coefficients allowing another decomposition of the full lattice are defined. In some specific cases, related to connected components in graphs, these coefficients can be efficiently computed. This formula allows computing the size of the lattice of order 8 efficiently. This size is the number of Dedekind of order 8, the largest one known so far.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Partitioning in the space of antimonotonic functions

This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial ordering on this set. We study the inter- vals according to this ordering. We show how intervals of antimonotonic functions, and a fortiori the whole space of antimonotonic functions can be partitioned as disjoint unions of certain classes of intervals. These in- tervals are uniquely determined by antimonotonic functions on smaller sets. This leads to recursive enumeration algorithms and new recursion relations. Using various decompositions, we derive new recursion formu- lae for the number of antimonotonic functions and hence for the number of monotonic functions (i.e. the Dedekind number).

0 citations0 reviewsNo code linkedOpen access