Results 31 to 40 of about 41,714 (265)
A fuzzy approach for the variable cost and size bin packing problem allowing incomplete packing
Inteligencia Artificial, 2021 The Variable Cost and Size Bin Packing Problem (VCSBPP) is a known NP-Hard problem that consists in minimizing the cost of all bins used to pack a set of items.
Jorge Herrera-Franklin +2 more
doaj +1 more source
On a Packing and Covering Problem
European Journal of Combinatorics, 1985 Let m(n,k,r) be the maximal cardinality of a family F of k-element subsets of n-element set with the property that \(| F\cap F'|
openaire +2 more sources
A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem
Applied SciencesThis paper addresses the one-dimensional cutting stock problem, focusing on minimizing total stock usage. Most procedures that deal with this problem reside on linear programming methods, heuristics, metaheuristics, and hybridizations. These methods face
Irving Barragan-Vite +3 more
doaj +1 more source
On the fractionality of the path packing problem [PDF]
Journal of Combinatorial Optimization, 2011 18 pages, 5 figures in .eps format, 2 latex files, main file is kc13.tex Resubmission due to incorrectly specified CS type of the article; no changes to the context have been ...
openaire +2 more sources
Solving the two-dimensional packing problem with m-M calculus [PDF]
Yugoslav Journal of Operations Research, 2011 This paper considers the two dimensional rectangular packing problem. The mathematical formulation is based on the optimization of a non-linear function with piecewise linear constraints with a small number of real variables. The presented method of m-
Savić Aleksandar +2 more
doaj +1 more source
The generalized bin packing problem [PDF]
Transportation Research Part E: Logistics and Transportation Review, 2012 Abstract In the Generalized Bin Packing Problem (GBPP), given two sets of compulsory and non-compulsory items characterized by volume and profit and a set of bins with given volume and cost, we want to select the subset of profitable non-compulsory items to be loaded together with the compulsory ones into the appropriate bins in order to minimize the
BALDI, MAURO MARIA +3 more
openaire +2 more sources
Parameterized Algorithms for the H-Packing with t-Overlap Problem
Journal of Graph Algorithms and Applications, 2014 We introduce the k-H-Packing with t-Overlap problem to formalize the problem of discovering overlapping communities in real networks. More precisely, in the k-H-Packing with t-Overlap problem, we search in a graph G for at least k subgraphs each ...
Alejandro López-Ortiz, Jazmín Romero
doaj +1 more source
The Role of “Adult‐Onset” Cancer Predisposition Genes in Pediatric Cancer: A Comprehensive Review
Pediatric Blood &Cancer, EarlyView.ABSTRACT Current literature estimates that 10% of pediatric cancers are caused by pathogenic or likely pathogenic (P/LP) germline variants in cancer predisposition genes (CPGs). Variants in CPGs thought to increase cancer risk exclusively during adulthood are referred to as “adult‐onset” CPGs (aoCPGs).
Maria Rozo +5 more
wiley +1 more source
A genetic algorithm to generate maximally orthogonal frames in complex space
Machine Learning: Science and TechnologyA frame is a generalization of a basis of a vector space to a redundant overspanning set whose vectors are linearly dependent. Frames find applications in signal processing and quantum information theory.
Sebastián Roca-Jerat, Juan Román-Roche
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background General pediatricians often evaluate hematologic and oncologic presentations before subspecialty consultation, yet the 2025 Accreditation Council for Graduate Medical Education (ACGME) pediatric requirements reduce inpatient pediatric hematology/oncology (PHO) time, raising questions about resident readiness.
Colburn Yu, Rohini Jain
wiley +1 more source