| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A block active set algorithm for large-scalequadratic programming with box constraints
|
Fernandes, L.
|
|
1998
|
81 |
0 |
p. 75-96
|
artikel
|
| 2 |
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph
|
Luz, Carlos J.
|
|
1998
|
81 |
0 |
p. 307-320
|
artikel
|
| 3 |
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem
|
Dell'Amico, M.
|
|
1998
|
81 |
0 |
p. 289-306
|
artikel
|
| 4 |
A method for solving ship routing problemswith inventory constraints
|
Christiansen, Marielle
|
|
1998
|
81 |
0 |
p. 357-378
|
artikel
|
| 5 |
An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions
|
Chanas, Stefan
|
|
1998
|
81 |
0 |
p. 63-72
|
artikel
|
| 6 |
A Newton-like approach to solvingan equilibrium problem
|
Bulavsky, Vladimir A.
|
|
1998
|
81 |
0 |
p. 115-128
|
artikel
|
| 7 |
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness
|
Zinder, Yakov
|
|
1998
|
81 |
0 |
p. 321-343
|
artikel
|
| 8 |
A nonconvex weighted potential function forpolynomial target following methods
|
de Klerk, E.
|
|
1998
|
81 |
0 |
p. 3-14
|
artikel
|
| 9 |
A nonlinear path-following method for computingthe equilibrium curve of structures
|
Csébfalvi, A.
|
|
1998
|
81 |
0 |
p. 15-24
|
artikel
|
| 10 |
A path following method for LCP withsuperlinearly convergent iteration sequence
|
Potra, Florian A.
|
|
1998
|
81 |
0 |
p. 97-114
|
artikel
|
| 11 |
Assignment and sequencing models for thescheduling of process systems
|
Pinto, Jose M.
|
|
1998
|
81 |
0 |
p. 433-466
|
artikel
|
| 12 |
ASYNPLEX, an asynchronous parallelrevised simplex algorithm
|
Hall, J. A. J.
|
|
1998
|
81 |
0 |
p. 27-50
|
artikel
|
| 13 |
Calculating the exact bounds of optimal valuesin LP with interval coefficients
|
Mráz, Frantisÿek
|
|
1998
|
81 |
0 |
p. 51-62
|
artikel
|
| 14 |
Chance-constrained stochastic programming forintegrated services network management
|
Medova, E. A.
|
|
1998
|
81 |
0 |
p. 213-230
|
artikel
|
| 15 |
Dynamic stochastic programmingfor asset-liability management
|
Consigli, G.
|
|
1998
|
81 |
0 |
p. 131-162
|
artikel
|
| 16 |
Implementation of a steepest-edge primal - dualsimplex method for network linear programs
|
Curet, Norman D.
|
|
1998
|
81 |
0 |
p. 251-270
|
artikel
|
| 17 |
Integer programming approaches tofacilities layout models with forbidden areas
|
Foulds, L. R.
|
|
1998
|
81 |
0 |
p. 405-418
|
artikel
|
| 18 |
Modelling discrete optimisation problems inconstraint logic programming
|
Barth, Peter
|
|
1998
|
81 |
0 |
p. 467-496
|
artikel
|
| 19 |
On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}
|
Sánchez-García, M.
|
|
1998
|
81 |
0 |
p. 343-356
|
artikel
|
| 20 |
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems
|
Escudero, L. F.
|
|
1998
|
81 |
0 |
p. 379-404
|
artikel
|
| 21 |
Parallelization and aggregation ofnested Benders decomposition
|
Dempster, M. A. H.
|
|
1998
|
81 |
0 |
p. 163-188
|
artikel
|
| 22 |
Preface
|
Mitra, G.
|
|
1998
|
81 |
0 |
p. 0
|
artikel
|
| 23 |
Reformulation of the set partitioning problem as apure network with special order set constraints
|
Iqbal Ali, Agha
|
|
1998
|
81 |
0 |
p. 233-250
|
artikel
|
| 24 |
Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions
|
Pinto, R. L. V.
|
|
1998
|
81 |
0 |
p. 497-514
|
artikel
|
| 25 |
Solving the multi-airport Ground Holding Problem
|
Brunetta, Lorenzo
|
|
1998
|
81 |
0 |
p. 271-288
|
artikel
|
| 26 |
Stochastic optimization with structured distributions:The case of Bayesian nets
|
Gaivoronski, A.
|
|
1998
|
81 |
0 |
p. 189-212
|
artikel
|
| 27 |
Towards a closer integration of finite domainpropagation and simplex-based algorithms
|
Hajian, Mozafar T.
|
|
1998
|
81 |
0 |
p. 421-433
|
artikel
|
Tijdschrift beschrijving