1,720,971 research outputs found
Replication Data for: Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items
This repository contains the code for all algorithms discussed in the paper "Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items" by Maxence Delorme and Joris Wagenaar. (2024-08-21
IP-MATCH/StableMatchingCodes: Preprocessing codes
These are the codes used for the preprocessing experiments in the paper "Improving solve times of stable matching problems through preprocessing" by Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics, David Manlove and William Pettersso
Replication Data for: Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
This repository contains the instances used in the paper "Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints" by Giulia Caselli, Maxence Delorme, Manuel Iori, and Carlo Alberto Magni
Replication Data for: Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
This repository contains the instances used in the paper "Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints" by Giulia Caselli, Maxence Delorme, Manuel Iori, and Carlo Alberto Magni
IP-MATCH/StableMatchingCodes: Preprocessing HRT with two-sided ties
These are the codes used for the preprocessing experiments, including additional experiments, in the revised paper "Improving solve times of stable matching problems through preprocessing" by Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics, David Manlove and William Pettersso
Replication Data for "Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation"
This repository contains the tested instances and code for all algorithms discussed in the paper "Bounds and Heuristic Algorithms for the Bin Packing Problem with Minimum Color Fragmentation" by Mathijs Barkel, Maxence Delorme, Enrico Malaguti and Michele Monaci
Replication Data for: Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items
This repository contains the code for all algorithms discussed in the paper "Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items" by Maxence Delorme and Joris Wagenaar
IP-MATCH/StableMatchingCodes: Codes used for Mathematical Models for Stable Matching Problems with Ties
<p>This is the code used to produce the results shown in the Mathematical Models for Stable Matching Problems with Ties paper, by Maxence Delorme, Sergio García, Jacek Gondzio, Joerg Kalcsics, David Manlove and William Pettersson.</p>
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
