Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Daniel Villeneuve"'
Autor:
Natàlia Garcia-Reyero, Mark A. Arick, E. Alice Woolard, Mitchell Wilbanks, John E. Mylroie, Kathleen Jensen, Michael Kahl, David Feifarek, Shane Poole, Eric Randolph, Jenna Cavallin, Brett R. Blackwell, Daniel Villeneuve, Gerald T. Ankley, Edward J. Perkins
Publikováno v:
Scientific Data, Vol 9, Iss 1, Pp 1-7 (2022)
Measurement(s) transcripts • water chemistry Technology Type(s) RNAseq • GC/MS Factor Type(s) exposure Sample Characteristic - Organism Pimephales promelas Sample Characteristic - Environment estuary system Sample Characteristic - Location Milwau
Externí odkaz:
https://doaj.org/article/2ef5427a7040454ca4dc2750f6f31961
Publikováno v:
Toxics, Vol 11, Iss 10, p 820 (2023)
New approach methods (NAMs) can reduce the need for chronic animal studies. Here, we apply benchmark dose (concentration) (BMD(C))–response modeling to transcriptomic changes in the liver of mice and in fathead minnow larvae after short-term exposu
Externí odkaz:
https://doaj.org/article/e9243192a8504b6c8d6274be239ebce2
Autor:
Christopher J. Martyniuk, Sophie Alvarez, Nancy D. Denslow, Gerald Ankley, Scott McClung, Daniel Villeneuve
Publikováno v:
Journal of Proteome Research. 8:2186-2200
Androgenic chemicals are present in the environment at concentrations that impair reproductive processes in fish. The objective of this experiment was to identify proteins and cell processes mediated through androgen receptor signaling using an andro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5390d82bcd7bd47479610e2f8048f804
https://doi.org/10.1021/pr800627n
https://doi.org/10.1021/pr800627n
Autor:
Stefan Irnich, Daniel Villeneuve
Publikováno v:
INFORMS Journal on Computing. 18:391-406
The elementary shortest-path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle-routing and crew-scheduling applications. The ESPPRC often occurs as a subproblem of an enclosing problem, where it is used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7eef0b506822f8f9a69188251fdf2aae
https://doi.org/10.1287/ijoc.1040.0117
https://doi.org/10.1287/ijoc.1040.0117
Publikováno v:
Annals of Operations Research. 139:375-388
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subproblem and branching rule disappear when branching decisions are based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56fb1e9b593b83b6ec44482d4a538d48
https://doi.org/10.1007/s10479-005-3455-9
https://doi.org/10.1007/s10479-005-3455-9
Autor:
Daniel Villeneuve, Guy Desaulniers
Publikováno v:
European Journal of Operational Research. 165:97-107
We consider a variant of the constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. Two solution approaches are proposed for this variant. The first us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5081d055c66a1b7c8e6e9b5e7538e24
https://doi.org/10.1016/j.ejor.2004.01.032
https://doi.org/10.1016/j.ejor.2004.01.032
Publikováno v:
Operations Research. 53:632-645
Column generation is often used to solve problems involving set-partitioning constraints, such as vehicle-routing and crew-scheduling problems. When these constraints are in large numbers and the columns have on average more than 8–12 nonzero eleme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::609b165932b09d9a707c84d493bd1e77
https://doi.org/10.1287/opre.1050.0222
https://doi.org/10.1287/opre.1050.0222
Publikováno v:
Journal of the Operational Research Society. 56:60-66
In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the classroom population. In this paper, two different ways of measuring the balance among teams ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1030a4767af17ec7ee9946225f1b860
https://doi.org/10.1057/palgrave.jors.2601775
https://doi.org/10.1057/palgrave.jors.2601775
Autor:
Guy Desaulniers, Daniel Villeneuve
Publikováno v:
Transportation Science. 34:312-319
This paper considers the shortest path problem with waiting costs (SPWC) as an extension to the shortest path problem with time windows. The problem consists of finding the minimum cost path in a network, where cost and time are two independent quant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dda8572223506eeaed77f564ce6b757a
https://doi.org/10.1287/trsc.34.3.312.12298
https://doi.org/10.1287/trsc.34.3.312.12298
Publikováno v:
Transportation Science. 32:246-255
This paper describes the Preferential Bidding Problem solved in the airline industry to construct personalized monthly schedules for pilots and officers. This problem consists in assigning to crew members pairings, days off, annual leaves, training p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b946d7f0a5e8cb1a46caa6ecdc22f7d6
https://doi.org/10.1287/trsc.32.3.246
https://doi.org/10.1287/trsc.32.3.246