default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 20
Volume 20, Number 1, January 1997
- Jean-Louis Goffin, Patrice Marcotte, Daoli Zhu:
An analytic center cutting plane method for pseudomonotone variational inequalities. 1-6 - C. A. van Eijl, C. P. M. van Hoesel:
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. 7-13 - Hans van Maaren, Tamás Terlaky:
Inverse barriers and CES-functions in linear programming. 15-20 - Jean-Marie Bourjolly, Gilbert Laporte, Hélène Mercure:
A combinatorial column generation algorithm for the maximum stable set problem. 21-29 - Weixiong Zhang
:
A note on the complexity of the asymmetric traveling salesman problem. 31-38 - Abdelaziz Foul:
A characterization of an n by 2n "Q0"-matrix. 39-44 - Konstantinos Dosios, Konstantinos Paparrizos:
Resolution of the problem of degeneracy in a primal and dual simplex algorithm. 45-50
Volume 20, Number 2, February 1997
- Kurt M. Bretthauer, Bala Shetty:
Quadratic resource allocation with generalized upper bounds. 51-57 - E. Andrew Boyd:
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball. 59-63 - S. T. Webster:
The complexity of scheduling job families about a common due date. 65-74 - Mikhail Y. Kovalyov, Frank Werner:
A polynomial approximation scheme for problem F2/rj/Cmax. 75-79 - J. Scott Provan:
On finding two-connected subgraphs in planar graphs. 81-84 - Christian Kanzow:
A new approach to continuation methods for complementarity problems with uniform P-functions. 85-92 - Guntram Scheithauer, Johannes Terno:
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. 93-100
Volume 20, Number 3, March 1997
- Ravindra K. Ahuja, James B. Orlin:
Equivalence of the primal and dual simplex algorithms for the maximum flow problem. 101-108 - Barry L. Nelson, Bruce W. Schmeiser, Michael R. Taaffe, Jin Wang:
Approximation-assisted point estimation. 109-118 - Edward P. K. Tsang, Christos Voudouris:
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem. 119-127 - Chung-Yee Lee:
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. 129-139 - Takahito Kuno, Takahiro Utsunomiya:
Minimizing a linear multiplicative-type function under network flow constraints. 141-148
Volume 20, Number 4, May 1997
- Gerhard J. Woeginger:
A polynomial-time approximation scheme for maximizing the minimum machine completion time. 149-154 - Charles R. Sox:
Dynamic lot sizing with random demand and non-stationary costs. 155-164 - Horst W. Hamacher, Anita Schöbel:
A note on center problems with forbidden polyhedra. 165-169 - Aiping Liao:
Modifying the BFGS method. 171-177 - Roberto Cominetti, Christian Michelot:
Sufficient conditions for coincidence in ℓ1 multifacility location problems. 179-185 - Eitan Altman, Serguei Foss:
Polling on a space with general arrival and service time distribution. 187-194 - Ernesto de Queirós Vieira Martins, José Luis Esteves dos Santos:
An algorithm for the quickest path problem. 195-198
Volume 20, Number 5, June 1997
- Joseph Abate, Ward Whitt:
Limits and approximations for the M/G/1 LIFO waiting-time distribution. 199-206 - Thomas Tautenhahn, Gerhard J. Woeginger:
Minimizing the total completion time in a unit-time open shop with release times. 207-212 - Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. 213-221 - Liqun Qi:
On superlinear convergence of quasi-Newton methods for nonsmooth equations. 223-228 - Wolfgang Stadje:
Asymptotic normality of discounted random series with applications in reliability and queueing. 229-235 - Yishay Spector, Dror Zuckerman:
Expenditure patterns and timing of patent protection in a competitive R&D environment. 237-242 - Raymond G. Vickson:
On the probability distribution of total quality under sublot inspection and process restoration. 243-247
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-11-21 20:29 CET 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:
