Zobrazeno 1 - 10
of 630
pro vyhledávání: '"A. Fouilhoux"'
This paper presents the first generic bi-objective binary linear branch-and-cut algorithm. Studying the impact of valid inequalities in solution and objective spaces, two cutting frameworks are proposed. The multi-point separation problem is introduc
Externí odkaz:
http://arxiv.org/abs/2410.08722
Autor:
N. Guffon, M. Pettazzoni, N. Pangaud, C. Garin, G. Lina-Granade, C. Plault, C. Mottolese, R. Froissart, A. Fouilhoux
Publikováno v:
Orphanet Journal of Rare Diseases, Vol 16, Iss 1, Pp 1-20 (2021)
Abstract Background Mucopolysaccharidosis type I-Hurler syndrome (MPSI-H) is a lysosomal storage disease characterized by severe physical symptoms and cognitive decline. Early treatment with hematopoietic cell transplant (HSCT) is critical to the sur
Externí odkaz:
https://doaj.org/article/2cacf798ff01406aa0218951d1a1ed06
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the contraction
Externí odkaz:
http://arxiv.org/abs/2401.12793
In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of jobs whose starting times are guaranteed. The problem was proven NP-h
Externí odkaz:
http://arxiv.org/abs/2106.12055
The problem considered in this work consists in scheduling a set of tasks on a single machine, around an unrestrictive common due date to minimize the weighted sum of earliness and tardiness. This problem can be formulated as a compact mixed integer
Externí odkaz:
http://arxiv.org/abs/2102.07382
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discrete Applied Mathematics 290 (2021) 36-59
While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we propose in this work mixed integer formulations. We consider a single machine scheduling problem that aims at minimizi
Externí odkaz:
http://arxiv.org/abs/1901.06880
This paper focuses on integer linear programs where solutions are binary matrices, and the corresponding symmetry group is the set of all column permutations. Orbitopal fixing, as introduced by Kaibel et al., is a technique designed to break symmetri
Externí odkaz:
http://arxiv.org/abs/1710.10189
Virtual Network Functions as a Service (VNFaaS) is currently under attentive study by telecommunications and cloud stakeholders as a promising business and technical direction consisting of providing network functions as a service on a cloud (NFV Inf
Externí odkaz:
http://arxiv.org/abs/1701.07993
Publikováno v:
In European Journal of Operational Research 16 January 2022 296(2):453-464