default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 81
Volume 81, June 1998
- Gautam Mitra, István Maros, Anna Sciomachen:
Preface. 0 - Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
A nonconvex weighted potential function forpolynomial target following methods. 3-14 - A. Csébfalvi:
A nonlinear path-following method for computingthe equilibrium curve of structures. 15-24 - J. A. J. Hall, K. I. M. McKinnon:
ASYNPLEX, an asynchronous parallelrevised simplex algorithm. 27-50 - Frantisek Mráz:
Calculating the exact bounds of optimal valuesin LP with interval coefficients. 51-62 - Stefan Chanas, Dorota Kuchta:
An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions. 63-72 - Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares:
A block active set algorithm for large-scalequadratic programming with box constraints. 75-96 - Florian A. Potra, Rongqin Sheng:
A path following method for LCP withsuperlinearly convergent iteration sequence. 97-114 - Vladimir A. Bulavsky, Vyacheslav V. Kalashnikov:
A Newton-like approach to solvingan equilibrium problem. 115-128 - Giorgio Consigli, M. A. H. Dempster:
Dynamic stochastic programming for asset-liability management. 131-162 - M. A. H. Dempster, R. T. Thompson:
Parallelization and aggregation ofnested Benders decomposition. 163-188 - Alexei A. Gaivoronski, Fabio Stella:
Stochastic optimization with structured distributions: The case of Bayesian nets. 189-212 - Elena A. Medova:
Chance-constrained stochastic programming forintegrated services network management. 213-230 - Agha Iqbal Ali:
Reformulation of the set partitioning problem as apure network with special order set constraints. 233-250 - Norman D. Curet:
Implementation of a steepest-edge primal - dualsimplex method for network linear programs. 251-270 - Lorenzo Brunetta, Guglielmo Guastalla, Lisa Navazio:
Solving the multi-airport Ground Holding Problem. 271-288 - Mauro Dell'Amico, Francesco Maffioli, Anna Sciomachen:
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. 289-306 - Carlos J. Luz, Domingos M. Cardoso:
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph. 307-320 - Yakov Zinder, Duncan Roper:
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness. 321-343 - M. Sánchez-García, M. I. Sobrón, Begoña Vitoriano:
On the set covering polytope: Facets with coefficients in {0, 1, 2, 3}. 343-356 - Marielle Christiansen, Bjørn Nygreen:
A method for solving ship routing problemswith inventory constraints. 357-378 - Laureano F. Escudero, Silvano Martello, Paolo Toth:
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. 379-404 - Les R. Foulds, Horst W. Hamacher, John M. Wilson:
Integer programming approaches tofacilities layout models with forbidden areas. 405-418 - Mozafar T. Hajian, Hani El Sakkout, Mark Wallace, Jonathan M. Lever, Barry Richards:
Towards a closer integration of finite domainpropagation and simplex-based algorithms. 421-433 - José Mauricio Pinto, Ignacio E. Grossmann:
Assignment and sequencing models for thescheduling of process systems. 433-466 - Peter Barth, Alexander Bockmayr:
Modelling discrete optimisation problems inconstraint logic programming. 467-496 - Rodrigo Lamas Vieira Pinto, B. Rustem:
Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions. 497-514
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-02 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
