Crainic Teodor Gabriel

Teodor Gabriel Crainic

Information about the author Teodor Gabriel Crainic will soon be added to the site.
Found 53 papers in total
Design for optimized multi-lateral multi-commodity markets
Design for optimized multi-lateral multi-commodity markets
2005
In this paper, we propose a design for an economically efficient, optimized,...
Models for bundle trading in financial markets
Models for bundle trading in financial markets
2005
Bundle trading is a new trend in financial markets that allows traders to submit...
Economies of scale in empty freight car distribution in scheduled railways
Economies of scale in empty freight car distribution in scheduled railways
2004
In this paper, we consider empty freight car distribution in a scheduled railway...
Design issues for combinatorial auctions
Design issues for combinatorial auctions
2004
Combinatorial auctions are an important class of market mechanisms in which...
Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
2004
In this paper, we propose a path relinking procedure for the fixed-charge capacitated...
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
2004
This paper describes a slope scaling heuristic for solving the multicommodity...
A new bidding framework for combinatorial e-auctions
A new bidding framework for combinatorial e-auctions
2004
Bidding languages define the means through which participants in an electronic auction...
Cooperative parallel variable neighborhood search for the p-median
Cooperative parallel variable neighborhood search for the p-median
2004
We propose a cooperative multi-search method for the Variable Neighborhood Search...
Cooperative parallel tabu search for capacitated network design
Cooperative parallel tabu search for capacitated network design
2002
We present a cooperative parallel tabu search method for the fixed charge,...
Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design
Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design
2003
We propose new cycle-based neighbourhood structures for metaheuristics aimed at the...
A simplex-based tabu search method for capacitated network design
A simplex-based tabu search method for capacitated network design
2000
The fixed charge capacitated multicommodity network design problem is a well-known...
Service network design in freight transportation
Service network design in freight transportation
2000
Tactical planning of operations is comprised of a set of interrelated decisions that...
Planning models for freight transportation
Planning models for freight transportation
1997
The objective of this paper is to identify some of the main issues in freight...
Toward a taxonomy of parallel tabu search heuristics
Toward a taxonomy of parallel tabu search heuristics
1997
In this paper we present a classification of parallel tabu search metaheuristics...
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
1997
This article presents a parallel branch-and-bound algorithm for solving the...
Toward a taxonomy of parallel tabu search heuristics
Toward a taxonomy of parallel tabu search heuristics
1997
In this paper the authors present a classification of parallel tabu search...
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
1996
The authors study and compare asynchronous parallelization strategies for tabu search,...
A branch-and-bound method for multicommodity location with balancing requirements
A branch-and-bound method for multicommodity location with balancing requirements
1993
The authors present a branch-and-bound algorithm for the multicommodity...
Parallel branch-and-bound algorithms: Survey and synthesis
Parallel branch-and-bound algorithms: Survey and synthesis
1994
The authors present a detailed and up-to-date survey of the literature on parallel...
A branch-and-bound algorithm for depot location and container fleet management
A branch-and-bound algorithm for depot location and container fleet management
1995
The multicommodity location problem with balancing requirements is related to one of...
Dynamic and stochastic models for the allocation of empty containers
Dynamic and stochastic models for the allocation of empty containers
1993
The empty container allocation problem occurs in the context of the management of the...
Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements
Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements
1993
The authors present two parallel branch-and-bound algorithms for the multicommodity...
Interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations
Interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations
1992
The planning and management of the services offered by any intercity passenger...
A set covering approach for routing and crew scheduling of LTL motor carrier transportation
A set covering approach for routing and crew scheduling of LTL motor carrier transportation
1990
The load plan of a LTL motor carrier determines the services it operates and the...
Papers per page: