default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEng Ung Choo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j18]Eng Ung Choo, William C. Wedley, Diederik J. D. Wijnmalen:
Mathematical Support for the Geometric Mean when Deriving a Consistent Matrix from a Pairwise Ratio Matrix. Fundam. Informaticae 144(3-4): 263-278 (2016)- [j17]William C. Wedley, Eng Ung Choo, Diederik J. D. Wijnmalen:
Efficacy Analysis of Ratios from Pairwise Comparisons. Fundam. Informaticae 146(3): 321-338 (2016) - 2010
- [j16]Eng Ung Choo, William C. Wedley:
Estimating ratio scale values when units are unspecified. Comput. Ind. Eng. 59(2): 200-208 (2010)
2000 – 2009
- 2008
- [j15]G. Bajwa, Eng Ung Choo, William C. Wedley:
Effectiveness Analysis of Deriving Priority Vectors from Reciprocal Pairwise Comparison Matrices. Asia Pac. J. Oper. Res. 25(3): 279-299 (2008) - 2004
- [j14]Eng Ung Choo, William C. Wedley:
A common framework for deriving preference values from pairwise comparison matrices. Comput. Oper. Res. 31(6): 893-908 (2004) - 2001
- [j13]William C. Wedley, Eng Ung Choo, Bertram Schoner:
Magnitude adjustment for AHP benefit/cost ratios. Eur. J. Oper. Res. 133(2): 342-351 (2001)
1990 – 1999
- 1999
- [j12]Gin Hor Chan, Z. H. Xia, Eng Ung Choo:
The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters. Comput. Oper. Res. 26(2): 179-188 (1999) - 1997
- [j11]Jane W. Moy, Kim Fung Lam, Eng Ung Choo:
Deriving the partial values in MCDM by goal programming. Ann. Oper. Res. 74: 277-288 (1997) - 1993
- [j10]Kim Fung Lam
, Eng Ung Choo:
A linear goal programming model for classification with non-monotone attributes. Comput. Oper. Res. 20(4): 403-408 (1993) - 1992
- [j9]H. Hsieh, Kim Fung Lam, Eng Ung Choo:
Comparative study of dynamic lot sizing heuristics with backlogging. Comput. Oper. Res. 19(5): 393-407 (1992) - 1990
- [j8]Eng Ung Choo, Gin Hor Chan:
Two-way eyeballing heuristics in dynamic lot sizing with backlogging. Comput. Oper. Res. 17(4): 359-363 (1990)
1980 – 1989
- 1989
- [j7]Eng Ung Choo, Gin Hor Chan:
Eyeballing heuristics for dynamic lot size problems. Comput. Oper. Res. 16(3): 189-193 (1989) - 1985
- [j6]Eng Ung Choo, Kim Peu Chew:
Optimal value functions in parametric programming. Z. Oper. Research 29(1): 47-57 (1985) - 1984
- [j5]Eng Ung Choo:
Technical Note - Proper Efficiency and the Linear Fractional Vector Maximum Problem. Oper. Res. 32(1): 216-220 (1984) - [j4]Kim-Lin Chew, Eng Ung Choo:
Pseudolinearity and efficiency. Math. Program. 28(2): 226-239 (1984) - 1983
- [j3]Eng Ung Choo, Derek R. Atkins:
Proper Efficiency in Nonconvex Multicriteria Programming. Math. Oper. Res. 8(3): 467-470 (1983) - [j2]Ralph E. Steuer, Eng Ung Choo:
An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Program. 26(3): 326-344 (1983) - 1980
- [j1]Eng Ung Choo, Derek R. Atkins:
An interactive algorithm for multicriteria programming. Comput. Oper. Res. 7(1-2): 81-87 (1980)
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:43 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:
