Teodor Gabriel Crainic
Orcid: 0000-0002-4424-0984
According to our database1,
Teodor Gabriel Crainic
authored at least 163 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach.
Eur. J. Oper. Res., April, 2024
Eur. J. Oper. Res., April, 2024
An asynchronous parallel benders decomposition method for stochastic network design problems.
Comput. Oper. Res., February, 2024
2023
An integrated learning and progressive hedging matheuristic for stochastic network design problem.
J. Heuristics, December, 2023
Multi-period location routing: An application to the planning of mobile clinic operations in Iraq.
Comput. Oper. Res., November, 2023
The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules.
Comput. Oper. Res., October, 2023
2022
INFOR Inf. Syst. Oper. Res., 2022
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications.
Eur. J. Oper. Res., 2022
Scheduled service network design with revenue management considerations and an intermodal barge transportation illustration.
Eur. J. Oper. Res., 2022
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design.
Discret. Appl. Math., 2022
2021
The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case.
Transp. Sci., 2021
Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design.
Transp. Sci., 2021
J. Oper. Res. Soc., 2021
Editorial to the Special Issue on Transportation and Logistics with Autonomous Technologies.
Int. Trans. Oper. Res., 2021
INFORMS J. Comput., 2021
A reduced cost-based restriction and refinement matheuristic for stochastic network design problem.
J. Heuristics, 2021
Eur. J. Oper. Res., 2021
Scheduled service network design with resource management for two-tier multimodal city logistics.
Eur. J. Oper. Res., 2021
Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and 'grey zone' customers arising in urban logistics.
Eur. J. Oper. Res., 2021
A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach.
Comput. Oper. Res., 2021
Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning.
Comput. Oper. Res., 2021
2020
Transp. Sci., 2020
Transp. Sci., 2020
Population-based risk equilibration for the multimode hazmat transport network design problem.
Eur. J. Oper. Res., 2020
2019
Branch-and-Price-Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci., 2019
Int. Trans. Oper. Res., 2019
Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions.
INFORMS J. Comput., 2019
A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities.
Eur. J. Oper. Res., 2019
2018
Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems.
SIAM J. Optim., 2018
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
Special issue on: "Models and methods for the supply chain and logistics management".
EURO J. Transp. Logist., 2018
EURO J. Transp. Logist., 2018
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
EURO J. Comput. Optim., 2018
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018
Proceedings of the Computational Logistics - 9th International Conference, 2018
2017
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems.
Transp. Sci., 2017
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design.
Transp. Sci., 2017
Ann. Oper. Res., 2017
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017
2016
Transp. Sci., 2016
<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part II.
Transp. Sci., 2016
<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part I.
Transp. Sci., 2016
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.
Eur. J. Oper. Res., 2016
Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic.
Eur. J. Oper. Res., 2016
A Revenue Management Approach for Network Capacity Allocation of an Intermodal Barge Transportation System.
Proceedings of the Computational Logistics - 7th International Conference, 2016
Proceedings of the Computational Logistics - 7th International Conference, 2016
2015
Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements.
Transp. Sci., 2015
Parallel Comput., 2015
Networks, 2015
INFOR Inf. Syst. Oper. Res., 2015
Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing.
J. Heuristics, 2015
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP.
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 2015
Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm.
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows.
J. Heuristics, 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Comput. Oper. Res., 2014
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design.
Comput. Oper. Res., 2014
Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items.
Ann. Oper. Res., 2014
2013
A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods.
INFOR Inf. Syst. Oper. Res., 2013
A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints.
J. Heuristics, 2013
J. Heuristics, 2013
Eur. J. Oper. Res., 2013
A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows.
Eur. J. Oper. Res., 2013
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows.
Comput. Oper. Res., 2013
2012
Oper. Res., 2012
Eur. J. Oper. Res., 2012
A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems.
Eur. J. Oper. Res., 2012
Electron. Notes Discret. Math., 2012
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Ann. Oper. Res., 2012
2011
Transp. Sci., 2011
Networks, 2011
Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks.
INFOR Inf. Syst. Oper. Res., 2011
Efficient lower bounds and heuristics for the variable cost and size bin packing problem.
Comput. Oper. Res., 2011
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011
2010
Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules.
Stud. Inform. Univ., 2010
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.
Networks, 2010
Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design.
J. Oper. Res. Soc., 2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements.
Transp. Sci., 2009
TS<sup>2</sup>PACK: A two-level tabu search for the three-dimensional bin packing problem.
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
2008
INFORMS J. Comput., 2008
A multilevel tabu search algorithm for the feature selection problem in biomedical data.
Comput. Math. Appl., 2008
2007
Eur. J. Oper. Res., 2007
Correlations in Stochastic Programming: a Case from Stochastic Service Network Design.
Asia Pac. J. Oper. Res., 2007
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007
Proceedings of the Metaheuristics, 2007
2006
Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics.
IEEE Wirel. Commun., 2006
Eur. J. Oper. Res., 2006
Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems.
Comput. Oper. Res., 2006
A first multilevel cooperative algorithm for capacitated multicommodity network design.
Comput. Oper. Res., 2006
2005
INFORMS J. Comput., 2005
IEEE Intell. Syst., 2005
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows.
Comput. Oper. Res., 2005
2004
Transp. Sci., 2004
On the design of fault-tolerant logical topologies in wavelength-routed packet networks.
IEEE J. Sel. Areas Commun., 2004
J. Heuristics, 2004
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.
J. Heuristics, 2004
Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design.
Ann. Oper. Res., 2004
2003
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design.
Oper. Res., 2003
Proceedings of the American Control Conference, 2003
Proceedings of the Handbook of Metaheuristics, 2003
2002
2001
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discret. Appl. Math., 2001
Design of fault-tolerant logical topologies in wavelength-routed optical IP networks.
Proceedings of the Global Telecommunications Conference, 2001
2000
Global optimization properties of parallel cooperative search algorithms: A simulation study.
Parallel Comput., 2000
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Parallel Comput., 2000
INFORMS J. Comput., 2000
1998
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998
1997
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Comput. Oper. Res., 1997
1996
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements.
Ann. Oper. Res., 1996
1994
1993
Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements.
Transp. Sci., 1993
Oper. Res., 1993
A tabu search procedure for multicommodity location/allocation with balancing requirements.
Ann. Oper. Res., 1993
1992
Transp. Sci., 1992
An interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations.
Comput. Oper. Res., 1992
1991
Comput. Oper. Res., 1991
1990
A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows.
Transp. Sci., 1990
Transp. Sci., 1990
1987
Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation.
Transp. Sci., 1987
1984