The SCEAS System
Navigation Menu

Journals in DBLP

Computers & OR
2006, volume: 33, number: 10

  1. Michel Gendreau, Gilles Pesant, Louis-Martin Rousseau
    Focused issue of C & OR on constraint programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2775-2776 [Journal]
  2. Alexander Bockmayr, Nicolai Pisaruk
    Detecting infeasibility and generating cuts for mixed integer programming using constraint programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2777-2786 [Journal]
  3. Willem Jan van Hoeve
    Exploiting semidefinite relaxations in constraint programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2787-2804 [Journal]
  4. Simon de Givry, Laurent Jeannin
    A unified framework for partial and hybrid search methods in constraint programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2805-2833 [Journal]
  5. Nicolas Beldiceanu, Mats Carlsson, Sven Thiel
    Sweep synchronization as a global propagation mechanism. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2835-2851 [Journal]
  6. François Fages, Akash Lal
    A constraint programming approach to cutset problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2852-2865 [Journal]
  7. Stefan Bertels, Torsten Fahle
    A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2866-2890 [Journal]
  8. Samir Loudni, Patrice Boizumault, Philippe David
    On-line resources allocation for ATM networks with rerouting. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2891-2917 [Journal]
  9. Mattias Grönkvist
    Accelerating column generation for aircraft scheduling using constraint propagation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2918-2934 [Journal]
  10. Christopher Jefferson, Angela Miguel, Ian Miguel, Armagan Tarim
    Modelling and solving English Peg Solitaire. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2935-2959 [Journal]
  11. Ling Wang, Liang Zhang, Da-Zhong Zheng
    An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2960-2971 [Journal]
  12. Alain Chabrier
    Vehicle Routing Problem with elementary shortest path based column generation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2972-2990 [Journal]
  13. Isabel Correia, M. Eugénia V. Captivo
    Bounds for the single source modular capacitated plant location problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2991-3003 [Journal]
  14. Sebastián Lozano, Gabriel Villa
    Data envelopment analysis of integer-valued inputs and outputs. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3004-3014 [Journal]
  15. Moshe Kaspi, Dvir Shabtay
    A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3015-3033 [Journal]
  16. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search and local branching. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3034-3045 [Journal]
  17. Elías F. Combarro, Pedro Miranda
    Identification of fuzzy measures from sample data with genetic algorithms. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3046-3066 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002