( en | de | ru )

 

Disambiguation

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.

Robert Weismantel

Robert Weismantel

Robert Weismantel

Robert Weismantel

Gertrud Weismantel

 

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

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)Distances between optimal solutions of mixed-integer programs., , и . Math. Program., 179 (1): 455-468 (2020)Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity., , , , и . ESA, том 204 из LIPIcs, стр. 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)A colorful Steinitz Lemma with application to block-structured integer programs., , и . Math. Program., 204 (1): 677-702 (марта 2024)On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants., , и . SIAM J. Discret. Math., 32 (3): 1706-1720 (2018)Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time., , , , и . SODA, стр. 1666-1681. SIAM, (2021)Notes on a, b, c-Modular Matrices., , и . CoRR, (2021)