Author of the publication

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

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Most IPs with bounded determinants can be solved in polynomial time., , and . CoRR, (2019)Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes., , , , and . Math. Program., 134 (1): 305-322 (2012)On Matrices over a Polynomial Ring with Restricted Subdeterminants., , and . IPCO, volume 14679 of Lecture Notes in Computer Science, page 43-56. Springer, (2024)N-fold integer programming via LP rounding., , and . CoRR, (2020)The Support of Integer Optimal Solutions., , , , and . SIAM J. Optim., 28 (3): 2152-2157 (2018)Notes on a, b, c-Modular Matrices., , and . CoRR, (2021)Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time., , , , and . SODA, page 1666-1681. SIAM, (2021)A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization., , , and . Comput. Chem. Eng., 31 (11): 1525-1534 (2007)Distances between optimal solutions of mixed-integer programs., , and . Math. Program., 179 (1): 455-468 (2020)Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity., , , , and . ESA, volume 204 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)