A nonconvex weighted potential function forpolynomial target following methods E. de KlerkC. RoosT. Terlaky OriginalPaper Pages: 3 - 14
A nonlinear path-following method for computingthe equilibrium curve of structures A. Csébfalvi OriginalPaper Pages: 15 - 24
ASYNPLEX, an asynchronous parallelrevised simplex algorithm J. A. J. HallK. I. M. McKinnon OriginalPaper Pages: 27 - 50
Calculating the exact bounds of optimal valuesin LP with interval coefficients Frantisÿek Mráz OriginalPaper Pages: 51 - 62
An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions Stefan ChanasDorota Kuchta OriginalPaper Pages: 63 - 72
A block active set algorithm for large-scalequadratic programming with box constraints L. FernandesA. FischerJ. Soares OriginalPaper Pages: 75 - 96
A path following method for LCP withsuperlinearly convergent iteration sequence Florian A. PotraRongqin Sheng OriginalPaper Pages: 97 - 114
A Newton-like approach to solvingan equilibrium problem Vladimir A. BulavskyVyacheslav V. Kalashnikov OriginalPaper Pages: 115 - 128
Dynamic stochastic programmingfor asset-liability management G. ConsigliM. A. H. Dempster OriginalPaper Pages: 131 - 162
Parallelization and aggregation ofnested Benders decomposition M. A. H. DempsterR. T. Thompson OriginalPaper Pages: 163 - 188
Stochastic optimization with structured distributions:The case of Bayesian nets A. GaivoronskiF. Stella OriginalPaper Pages: 189 - 212
Chance-constrained stochastic programming forintegrated services network management E. A. Medova OriginalPaper Pages: 213 - 230
Reformulation of the set partitioning problem as apure network with special order set constraints Agha Iqbal Ali OriginalPaper Pages: 233 - 250
Implementation of a steepest-edge primal - dualsimplex method for network linear programs Norman D. Curet OriginalPaper Pages: 251 - 270
Solving the multi-airport Ground Holding Problem Lorenzo BrunettaGuglielmo GuastallaLisa Navazio OriginalPaper Pages: 271 - 288
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem M. Dell'AmicoF. MaffioliA. Sciomachen OriginalPaper Pages: 289 - 306
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph Carlos J. LuzDomingos M. Cardoso OriginalPaper Pages: 307 - 320
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness Yakov ZinderDuncan Roper OriginalPaper Pages: 321 - 343
On the set covering polytope:Facets with coefficients in {0, 1, 2, 3} M. Sánchez-GarcíaM. I. SobrónB. Vitoriano OriginalPaper Pages: 343 - 356
A method for solving ship routing problemswith inventory constraints Marielle ChristiansenBjorn Nygreen OriginalPaper Pages: 357 - 378
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems L. F. EscuderoS. MartelloP. Toth OriginalPaper Pages: 379 - 404
Integer programming approaches tofacilities layout models with forbidden areas L. R. FouldsH. W. HamacherJ. M. Wilson OriginalPaper Pages: 405 - 418
Towards a closer integration of finite domainpropagation and simplex-based algorithms Mozafar T. HajianHani El-SakkoutBarry Richards OriginalPaper Pages: 421 - 433
Assignment and sequencing models for thescheduling of process systems Jose M. PintoIgnacio E. Grossmann OriginalPaper Pages: 433 - 466
Modelling discrete optimisation problems inconstraint logic programming Peter BarthAlexander Bockmayr OriginalPaper Pages: 467 - 496
Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions R. L. V. PintoB. Rustem OriginalPaper Pages: 497 - 514