Journals in DBLP

INFORMS Journal on Computing
2005, volume: 17, number: 1

1. 
   From the Editor. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:1- [Journal]
   
2. 
   Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:2- [Journal]
   
3. Eric L. Savage, Lee Schruben, Enver Yücesan
   On the Generality of Event-Graph Models. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:3-9 [Journal]
   
4. Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato, François Guertin
   Meta-Heuristics for a Class of Demand-Responsive Transit Systems. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:10-24 [Journal]
   
5. W. Nick Street
   Oblique Multicategory Decision Trees Using Nonlinear Programming. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:25-31 [Journal]
   
6. Siwate Rojanasoonthon, Jonathan Bard
   A GRASP for Parallel Machine Scheduling with Time Windows. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:32-51 [Journal]
   
7. Sophie Demassey, Christian Artigues, Philippe Michelon
   Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:52-65 [Journal]
   
8. Michael Tortorella
   Numerical Solutions of Renewal-Type Integral Equations. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:66-74 [Journal]
   
9. Dae W. Choi, Nam K. Kim, Kyung C. Chae
   A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2005, v:17, n:1, pp:75-81 [Journal]
   
10. Paola Cappanera, Marco Trubian
    A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:1, pp:82-98 [Journal]
    
11. Yong Tan, Kamran Moinzadeh, Vijay S. Mookerjee
    Optimal Processing Policies for an e-Commerce Web Server. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:1, pp:99-110 [Journal]
    
12. Vicente Campos, Manuel Laguna, Rafael Martí
    Context-Independent Scatter and Tabu Search for Permutation Problems. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:1, pp:111-122 [Journal]
    
13. Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
    An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:1, pp:123-136 [Journal]