Journals in DBLP

Computers & OR
2011, volume: 38, number: 2

1. 
   Hybridizing principles of TOPSIS with case-based reasoning for business failure prediction. [Citation Graph (, )][DBLP]
   
   
2. 
   Price strategy implementation. [Citation Graph (, )][DBLP]
   
   
3. 
   Hybrid-LP: Finding advanced starting points for simplex, and pivoting LP methods. [Citation Graph (, )][DBLP]
   
   
4. 
   MIP models for connected facility location: A theoretical and computational study. [Citation Graph (, )][DBLP]
   
   
5. 
   A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand. [Citation Graph (, )][DBLP]
   
   
6. 
   A computational study of parametric tabu search for 0-1 mixed integer programs. [Citation Graph (, )][DBLP]
   
   
7. 
   A large neighbourhood search heuristic for ship routing and scheduling with split loads. [Citation Graph (, )][DBLP]
   
   
8. 
   Team formation based on group technology: A hybrid grouping genetic algorithm approach. [Citation Graph (, )][DBLP]
   
   
9. 
   A modified super-efficiency measure based on simultaneous input-output projection in data envelopment analysis. [Citation Graph (, )][DBLP]
   
   
10. 
    Heuristic algorithms for the general nonlinear separable knapsack problem. [Citation Graph (, )][DBLP]
    
    
11. 
    Computational experience with a core-based reduction procedure for the 2-knapsack problem. [Citation Graph (, )][DBLP]
    
    
12. 
    Planning working time accounts under demand uncertainty. [Citation Graph (, )][DBLP]
    
    
13. 
    Simultaneous location of a service facility and a rapid transit line. [Citation Graph (, )][DBLP]
    
    
14. 
    A branch-and-cut algorithm for the partitioning-hub location-routing problem. [Citation Graph (, )][DBLP]
    
    
15. 
    Models for a traveling purchaser problem with additional side-constraints. [Citation Graph (, )][DBLP]
    
    
16. 
    Single-allocation ordered median hub location problems. [Citation Graph (, )][DBLP]
    
    
17. 
    An exact bit-parallel algorithm for the maximum clique problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy. [Citation Graph (, )][DBLP]