Utilizing deontic operators in information systems specification
- 作者John Krogstie; Guttorm Sindre
- 卷第1卷
- 期第4期
- 印刷ISSN0947-3602
- 电子ISSN1432-010X
- 文件大小2512.71KB
- 发表时间1996
- DOI10.1007/bf01587101
- 页码210-237
Algebraic optimization: The Fermat-Weber location problemR. Chandrasekaran; A. Tamir · Mathematical Programming · 1990
Polynomially bounded algorithms for locatingp-centers on a treeR. Chandrasekaran; A. Tamir · Mathematical Programming · 1982
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio gamesR. Chandrasekaran; A. Tamir · Mathematical Programming · 1984
Polynomial testing of the query “IS ab ≥ cd?” with application to finding a minimal cost reliability ratio spanning treeR. Chandrasekaran; A. Tamir · 1984
Fully copositive matricesG. S. R. Murthy; T. Parthasarathy · Mathematical Programming · 1998
Election of CouncilMathematical Programming · 1973
Editorial policyMathematical Programming · 1973
The Mathematical Programming SocietyMathematical Programming · 1973
A linear max—min problemJames E. Falk · Mathematical Programming · 1973
Unconstrained optimization based on homogeneous modelsChristakis Charalambous · Mathematical Programming · 1973
Computable error bounds for nonlinear programmingStephen M. Robinson · Mathematical Programming · 1973
Book reviewW. F. Lucas · Mathematical Programming · 1973