default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 19
Volume 19, Number 1, Winter 2007
- Hanif D. Sherali, Churlzu Lim
:
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability. 3-13 - Ravindra K. Ahuja, Wei Huang, H. Edwin Romeijn, Dolores Romero Morales:
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints. 14-26 - Gleb Belov, Guntram Scheithauer:
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting. 27-35 - David Pisinger, Mikkel Sigurd:
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem. 36-51 - Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. 52-63 - Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. 64-72 - Laura Di Giacomo, Giacomo Patrizi, Emanuele Argento:
Linear Complementarity as a General Solution Method to Combinatorial Problems. 73-79 - Jeffrey W. Ohlmann, Barrett W. Thomas:
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows. 80-90 - Julián Molina Luque, Manuel Laguna, Rafael Martí, Rafael Caballero:
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization. 91-100 - Michael C. Fu, Jian-Qiang Hu, Chun-Hung Chen, Xiaoping Xiong:
Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling. 101-111 - John F. Shortle, Martin J. Fischer, Percy H. Brill:
Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion. 112-120 - Jesus R. Artalejo, Antonis Economou, Maria Jesus Lopez-Herrero:
Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue. 121-126 - Rakesh Gupta, Amitava Bagchi, Sumit Sarkar:
Improving Linkage of Web Pages. 127-136 - Juan Feng, Hemant K. Bhargava, David M. Pennock:
Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms. 137-148
Volume 19, Number 2, Spring 2007
- W. David Kelton:
From the Interim Editor. 149 - Emily K. Lada, James R. Wilson, Natalie M. Steiger, Jeffrey A. Joines:
Performance of a Wavelet-Based Spectral Procedure for Steady-State Simulation Analysis. 150-160 - Jiaqiao Hu, Michael C. Fu, Vahid Reza Ramezani, Steven I. Marcus:
An Evolutionary Random Policy Search Algorithm for Solving Markov Decision Processes. 161-174 - Johannes O. Royset, R. Kevin Wood:
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem. 175-184 - Gediminas Adomavicius, Alexander Tuzhilin:
Validation Sequence Optimization: A Theoretical Approach. 185-200 - Armann Ingolfsson, Elvira Akhmetshina, Susan Budge, Yongyue Li, Xudong Wu:
A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary M(t)/M/s(t) Queueing Systems with Exhaustive Discipline. 201-214 - Alma Riska, Evgenia Smirni:
ETAQA Solutions for Infinite Markov Processes with Repetitive Structure. 215-228 - Giuseppe Andreello, Alberto Caprara, Matteo Fischetti:
Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. 229-238 - Panos Parpas, Berç Rustem:
Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems. 239-247 - Zhongju Zhang, Debabrata Dey, Yong Tan:
Pricing Communication Services with Delay Guarantee. 248-260 - Ramón Alvarez-Valdés, Rafael Martí, José Manuel Tamarit, Antonio Parajón:
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem. 261-272 - Gary J. Koehler:
Conditions that Obviate the No-Free-Lunch Theorems for Optimization. 273-279 - David Pisinger, Anders Bo Rasmussen, Rune Sandvik:
Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction. 280-290 - Murat Köksalan, Selcen (Pamuk) Phelps:
An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions. 291-301 - Hoi-Ming Chi, Okan K. Ersoy, Herbert Moskowitz, Kemal Altinkemer:
Toward Automated Intelligent Manufacturing Systems (AIMS). 302-312
Volume 19, Number 3, Summer 2007
- John W. Chinneck:
From the Editor. 313 - Christos Alexopoulos, Nilay Tanik Argon, David Goldsman, Natalie M. Steiger, Gamze Tokol, James R. Wilson:
Efficient Computation of Overlapping Variance Estimators for Simulation. 314-327 - Zsolt Ugray, Leon S. Lasdon, John C. Plummer, Fred W. Glover, James P. Kelly, Rafael Martí:
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization. 328-340 - Efstathios Avdis, Ward Whitt:
Power Algorithms for Inverting Laplace Transforms. 341-355 - William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). 356-365 - Gino J. Lim, Michael C. Ferris, Stephen J. Wright, David M. Shepard, Matthew A. Earl:
An Optimization Framework for Conformal Radiation Treatment Planning. 366-380 - Tito Homem-de-Mello:
A Study on the Cross-Entropy Method for Rare-Event Probability Estimation. 381-394 - David Pisinger:
Denser Packings Obtained in O(n log log n) Time. 395-405 - Jon Lee, François Margot:
On a Binary-Encoded ILP Coloring Formulation. 406-415 - Ravindra K. Ahuja, Jon Goodstein, Amit Mukherjee, James B. Orlin, Dushyant Sharma:
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. 416-428 - Sudip Bhattacharjee, Hong Zhang, Ram Ramesh, Dee H. Andrews:
A Decomposition and Guided Simulation Methodology for Large-Scale System Design: A Study in QoS-Capable Intranets with Fixed and Mobile Components. 429-442 - Andrew Lim, Xingwen Zhang:
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows. 443-457 - Mustapha Bouhtou, Stan P. M. van Hoesel, Anton F. van der Kraaij, Jean-Luc Lutton:
Tariff Optimization in Networks. 458-469 - Emilio Carrizosa, Belen Martin-Barragan, Frank Plastria, Dolores Romero Morales:
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification. 470-479 - Attahiru Sule Alfa, Jungong Xue:
Efficient Computations for the Discrete GI/G/1 System. 480-484
Volume 19, Number 4, Fall 2007
- John W. Chinneck:
From the Editor. 485 - Zhiqiang Zheng, Balaji Padmanabhan:
Constructing Ensembles from Data Envelopment Analysis. 486-496 - Rommel G. Regis, Christine A. Shoemaker:
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions. 497-509 - I. Robert Chiang, Manuel A. Nunez:
Improving Web-Catalog Design for Easy Product Search. 510-519 - Jordi Castro:
A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables. 520-533 - Edward Rothberg:
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions. 534-541 - Kevin R. Hutson, Terri L. Schlosser, Douglas R. Shier:
On the Distributed Bellman-Ford Algorithm and the Looping Problem. 542-551 - Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. 552-564 - Milind Dawande, Rakesh Gupta, Sanjeewa Naranpanawe, Chelliah Sriskandarajah:
A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks. 565-574 - Dario Landa Silva, Edmund K. Burke:
Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem. 575-587 - Kaushal Chari, Manish Agrawal:
Multi-Issue Automated Negotiations Using Agents. 588-595 - José Niño-Mora:
A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain. 596-606 - Maria Garcia de la Banda, Peter J. Stuckey:
Dynamic Programming to Minimize the Maximum Number of Open Stacks. 607-617 - Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte:
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. 618-632 - Nicholas G. Hall, Zhixin Liu, Chris N. Potts:
Rescheduling for Multiple New Orders. 633-645 - Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma:
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. 646-657
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 2025-12-12 01:08 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:
