io-port.net

io-port 01859502 Artalejo, J.R.; Pozo, M.

Numerical calculation of the stationary distribution of the main multiserver retrial queue. (English)

Ann. Oper. Res. 116, 41-56 (2002).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05113325 Gallivan, K.; Gannon, D.; Jalby, W.; Malony, A.; Wijshoff, H.

Experimentally Characterizing the Behavior of Multiprocessor Memory Systems: A Case Study. (English)

IEEE Transactions on Software Engineering 16, No.02, 216-223 (1990).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 04070290 Benczur, András

Information measurement in relational databases. (English)

Mathematical fundamentals of database systems, 1st Symp., Dresden/GDR 1987, Lect. Notes Comput. Sci. 305, 1-9 (1988).

Reviewer: B.Thalheim

3

PDF XML AMS-TeX TEXT BIBTeX

io-port 03823485 Mole, R.H.

The curse of unintended rounding error: A case from the vehicle scheduling literature. (English)

J. Oper. Res. Soc. 34, 601-613 (1983).

4

PDF XML AMS-TeX TEXT BIBTeX

io-port 03815356 Barth, Gerhard

Analyzing algorithms by Markov chains. (English)

Methods Oper. Res. 45, 405-418 (1983).

5

PDF XML AMS-TeX TEXT BIBTeX

io-port 03728025 Itoga, Stephen Y.

A generalization of the stable marriage problem. (English)

J. Oper. Res. Soc. 32, 1069-1074 (1981).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 03691104 Armstrong, Ronald D.; Klingman, Darwin; Whitman, David

Implementation and analysis of a variant of the dual method for the capacitated transshipment problem. (English)

Eur. J. Oper. Res. 4, 403-420 (1980).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 03683357 D’Atri, Gianfranco

A note on heuristics for the traveling salesman problem. (English)

Math. Program. 19, 111-114 (1980).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 03683351 Rajaram, Navaratna S.

Random oscillations arising in the MACSYMA implementation of Khachian- type algorithms in linear programming. (English)

SIGSAM Bull. 14, No.2, 32-35 (1980).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 03679547 Smith, T.H.C.

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation. (English)

Math. Program. Study 12, 108-114 (1980).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 03641205 Abadie, J.

Une modification de la méthode GRG. (French)

RAIRO, Rech. Opér. 13, 323-326 (1979).

11

PDF XML AMS-TeX TEXT BIBTeX

io-port 03637590 Schenk, G.; Thiers, G.

A comparison of some algorithms and heuristics for solving the Hitchcock- Koopmans transportation problem. (English)

Rev. Belg. Stat. Inf. Rech. Oper. 19, No.2, 36-52 (1979).

12

PDF XML AMS-TeX TEXT BIBTeX

io-port 03675612 Layman, Christine H.; O’Neill, Richard P.

A study of the effect of LP parameters on algorithm performance. (English)

Computers and mathematical programming, Proc. bicenten. Conf., Gaithersburg/Md. 1976, NBS spec. Publ. 502, 251-260 (1978).

13

PDF XML AMS-TeX TEXT BIBTeX

io-port 03659278 Dembo, Ron S.; Mulvey, John M.

On the analysis and comparison of mathematical programming algorithms and software. (English)

Computers and mathematical programming, Proc. bicenten. Conf., Gaithersburg/Md. 1976, NBS spec. Publ. 502, 106-116 (1978).

14

PDF XML AMS-TeX TEXT BIBTeX

io-port 03641195 Terno, Johannes

Grundprinzipien der diskreten Optimierung. (German)

Wiss. Z. Tech. Univ. Dres. 27, 1159-1161 (1978).

15

PDF XML AMS-TeX TEXT BIBTeX