( en | de | ru )

 

Disambiguation of "Mitra, Gautam"

Author of the publication

copydeleteadd this publication to your clipboard
Investigating the sparse simplex algorithm on a distributed memory multiprocessor.

, and . Parallel Comput., 26 (1): 151-170 (2000)

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.

Gautam Chaurasia

Gautam Sagar

Sameer Gautam

Sanjivan Gautam

Gautam Singh

 

Other publications of authors with the same name

Investigation of some branch and bound strategies for the solution of mixed integer linear programs.. Math. Program., 4 (1): 155-170 (1973)Introduction: Optimization and Risk Modelling.. Comput. Optim. Appl., 32 (1-2): 5-8 (2005)A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound., , and . Eur. J. Oper. Res., 164 (1): 12-23 (2005)Investigating the sparse simplex algorithm on a distributed memory multiprocessor., and . Parallel Comput., 26 (1): 151-170 (2000)Computational solution of capacity planning models under uncertainty., , , , and . Parallel Comput., 26 (5): 511-538 (2000)Integrating market and credit risk: A simulation and optimisation perspective, , and . Journal of Banking & Finance, 30 (2): 717--742 (February 2006)Solving Large Scale Linear Programming Problems Using an Interior Point Method on a Massively Parallel Simd Computer., , and . Parallel Algorithms Appl., 4 (3-4): 301-316 (1994)AI, Machine Learning and sentiment analysis applied to financial markets and consumer markets., , and . Comput. Manag. Sci., 17 (4): 493-494 (2020)Extracting pure network submatrices in linear programs using signed graphs., , , and . Discret. Appl. Math., 137 (3): 359-372 (2004)Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems., and . INFORMS J. Comput., 10 (2): 248-260 (1998)