Matthew J. Realff

Publication Activity (10 Years)

Years Active: 1995-2022
Publications (10 Years): 7

Top Topics

Chemical Engineering

Continuous Action

Machine Learning

Partially Observed

Top Venues

Comput. Chem. Eng.

Publications

Bhavik R. Bakshi, Matthew J. Realff, Yaman Arkun, Manfred Morari
Computers and chemical engineering virtual special issue in honor of Professor George Stephanopoulos. Comput. Chem. Eng. 166 (2022)
Jayashree Kalyanaraman, Yoshiaki Kawajiri, Matthew J. Realff
Bayesian design of experiments for adsorption isotherm modeling. Comput. Chem. Eng. 135 (2020)
Gordon Hüllen, Jianyuan Zhai, Sun Hye Kim, Anshuman Sinha, Matthew J. Realff, Fani Boukouvala
Managing uncertainty in data-driven simulation-based optimization. Comput. Chem. Eng. 136 (2020)
Jay H. Lee, Joohyun Shin, Matthew J. Realff
Machine learning: Overview of the recent progresses and implications for the process systems engineering field. Comput. Chem. Eng. 114 (2018)
Joohyun Shin, Jay H. Lee, Matthew J. Realff
Stochastic optimization with value function approximation for micro-grid operation. CDC (2016)
Jayashree Kalyanaraman, Yanfang Fan, Ying Labreche, Ryan P. Lively, Yoshiaki Kawajiri, Matthew J. Realff
adsorption on amine sorbents. Comput. Chem. Eng. 81 (2015)
Kevin Yeh, Craig Whittaker, Matthew J. Realff, Jay H. Lee
Two stage stochastic bilevel programming model of a pre-established timberlands supply chain with biorefinery investment interests. Comput. Chem. Eng. 73 (2015)
Kevin Yeh, Matthew J. Realff, Jay H. Lee, Craig Whittaker
Analysis and comparison of single period single level and bilevel programming representations of a pre-existing timberlands supply chain with a new biorefinery facility. Comput. Chem. Eng. 68 (2014)
Dexin Luo, Matthew J. Realff, Valerie M. Thomas
Bioreactor-based fuel systems. I: Optimal production capacity considering start-up dynamics. Comput. Chem. Eng. 71 (2014)
Rakshita Agrawal, Matthew J. Realff, Jay H. Lee
MILP based value backups in partially observed Markov decision processes (POMDPs) with very large or continuous action and observation spaces. Comput. Chem. Eng. 56 (2013)
Jinkyung Kim, Matthew J. Realff, Jay H. Lee
Optimal design and global sensitivity analysis of biomass supply chain networks for biofuels under uncertainty. Comput. Chem. Eng. 35 (9) (2011)
Chanjoo Lee, Matthew J. Realff, Jane C. Ammons
Integration of channel decisions in a decentralized reverse production system with retailer collection under deterministic non-stationary demands. Adv. Eng. Informatics 25 (1) (2011)
Di Lu, Matthew J. Realff
Point-based standard optimization with life cycle assessment for product design. Comput. Chem. Eng. 34 (9) (2010)
Nikolaos E. Pratikakis, Matthew J. Realff, Jay H. Lee
Controlled exploration of state space in off-line ADP and its application to stochastic shortest path problems. Comput. Chem. Eng. 33 (12) (2009)
Tiravat Assavapokee, Matthew J. Realff, Jane C. Ammons, I-Hsuan Hong
Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization. Comput. Oper. Res. 35 (6) (2008)
Markus Biehl, Edmund L. Prater, Matthew J. Realff
Assessing performance and uncertainty in developing carpet reverse logistics systems. Comput. Oper. Res. 34 (2) (2007)
Anshul Dubey, Matthew J. Realff, Jay H. Lee, Andreas S. Bommarius
Identifying the interacting positions of a protein using Boolean learning and support vector machines. Comput. Biol. Chem. 30 (4) (2006)
Jaein Choi, Jay H. Lee, Matthew J. Realff
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem. Comput. Chem. Eng. 28 (8) (2004)
Jaein Choi, Matthew J. Realff, Jay H. Lee
Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application. Comput. Chem. Eng. 28 (6-7) (2004)
Jing Wei, Matthew J. Realff
Sample average approximation methods for stochastic MINLPs. Comput. Chem. Eng. 28 (3) (2004)
Jaein Choi, Matthew J. Realff, Jay H. Lee
An algorithmic framework for improving heuristic solutions: Part I. A deterministic discount coupon traveling salesman problem. Comput. Chem. Eng. 28 (8) (2004)
Noel Rappin, Mark Guzdial, Matthew J. Realff, Pete Ludovice
Connections as a Focus for Model-Building Learning in Engineering. Interact. Learn. Environ. 9 (2) (2001)
Mark Guzdial, Matthew J. Realff, Pete Ludovice, Tom Morley, Clayton Kerce, Eric Lyons, Katherine E. Sukel
Using a CSCL-Driven shift in agency to undertake educational reform. CSCL (1999)
Matthew J. Realff, Paul H. Kvam, W. E. Taylor
Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem. Artif. Intell. Eng. 13 (3) (1999)
Brett W. Schug, Matthew J. Realff
Propagation of Interval Values in Simple Processing Networks. INFORMS J. Comput. 11 (4) (1999)
Matthew J. Realff, George Stephanopoulos
On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms. INFORMS J. Comput. 10 (1) (1998)
Noel Rappin, Mark Guzdial, Matthew J. Realff, Pete Ludovice
Balancing Usability and Learning in an Interface. CHI (1997)
Cindy E. Hmelo, Jorge A. Vanegas, Matthew J. Realff, Bret Bras, Jim Mulholland, Terry Shikano, Mark Guzdial
Technology support for collaborative learning in a problem-based curriculum for sustainable technology. CSCL (1995)