default search action

combined dblp search
author search
venue search
publication search

ask others

T. M. Doup

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

1993
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/BisselingDL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/BisselingDL93
Rob H. Bisseling, T. M. Doup, L. D. J. C. Loyens:
A parallel interior point algorithm for linear programming on a network of transputers. Ann. Oper. Res. 43(2): 49-86 (1993)
1987
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/DoupT87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/DoupT87
T. M. Doup, A. J. J. Talman:
A Continuous Deformation Algorithm on the Product Space of Unit Simplices. Math. Oper. Res. 12(3): 485-521 (1987)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/DoupT87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/DoupT87
T. M. Doup, A. J. J. Talman:
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices. Math. Program. 37(3): 319-355 (1987)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/DoupLT87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/DoupLT87
T. M. Doup, Gerard van der Laan, A. J. J. Talman:
The (2ⁿ⁺¹-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria. Math. Program. 39(3): 241-252 (1987)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.