A brand new cheating attempt: a case of usurped identity

We recall some cases of ethical misconduct that occurred in the recent years, and we report a new trick that was recently attempted to cheat the journal in order to obtain the publication of an article through usurped identity.     

Models and algorithms for fair layout optimization problems

Given a non-convex two-dimensional area and identical rectangular stands, we consider the problem of placing the maximum number of stands in the area, by satisfying a number of operational constraints. We present linear programming models and show the total unimodularity of the matrices associated with their constraint sets. We then give computational results obtained by applying the models to the real-world case of the Beira Mar handcraft fair of Fortaleza (Brazil).     

A Tailor‐Made Synthetic Polymer for Cell Encapsulation: Design Rationale,Synthesis, Chemical–Physics and Biological Characterizations

This study presents a custom‐made in situ gelling polymeric precursor for cell encapsulation. Composed of poly((2‐hydroxyethyl)methacrylate‐co‐(3‐aminopropyl)methacrylamide) (P(HEMA‐co‐APM) mother backbone and RGD‐mimicking poly(amidoamine) (PAA) moiteis, the comb‐like structured polymeric precursor is tailored to gather the advantages of the two families of synthetic polymers, i.e., the good mechanical integrity of PHEMA‐based polymers and the biocompatibility and biodegradability of PAAs. The role of P(HEMA‐co‐APM) in the regulation of the chemico‐physical properties of P(HEMA‐co‐APM)/PAA hydrogels is thoroughly investigated. On the basis of obtained results, namely the capability of maintaining vital NIH3T3 cell line in vitro for 2 d in a 3D cell culture, the in vivo biocompatibility in murine model for 16 d, and the ability of finely tuning mechanical properties and degradation kinetics, it can be assessed that P(HEMA‐co‐APM)/PAAs offer a cost‐effective valid alternative to the so far studied natural polymer‐based systems for cell encapsulation.

     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

BPPLIB: a library for bin packing and cutting stock problems

The bin packing problem (and its variant, the cutting stock problem) is among the most intensively studied combinatorial optimization problems. We present a library of computer codes, benchmark instances, and pointers to relevant articles for these two problems. The library is available at http://or.dei.unibo.it/library/bpplib. The computer code section includes twelve programs: seven are directly downloadable from the library page, while for the remaining five we provide addresses where they can be obtained or downloaded. Some of the codes for which we provide an original C++ implementation need an integer linear programming solver. For such cases, the library provides two versions: one that uses the commercial solver CPLEX, and one that uses the freeware solver SCIP. The benchmark section provides over six thousands instances (partly coming from the literature and partly randomly generated), together with the corresponding solutions. Instances that are difficult to solve to proven optimality are included. The library also includes a BibTeX file of more than 150 references on this topic and an interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this work by reporting the results of new computational experiments on a number of computer codes and benchmark instances.