Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarOperations Research Letters, Volume 32
Volume 32, Number 1, January 2004
Cor A. J. Hurkens, Gerhard J. Woeginger:
On the nearest neighbor rule for the traveling salesman problem. 1-4Alberto Caprara, Michele Monaci:
On the two-dimensional Knapsack Problem. 5-14Geir Dahl, Luis Gouveia:
On the directed hop-constrained shortest path problem. 15-22Tamás Fleiner, András Frank, Satoru Iwata:
A constrained independent set problem for matroids. 23-26Abraham P. Punnen, Yash P. Aneja:
Lexicographic balanced optimization problems. 27-30Akiyoshi Shioura:
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. 31-35Ionut D. Aron, Pascal Van Hentenryck:
On the complexity of the robust spanning tree problem with interval data. 36-40Maxim Sviridenko:
A note on maximizing a submodular set function subject to a knapsack constraint. 41-43Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
Models for representing piecewise linear cost functions. 44-48Dorit S. Hochbaum:
Monotonizing linear programs with up to two nonzeroes per column. 49-58András Prékopa, Xiaoling Hou:
A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP. 59-67Andrea Grosso, Federico Della Croce, Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. 68-72Adam Wierman, Nikhil Bansal, Mor Harchol-Balter:
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. 73-76Zhe George Zhang, Naishuo Tian:
The N threshold policy for the GI/M/1 queue. 77-84Bong Dae Choi, Bara Kim, Gang Uk Hwang, Jae-kyoon Kim:
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1. 85-93Jens Leth Hougaard, Hans Keiding:
Continuous benchmark selections. 94-98
Volume 32, Number 2, March 2004
Eric Rosenberg:
The expected length of a random line segment in a rectangle. 99-102Anand Paul, Genaro Gutierrez:
Mean sample spacings, sample size and variability in an auction-theoretic framework. 103-108Andrew B. Philpott, Geoffrey Pritchard:
Financial transmission rights in convex pool markets. 109-113P. A. Kattuman, R. J. Green, Janusz W. Bialek:
Allocating electricity transmission costs through tracing: a game-theoretic rationale. 114-120Andreas Ehrenmann:
Manifolds of multi-leader Cournot equilibria. 121-125Roland W. Freund, Florian Jarre:
A sensitivity result for semidefinite programs. 126-132Jean B. Lasserre:
Integer programming, Barvinok's counting algorithm and Gomory relaxations. 133-137Thorsten Koch:
The final NETLIB-LP results. 138-142Herminia I. Calvete, Carmen Galé:
Solving linear fractional bilevel programs. 143-151Tomás Tichý:
Randomized on-line scheduling on three processors. 152-158Alberto Caprara, Ulrich Pferschy:
Worst-case analysis of the subset sum algorithm for bin packing. 159-166Young-Soo Myung, Hu-gon Kim:
On the ring loading problem with demand splitting. 167-173Igor Averbakh:
Minmax regret linear resource allocation problems. 174-180Eddie Cheng, Sven de Vries:
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. 181-184Raf Jans, Zeger Degraeve:
Improved lower bounds for the capacitated lot sizing problem with setup times. 185-195Jeffrey P. Kharoufeh:
Erratum to "Explicit results for wear processes in a Markovian environment" [Oper. Res. Lett. 31(3) (2003) 237-244]. 196Paul A. Rubin:
Comment on "A nonlinear Lagrangian dual for integer programming". 197-198
Volume 32, Number 3, May 2004
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein:
Flood search under the California Split rule. 199-206Matthias Köppe, Robert Weismantel:
Cutting planes from a mixed integer Farkas lemma. 207-211Woonghee Tim Huh:
Finding 2-edge connected spanning subgraphs. 212-216Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Local approximations for maximum partial subgraph problem. 217-224Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati:
A branch and bound algorithm for the robust shortest path problem with interval data. 225-232Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park:
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. 233-239Patrice Marcotte, Gilles Savard, Frédéric Semet:
A bilevel programming approach to the travelling salesman problem. 240-248Arie Tamir:
Sorting weighted distances with applications to objective function evaluations in single facility location problems. 249-257Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania:
Preemptive scheduling of equal-length jobs to maximize weighted throughput. 258-264Jiyeon Lee:
Asymptotics of overflow probabilities in Jackson networks. 265-272Matthieu van der Heijden, Aart van Harten, Andrei Sleptchenko:
Approximations for Markovian multi-class queues with preemptive priorities. 273-282Elmira Popova:
Basic optimality results for Bayesian group replacement policies. 283-287Edmond J. Vanderperre:
Reliability analysis of a renewable multiple cold standby system. 288-292Yingchieh Yeh, Bruce W. Schmeiser:
On the robustness of batching estimators. 293-298
Volume 32, Number 4, July 2004
Bruce A. Reed, Kaleigh Smith, Adrian Vetta:
Finding odd cycle transversals. 299-301Robert Bosch, Adrianne Herman:
Continuous line drawings via the traveling salesman problem. 302-303John J. Bartholdi III, Paul Goldsman:
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. 304-308Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Min-max tree covers of graphs. 309-315Asaf Levin:
A better approximation algorithm for the budget prize collecting tree problem. 316-319Gerhard J. Woeginger:
Inapproximability results for no-wait job shop scheduling. 320-325Fabrice Tercinet, Christophe Lenté, Emmanuel Néron:
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. 326-330Tamás Kis:
On the complexity of the car sequencing problem. 331-335Gautam Appa, Dimitris Magos, Ioannis Mourtos:
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. 336-344Geir Dahl, Njål Foldnes, Luis Gouveia:
A note on hop-constrained walk polytopes. 345-349Uwe Schäfer:
On the modulus algorithm for the linear complementarity problem. 350-354Mohan L. Chaudhry, Seok Ho Chang:
Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B. 355-363Y. W. Yang Woo Shin:
BMAP/G/1 queue with correlated arrivals of customers and disasters. 364-373Srinagesh Gavirneni:
Periodic review inventory control with fluctuating purchasing costs. 374-379G. Petrella:
An extension of the Euler Laplace transform inversion algorithm with applications in option pricing. 380-389Rudolf Müller:
Book reviews. 390-391David Hartvigsen:
Book review. 391-392Adam N. Letchford:
Book review. 393-394Gilbert Laporte:
Book review. 394-397
Volume 32, Number 5, September 2004
Chris C. Heyde, S. G. Kou:
On the controversy over tailweight of distributions. 399-408Anand Paul, Indranil Bose:
Demand variability and incentives in inventory-based contracts. 409-414I. T. Castro, E. L. Sanjuán:
Power processes and their application to reliability. 415-421Michael A. Zazanis:
Cycle times in single server cyclic Jackson networks. 422-430Refik Güllü:
Analysis of an M/G/ queue with batch arrivals and batch-dedicated servers. 431-438Attahiru Sule Alfa:
Loss probability in an overloaded discrete-time GI/G/1/K system with very large K. 439-447E. Lerzan Örmeci, Apostolos Burnetas:
Admission control with batch arrivals. 448-454Hanif D. Sherali, Churlzu Lim:
On embedding the volume algorithm in a variable target value method. 455-462Javier Peña:
Conic systems and sublinear mappings: equivalent approaches. 463-467Kazuo Murota, Hiroo Saito, Robert Weismantel:
Optimality criterion for a class of nonlinear integer programs. 468-472Samir Khuller, Yoo Ah Kim:
Equivalence of two linear programming relaxations for broadcast scheduling. 473-478Carla P. Gomes, Rommel G. Regis, David B. Shmoys:
An improved approximation algorithm for the partial Latin square extension problem. 479-484Nicole Megow, Andreas S. Schulz:
On-line scheduling to minimize average completion time revisited. 485-490Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
An approximation algorithm for the edge-dilation k-center problem, . 491-495Alberto Caprara:
Book reviews. 496-497Gerhard Reinelt:
Book review. 497-498
Volume 32, Number 6, November 2004
Andrew B. Kahng, Sherief Reda:
Match twice and stitch: a new TSP tour construction heuristic. 499-509Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim:
Robust linear optimization under general norms. 510-516Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev:
A new linearization technique for multi-quadratic 0-1 programming problems. 517-522Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo:
The combinatorics of pivoting for the maximum weight clique. 523-529Asaf Levin:
Strongly polynomial-time approximation for a class of bicriteria problems. 530-534Rob van Stee:
An approximation algorithm for square packing. 535-539Reuven Bar-Yehuda, Dror Rawitz:
Local ratio with negative weights. 540-546Jesper Makholm Byskov:
Enumerating maximal independent sets with applications to graph colouring. 547-556Alix Munier Kordon:
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. 557-564Bas van Velzen:
Dominating set games. 565-573Bong Dae Choi, Bara Kim:
Non-ergodicity criteria for denumerable continuous time Markov processes. 574-580Chung-Yee Lee:
Inventory replenishment model: lot sizing versus just-in-time delivery. 581-590Uriel G. Rothblum:
Tales of Hoffman. 591-594
last updated on 2019-10-20 00:33 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
