Search the dblp DataBase
Teodor Gabriel Crainic :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jawad Abrache , Teodor Gabriel Crainic , Michel Gendreau Design issues for combinatorial auctions. [Citation Graph (0, 0)][DBLP ] 4OR, 2004, v:2, n:1, pp:1-33 [Journal ] Jawad Abrache , Benoît Bourbeau , Teodor Gabriel Crainic , Michel Gendreau A new bidding framework for combinatorial e-auctions. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2004, v:31, n:8, pp:1177-1203 [Journal ] Alexandre Le Bouthillier , Teodor Gabriel Crainic A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2005, v:32, n:, pp:1685-1708 [Journal ] Teodor Gabriel Crainic , Ye Li , Michel Toulouse A first multilevel cooperative algorithm for capacitated multicommodity network design. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2006, v:33, n:, pp:2602-2622 [Journal ] Tatjana Davidovic , Teodor Gabriel Crainic Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2006, v:33, n:, pp:2155-2177 [Journal ] Bernard Gendron , Teodor Gabriel Crainic A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1997, v:24, n:9, pp:829-847 [Journal ] Christian Lardinois , Teodor Gabriel Crainic , Johanne Dion An interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1992, v:19, n:2, pp:139-149 [Journal ] Jean-François Mondou , Teodor Gabriel Crainic , Sang Nguyen Shortest path algorithms: A computational study with the C programming language. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1991, v:18, n:8, pp:767-786 [Journal ] Teodor Gabriel Crainic , Antonio Frangioni , Bernard Gendron Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:73-99 [Journal ] Alexandre Le Bouthillier , Teodor Gabriel Crainic , Peter Kropf A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows. [Citation Graph (0, 0)][DBLP ] IEEE Intelligent Systems, 2005, v:20, n:4, pp:36-42 [Journal ] Teodor Gabriel Crainic , Michel Gendreau Cooperative Parallel Tabu Search for Capacitated Network Design. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2002, v:8, n:6, pp:601-627 [Journal ] Teodor Gabriel Crainic , Bernard Gendron , Geneviève Hernu A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2004, v:10, n:5, pp:525-545 [Journal ] Teodor Gabriel Crainic , Michel Gendreau , Pierre Hansen , Nenad Mladenovic Cooperative Parallel Variable Neighborhood Search for the p -Median. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2004, v:10, n:3, pp:293-314 [Journal ] Teodor Gabriel Crainic , Michel Toulouse Introduction to the Special Issue on Parallel Meta-Heuristics. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2002, v:8, n:3, pp:247-249 [Journal ] Teodor Gabriel Crainic , Michel Gendreau , Judith M. Farvolden A Simplex-Based Tabu Search Method for Capacitated Network Design. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2000, v:12, n:3, pp:223-236 [Journal ] 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 ] Teodor Gabriel Crainic , Michel Toulouse , Michel Gendreau Toward a Taxonomy of Parallel Tabu Search Heuristics. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 1997, v:9, n:1, pp:61-72 [Journal ] Charles Hélou , Rachida Dssouli , Teodor Gabriel Crainic Performance testing of a negotiation platform. [Citation Graph (0, 0)][DBLP ] Information & Software Technology, 2002, v:44, n:5, pp:313-330 [Journal ] Benoît Bourbeau , Teodor Gabriel Crainic , Bernard Gendron Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2000, v:26, n:1, pp:27-46 [Journal ] Michel Toulouse , Teodor Gabriel Crainic , Brunilde Sansò Systemic behavior of cooperative search algorithms. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2004, v:30, n:1, pp:57-79 [Journal ] Michel Toulouse , Teodor Gabriel Crainic , Krishnaiyan Thulasiraman Global optimization properties of parallel cooperative search algorithms: A simulation study. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2000, v:26, n:1, pp:91-112 [Journal ] Leonardo Campo Dall'Orto , Teodor Gabriel Crainic , José Eugênio Leal , Warren B. Powell The single-node dynamic service scheduling and dispatching problem. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2006, v:170, n:1, pp:1-23 [Journal ] Benoît Bourbeau , Teodor Gabriel Crainic , Michel Gendreau , Jacques Robert Design for optimized multi-lateral multi-commodity markets. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:163, n:2, pp:503-529 [Journal ] Jawad Abrache , Teodor Gabriel Crainic , Michel Gendreau Models for bundle trading in financial markets. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:160, n:1, pp:88-105 [Journal ] A concurrent evolutionary approach for rich combinatorial optimization. [Citation Graph (, )][DBLP ] Multi-thread integrative cooperative optimization for rich combinatorial problems. [Citation Graph (, )][DBLP ] A Metaheuristic for a Two Echelon Location-Routing Problem. [Citation Graph (, )][DBLP ] Explicit and Emergent Cooperation Schemes for Search Algorithms. [Citation Graph (, )][DBLP ] New bin packing fast lower bounds. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.005secs