Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Faramroze G. Engineer"'
Autor:
Haokun Yang, David E. Bernal, Robert E. Franzoi, Faramroze G. Engineer, Kysang Kwon, Sechan Lee, Ignacio E. Grossmann
Publikováno v:
Computers & Chemical Engineering. 138:106812
In this work, a Mixed-Integer Nonlinear Programming (MINLP) modeling framework for integrating short-term Crude-oil Scheduling (CS) and mid-term Refinery Planning (RP) has been developed and effectively solved by a proposed Lagrangean Decomposition (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::921bd2dd99013a248ebcc5bf835a3960
https://doi.org/10.1016/j.compchemeng.2020.106812
https://doi.org/10.1016/j.compchemeng.2020.106812
Publikováno v:
INFORMS Journal on Computing. 24:578-596
Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87f46662e3bab956576f3a937efb1593
https://doi.org/10.1287/ijoc.1110.0469
https://doi.org/10.1287/ijoc.1110.0469
Autor:
Faramroze G. Engineer, Kevin C. Furman, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
Publikováno v:
Operations Research. 60:106-122
A branch-price-and-cut algorithm is developed for a complex maritime inventory-routing problem with varying storage capacities and production/consumption rates at facilities. The resulting mixed-integer pricing problem is solved exactly and efficient
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfd6d72d6bfaa8b030dba58cb6c26633
https://doi.org/10.1287/opre.1110.0997
https://doi.org/10.1287/opre.1110.0997
Publikováno v:
Interfaces. 41:436-454
To improve coverage against vaccine-preventable diseases for children and adults, and to aid caretakers and providers in making appropriate and timely vaccination decisions, Georgia Institute of Technology collaborated with the Centers for Disease Co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5af62547a441b2ebd0753846fbc3f990
https://doi.org/10.1287/inte.1110.0583
https://doi.org/10.1287/inte.1110.0583
Publikováno v:
INFORMS Journal on Computing. 23:105-119
We present a relaxation-based dynamic programming algorithm for solving resource-constrained shortest-path problems (RCSPPs) in the context of column generation for the dial-a-flight problem. The resulting network formulation and pricing problem requ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::512192ad79ad09967cae4202916e311f
https://doi.org/10.1287/ijoc.1100.0384
https://doi.org/10.1287/ijoc.1100.0384
Publikováno v:
Operations Research. 57:1307-1319
In this paper, we outline the development of the core optimization technology used within a decision support tool to help providers and caretakers in constructing catch-up schedules for childhood immunization. These schedules ensure that a child cont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d67713161a8cb550ce11430568877e5d
https://doi.org/10.1287/opre.1090.0756
https://doi.org/10.1287/opre.1090.0756
Autor:
Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
Publikováno v:
Mathematical Programming Computation, 6, 255-279. Springer-Verlag
The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a341a3de21f92a9447297f22ba79f0c
https://pure.eur.nl/en/publications/d94dd3e4-5abb-4533-a3cd-3d3fb94ba362
https://pure.eur.nl/en/publications/d94dd3e4-5abb-4533-a3cd-3d3fb94ba362
Publikováno v:
Scopus-Elsevier
A significant drawback of the usual sequential airline scheduling approach is the long lead time between solution of the aircraft routing and aircrew planning problems, and the day of operation. We consider a new approach to airline planning, in whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c02bc7455e404cdcfe2a0b4651d1199e
http://www.scopus.com/inward/record.url?eid=2-s2.0-84905825750&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84905825750&partnerID=MN8TOARS