Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 12
Volume 12, Number 1, July 1992
- Jean-Philippe Vial:
A projective algorithm for linear programming with no regularity condition. 1-2 - Vangelis F. Magirou:
An improved partial solution to the task assignment and multiway cut problems. 3-10 - Michael Bastian, M. Volkmer:
A perfect forward procedure for a single facility dynamic location/relocation problem. 11-16 - Jerzy Kamburowski:
Bounding the distribution of project duration in PERT networks. 17-22 - Fred J. Rispoli:
The monotonic diameter of the perfect matching and shortest path polytopes. 23-27 - Alain Billionnet, Alain Sutter:
An efficient algorithm for the 3-satisfiability problem. 29-36 - Ushio Sumita, Yasushi Masuda
:
Analysis of multivariate Markov modulated Poisson processes. 37-45 - Guillermo Gallego, Dong Shaw, David Simchi-Levi:
The complexity of the staggering problem, and other classical inventory problems. 47-52 - Jeffrey L. Ringuest, Thomas R. Gulledge:
An interactive multi-objective gradient search. 53-58 - Shinji Mizuno, Atsushi Nagasawa:
Strict monotonicity in Todd's low-complexity algorithm for linear programming. 59-64
Volume 12, Number 2, August 1992
- Rajeev Kohli, Ramesh Krishnamurti:
A total-value greedy heuristic for the integer knapsack problem. 65-71 - Gerard Sierksma, Gert A. Tijssen:
Faces with large diameter on the symmetric traveling salesman polytope. 73-77 - Fumio Ohi, Frank Proschan:
Crossing properties of reliability functions. 79-81 - David P. Williamson:
Analysis of the Held-Karp lower bound for the asymmetric TSP. 83-88 - Abraham P. Punnen:
Traveling salesman problem under categorization. 89-95 - Tetsuya Takine, Toshiharu Hasegawa:
A generalization of the decomposition property in the M/G/1 queue with server vacations. 97-99 - Diwakar Gupta:
On the economic lot scheduling problem with backlogging: The common cycle approach. 101-109 - Alejandro Neme, Luis Quintas:
Nash equilibrium strategies in repeated games with and without cost of implementation. 111-115 - Tsai Li-Hui:
Sequencing to minimize the maximum renewal cumulative cost. 117-124 - Erwin Kalvelagen, Henk C. Tijms:
ORSTAT: Software for operations research and statistics. 125-127
Volume 12, Number 3, September 1992
- Sid Browne, Gideon Weiss:
Dynamic priority rules when polling with multiple parallel servers. 129-137 - Dinah W. Cheng:
Second order properties in a tandem queue with general blocking. 139-144 - Fangruo Chen, Yu-Sheng Zheng:
Waiting time distribution in (T, S) inventory systems. 145-151 - Anurag Kumar:
On the average idle time and average queue length estimates in an M/M/1 queue. 153-157 - Johan Hellstrand, Torbjörn Larsson, Athanasios Migdalas:
A characterization of the uncapacitated network design polytope. 159-163 - Jukka Perttunen:
On the solving strategy in composite heuristics. 165-172 - Sun Wu, Udi Manber:
An algorithm for min-cost edge-disjoint cycles and its applications. 173-178 - Ronald D. Armstrong, Zhiying Jin:
Solving linear bottleneck assignment problems via strong spanning trees. 179-180 - Dick den Hertog, Cees Roos, Tamás Terlaky:
A build-up variant of the logarithmic barrier method for LP. 181-186 - Carlos Henggeler Antunes, João C. N. Clímaco:
Sensitivity analysis in MCDM using the weight space. 187-196
Volume 12, Number 4, October 1992
- Frank K. Hwang, Uriel G. Rothblum:
Generalization of an engineering principle. 197-199 - Francisco Barahona:
Separating from the dominant of the spanning tree polytope. 201-203 - John M. Mulvey, Andrzej Ruszczynski:
A diagonal quadratic approximation method for large scale linear programs. 205-215 - Sten Thore, Anna Nagurney, Jie Pan:
Generalized goal programming and variational inequalities. 217-226 - Refael Hassin:
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement. 227-233 - Lov K. Grover:
Local search and the local structure of NP-complete problems. 235-243 - Joseph Abate, Ward Whitt:
Numerical inversion of probability generating functions. 245-251 - K. Jo Min:
Inventory and pricing policies under competition. 253-261 - Ravi R. Mazumdar, Fabrice Guillemin, Vivek Badrinath, Raghavan Kannurpatti:
On pathwise behavior of queues. 263-270 - Jeffrey S. Salowe:
A simple proof of the planar rectilinear Steiner ratio. 271-274
Volume 12, Number 5, November 1992
- Joseph Abate, Ward Whitt:
Solving probability transform functional equations for numerical inversion. 275-281 - Nico M. van Dijk:
Uniformization for nonhomogeneous Markov chains. 283-291 - J. Mark Keil:
On the complexity of scheduling tasks with discrete starting times. 293-295 - Fred J. Rispoli:
An O(n) bound for the diameter of transshipment polytopes. 297-299 - Richard Loulou:
Minimal cut cover of a graph with an application to the testing of electronic boards. 301-305 - János Fülöp, Mária Prill:
On the minimax approximation in the class of the univariate piecewise constant functions. 307-312 - Yair Arian, Yonatan Levy:
Algorithms for generalized round robin routing. 313-319 - Chengbin Chu:
Efficient heuristics to minimize total flow time with release dates. 321-330 - Massimo Paolucci, Raffaele Pesenti:
Assessing a new utility/cost function for multiattribute decision making. 331-336 - Domingos M. Cardoso, João C. N. Clímaco:
The generalized simplex method. 337-348
a service of 
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-07-29 21:18 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:
