default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJørgen Tind
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j19]Jens Leth Hougaard, Jørgen Tind:
Cost allocation and convex data envelopment. Eur. J. Oper. Res. 194(3): 939-947 (2009)- [r2]Jørgen Tind:
Decomposition Principle of Linear Programming. Encyclopedia of Optimization 2009: 630-632 - [r1]Jørgen Tind:
Saddle Point Theory and Optimality Conditions. Encyclopedia of Optimization 2009: 3355-3357 - 2007
- [j18]Kathrin Klamroth
, Jørgen Tind:
Constrained optimization using multiple objective programming. J. Glob. Optim. 37(3): 325-355 (2007) - 2004
- [j17]Kathrin Klamroth, Jørgen Tind, Sibylle Zust:
Integer Programming Duality in Multiple Objective Programming. J. Glob. Optim. 29(1): 1-18 (2004) - 2003
- [j16]Kathrin Klamroth, Jørgen Tind, Margaret M. Wiecek:
Unbiased approximation in multicriteria optimization. Math. Methods Oper. Res. 56(3): 413-437 (2003) - [j15]Jørgen Tind:
Preface. Math. Program. 97(1-2): 1 (2003) - 2001
- [j14]Michael Brock, Jørgen Tind:
Dynamic productivity improvement in a model with multiple processes. Math. Methods Oper. Res. 54(3): 387-393 (2001)
1990 – 1999
- 1999
- [j13]Ruben Kirkeby Martinson, Jørgen Tind:
An interior point method in Dantzig-Wolfe decomposition. Comput. Oper. Res. 26(12): 1195-1216 (1999) - [j12]Jørgen Tind, Margaret M. Wiecek:
Augmented Lagrangian and Tchebycheff Approaches in Multiple Objective Programming. J. Glob. Optim. 14(3): 251-266 (1999) - 1998
- [j11]Claus C. Carøe, Jørgen Tind:
L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83: 451-464 (1998) - 1996
- [j10]Flemming Christensen, Mikael Lind, Jørgen Tind:
On the nucleolus of NTU-games defined by multiple objective linear programs. Math. Methods Oper. Res. 43(3): 337-352 (1996) - [j9]Aharon Ben-Tal, Jørgen Tind:
Duality with multiple criteria and multiple resources. Oper. Res. Lett. 19(5): 201-206 (1996) - 1992
- [j8]Christian Larsen, Jørgen Tind:
Lagrangean duality for facial programs with applications to integer and complementarity problems. Oper. Res. Lett. 11(5): 293-302 (1992) - 1991
- [j7]Jørgen Tind:
Decomposition in global optimization. J. Glob. Optim. 1(2): 131-144 (1991)
1980 – 1989
- 1989
- [j6]Egon Balas, Joseph M. Tama, Jørgen Tind:
Sequential convexification in reverse convex and disjunctive programming. Math. Program. 44(1-3): 337-350 (1989) - 1988
- [j5]Søren Holm, Jørgen Tind:
A unified approach for price directive decomposition procedures in integer programming. Discret. Appl. Math. 20(3): 205-219 (1988) - 1982
- [j4]Rainer E. Burkard, Horst W. Hamacher, Jørgen Tind:
On abstract duality in mathematical programming. Z. Oper. Research 26(1): 197-209 (1982) - [j3]Jørgen Tind, Laurence A. Wolsey:
On the use of penumbras in blocking and antiblocking theory. Math. Program. 22(1): 71-81 (1982) - 1981
- [j2]Jørgen Tind, Laurence A. Wolsey:
An elementary survey of general duality theory in mathematical programming. Math. Program. 21(1): 241-261 (1981)
1970 – 1979
- 1974
- [j1]Jørgen Tind:
Blocking and antiblocking sets. Math. Program. 6(1): 157-166 (1974)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
