Journals in DBLP

Computers & OR
2009, volume: 36, number: 7

1. 
   A simulated annealing algorithm for single machine scheduling problems with family setups. [Citation Graph (, )][DBLP]
   
   
2. 
   Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. [Citation Graph (, )][DBLP]
   
   
3. 
   Computing minimal doubly resolving sets of graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows. [Citation Graph (, )][DBLP]
   
   
5. 
   Planning production using mathematical programming: The case of a woodturning company. [Citation Graph (, )][DBLP]
   
   
6. 
   A hierarchical approach for planning a multisensor multizone search for a moving target. [Citation Graph (, )][DBLP]
   
   
7. 
   Detecting critical nodes in sparse graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure. [Citation Graph (, )][DBLP]
   
   
9. 
   On the performance of the LP-guided Hopfield network-genetic algorithm. [Citation Graph (, )][DBLP]
   
   
10. 
    Extended ant colony optimization for non-convex mixed integer nonlinear programming. [Citation Graph (, )][DBLP]
    
    
11. 
    Uncapacitated single and multiple allocation p-hub center problems. [Citation Graph (, )][DBLP]
    
    
12. 
    A new model for the preemptive earliness-tardiness scheduling problem. [Citation Graph (, )][DBLP]
    
    
13. 
    Convex ordered median problem with l_p-norms. [Citation Graph (, )][DBLP]
    
    
14. 
    The traveling purchaser problem with budget constraint. [Citation Graph (, )][DBLP]
    
    
15. 
    Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels. [Citation Graph (, )][DBLP]
    
    
16. 
    Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts. [Citation Graph (, )][DBLP]
    
    
17. 
    A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. [Citation Graph (, )][DBLP]
    
    
18. 
    Production scheduling and vehicle routing with time windows for perishable food products. [Citation Graph (, )][DBLP]
    
    
19. 
    Exploiting sparsity in pricing routines for the capacitated arc routing problem. [Citation Graph (, )][DBLP]