From post

A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization.

, , , и . Comput. Chem. Eng., 31 (11): 1525-1534 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Most IPs with bounded determinants can be solved in polynomial time., , и . CoRR, (2019)Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes., , , , и . Math. Program., 134 (1): 305-322 (2012)On Matrices over a Polynomial Ring with Restricted Subdeterminants., , и . IPCO, том 14679 из Lecture Notes in Computer Science, стр. 43-56. Springer, (2024)On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants., , и . SIAM J. Discret. Math., 32 (3): 1706-1720 (2018)A colorful Steinitz Lemma with application to block-structured integer programs., , и . Math. Program., 204 (1): 677-702 (марта 2024)N-fold integer programming via LP rounding., , и . CoRR, (2020)Notes on a, b, c-Modular Matrices., , и . CoRR, (2021)Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time., , , , и . SODA, стр. 1666-1681. SIAM, (2021)Proximity and Flatness Bounds for Linear Integer Optimization., , , и . Math. Oper. Res., 49 (4): 2446-2467 (2024)The Support of Integer Optimal Solutions., , , , и . SIAM J. Optim., 28 (3): 2152-2157 (2018)