History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 29 total

Tighter bounds for the gap and non-IRUP constructions in the one-dimensional cutting stock problem. (English)
Optimization 51, No. 6, 927-963 (2002).
WorldCat.org
1
Families of non-IRUP instances of the one-dimensional cutting stock problem. (English)
Discrete Appl. Math. 121, No.1-3, 229-245 (2002).
WorldCat.org
2
Phi-functions for primary 2D-objects (English)
Stud. Inform. Univ. 2, No. 1, 1-32 (2002).
WorldCat.org
3
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. (English)
J. Oper. Res. Soc. 52, No. 12, 1390-1401 (2001).
WorldCat.org
4
Tighter relaxations for the cutting stock problem. (English)
Eur. J. Oper. Res. 112, No.3, 654-663 (1999).
WorldCat.org
5
New cases of the cutting stock problem having MIRUP. (English)
Math. Methods Oper. Res. 48, No.1, 105-115 (1998).
WorldCat.org
6
Numerical methods in optimization. (Numerik der Optimierung.) 2., durchges. Aufl. (German)
Teubner Studienbücher: Mathematik. Stuttgart: B. G. Teubner. 351 S. DM 42.80; öS 312.00; sFr. 39.00 (1997).
WorldCat.org
7
The solution of two-stage guillotine cutting stock problems having extremely varying order demands. (English)
Eur. J. Oper. Res. 91, No.3, 543-552 (1996).
WorldCat.org
8
The G4-heuristic for the pallet loading problem. (English)
J. Oper. Res. Soc. 47, No.4, 511-522 (1996).
WorldCat.org
9
The modified integer round-up property of the one-dimensional cutting stock problem. (English)
Eur. J. Oper. Res. 84, No.3, 562-571 (1995).
WorldCat.org
10
A branch \& bound algorithm for solving one-dimensional cutting stock problems exactly. (English)
Appl. Math. 23, No.2, 151-167 (1995).
WorldCat.org
11
A polynomial time algorithm for the guillotine pallet loading problem. (English)
INFOR 32, No.4, 275-287 (1994).
WorldCat.org
12
Modeling of packing problems. (English)
Optimization 28, No.1, 63-84 (1993).
WorldCat.org
13
Numerical methods in optimization. (Numerik der Optimierung.) (German)
Teubner Studienbücher: Mathematik. Stuttgart: Teubner. 351 S. DM 36.80 (1993).
WorldCat.org
14
A new branch and bound algorithm for project scheduling with resource constraints. (English)
Zastosow. Mat. 21, No.2, 273-282 (1991).
WorldCat.org
15
On the stochastic complexity of the asymmetric traveling salesman problem. (English)
Eur. J. Oper. Res. 43, No.3, 313-316 (1989).
WorldCat.org
16
The partition of a square in rectangles with equal areas. (English)
J. Inf. Process. Cybern. 24, No.4-5, 189-200 (1988).
Reviewer: R.Koch
WorldCat.org
17
Guillotine cutting of defective boards. (English)
Optimization 19, No.1, 111-121 (1988).
Reviewer: N.Ivanov
WorldCat.org
18
The partition of a square in rectangles with equal areas (English)
Elektronische Informationsverarbeitung und Kybernetik 24, No. 4-5, 189-200 (1988).
WorldCat.org
19
Zuschnittprobleme und ihre praktische Lösung. Mathematische Modelle von Layout-Problemen (Layout problems and their practical solution. Mathematical models of layout problems). (Lizenzausg. des VEB Fachbuchverlag Leipzig). (German)
Mathematik für Ingenieure. Thun-Frankfurt/Main: Verlag Harri Deutsch. 207 s.; DM 19.80 (1987).
Reviewer: H.-D.Hecker
WorldCat.org
20
first | previous | 1 21 | next | last

Result 1 to 20 of 29 total

Valid XHTML 1.0 Transitional Valid CSS!