Results 71 to 80 of about 9,877 (247)
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
We developed a patient‐derived, functional microfluidic model of the diffuse midline glioma (DMG) blood–brain–tumor barrier (BBTB) comprised of endothelial cells, astrocytes, pericytes, and tumor cells. The system forms perfusable microvasculature, reveals the BBTB retains vascular integrity, identifies DMG‐specific transcriptomic changes distinct from
Kimberly R. Bennett +7 more
wiley +1 more source
The cloud manufacturing (CMfg) platform serves as a centralized hub for allocating and scheduling tasks to distributed resources. It features a concrete two-agent model that addresses real-world industrial needs: the first agent handles long-term ...
Xin Xin, Suxia Zhou, Jinsheng Gao
doaj +1 more source
On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. [PDF]
In this paper a comparison is made between two decomposition techniques to solve a staff scheduling problem with column generation. In the first approach, decomposition takes place on the staff members, whereas in the second approach decomposition takes ...
Belien, Jeroen, Demeulemeester, Erik
core
A folic acid (FA)‐conjugated 2‐deoxyglucose dendrimer selectively targets FRβ+ macrophages in endometriotic lesions, enabling precise intracellular delivery of niclosamide. This nonhormonal nanomedicine enhances drug solubility, provides controlled intracellular release, suppresses lesion growth, reduces inflammation and pain, and establishes FRβ ...
Anubhav Dhull +11 more
wiley +1 more source
Models for the optimization of promotion campaigns: exact and heuristic algorithms. [PDF]
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign.
Leus, Roel +2 more
core
Three‐dimensional bioprinting transforms breast cancer modeling from simple constructs into spatially organized, multicellular, perfused, and patient‐derived platforms. This review shows how bioinks, cellular composition, architecture, and flow govern tumor behavior and drug response, while revealing why complexity alone is insufficient without ...
Mustafa Nakipoglu +7 more
wiley +1 more source
Speeding up column generation for robust wireless network planning
The wireless network planning problem consists of base station placement and traffic node assignment to base stations. To incorporate traffic demand uncertainties, we follow the Γ-robustness approach by Bertsimas and Sim.
Grit Claßen +2 more
doaj +1 more source
Bin Packing with conflicts: a generic branch-and-price algorithm
International audienceIn the the bin packing problem with conflicts, one has to pack items in the minimum number of bins while avoiding joint assignments of items that are in conflict.
Sadykov, Ruslan, Vanderbeck, François
core +1 more source
Surgery planning using branch-and-price algorithm accelerated using machine learning [PDF]
Plánování operačních sálů ve zdravotnických zařízeních je zásadní úkol ovlivňující kvalitu péče o pacienty a provozní náklady. Plánovací pravidla používaná v nemocnicích často vedou k suboptimálním rozvrhům.
Pavlína Koutecká
core

