default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 17
Volume 17, Number 1, 2005
- From the Editor. 1
- Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005. 2
- Eric L. Savage, Lee Schruben, Enver Yücesan:
On the Generality of Event-Graph Models. 3-9 - Teodor Gabriel Crainic
, Federico Malucelli, Maddalena Nonato, François Guertin:
Meta-Heuristics for a Class of Demand-Responsive Transit Systems. 10-24 - W. Nick Street:
Oblique Multicategory Decision Trees Using Nonlinear Programming. 25-31 - Siwate Rojanasoonthon, Jonathan F. Bard:
A GRASP for Parallel Machine Scheduling with Time Windows. 32-51 - Sophie Demassey, Christian Artigues, Philippe Michelon:
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. 52-65 - Michael Tortorella:
Numerical Solutions of Renewal-Type Integral Equations. 66-74 - Dae W. Choi, Nam K. Kim, Kyung C. Chae:
A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity. 75-81 - Paola Cappanera, Marco Trubian:
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem. 82-98 - Yong Tan, Kamran Moinzadeh, Vijay S. Mookerjee:
Optimal Processing Policies for an e-Commerce Web Server. 99-110 - Vicente Campos, Manuel Laguna, Rafael Martí:
Context-Independent Scatter and Tabu Search for Permutation Problems. 111-122 - Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. 123-136
Volume 17, Number 2, 2005
- From the Editor. 137
- Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005. 138
- Robert Fourer, Leo Lopes, R. Kipp Martin:
LPFML: A W3C XML Schema for Linear and Integer Programming. 139-158 - Vardges Melkonian, Éva Tardos:
Primal-Dual-Based Algorithms for a Directed Network Design Problem. 159-174 - José M. Valério de Carvalho:
Using Extra Dual Cuts to Accelerate Column Generation. 175-182 - Pasquale Avella, Maurizio Boccia, Bernardo D'Auria:
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. 183-191 - Michel Denault, Jean-Louis Goffin:
The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach. 192-206 - Eduardo Camponogara, Sarosh Talukdar:
Designing Communication Networks to Decompose Network Control Problems. 207-223 - Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo:
GRASP with Path Relinking for Three-Index Assignment. 224-247 - Neil J. Keon, G. Anandalingam:
A New Pricing Model for Competitive Telecommunications Services Using Congestion Discounts. 248-262
Volume 17, Number 3, 2005
- Jack P. C. Kleijnen, Susan M. Sanchez, Thomas W. Lucas, Thomas M. Cioppa:
State-of-the-Art Review: A User's Guide to the Brave New World of Designing Simulation Experiments. 263-289 - Bruce L. Golden, S. Raghavan, Daliborka Stanojevic:
Heuristic Search for the Generalized Minimum Spanning Tree Problem. 290-304 - Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra:
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. 305-320 - J. Cole Smith, Sheldon H. Jacobson:
An Analysis of the Alias Method for Discrete Random-Variate Generation. 321-327 - Lorenzo Brunetta, Philippe Grégoire:
A General Purpose Algorithm for Three-Dimensional Packing. 328-338 - Sigurdur Ólafsson, Jaekyung Yang:
Intelligent Partitioning for Feature Selection. 339-355 - Alberto Caprara, Juan José Salazar González:
Laying Out Sparse Graphs with Provably Minimum Bandwidth. 356-373 - Daniel Dajun Zeng, J. Leon Zhao:
Effective Role Resolution in Workflow Management. 374-387
Volume 17, Number 4, October 2005
- Laurent Michel, Pascal Van Hentenryck:
A Modeling Layer for Constraint-Programming Libraries. 389-401 - Illya V. Hicks:
Planar Branch Decompositions I: The Ratcatcher. 402-412 - Illya V. Hicks:
Planar Branch Decompositions II: The Cycle Method. 413-421 - Minghe Sun:
Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming. 422-437 - Diane E. Vaughan, Sheldon H. Jacobson, Shane N. Hall, Laura A. McLay:
Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems. 438-450 - Igor Averbakh:
The Minmax Relative Regret Median Problem on Networks. 451-461 - Ramaswamy Chandrasekaran, Young U. Ryu, Varghese S. Jacob, Sungchul Hong:
Isotonic Separation. 462-474 - Joni L. Jones, Gary J. Koehler:
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions. 475-489
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-05-05 00: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:
