M. Teresa Ortuño
Orcid: 0000-0002-5568-9496Affiliations:
- Complutense University of Madrid, Department of Statistics and Operations Research
According to our database1,
M. Teresa Ortuño
authored at least 23 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on mat.ucm.es
On csauthors.net:
Bibliography
2024
Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts.
Eur. J. Oper. Res., February, 2024
2021
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies.
Oper. Res. Forum, 2021
2020
Central Eur. J. Oper. Res., 2020
Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid.
Central Eur. J. Oper. Res., 2020
2018
Multi-criteria optimization for last mile distribution of disaster relief aid: Test cases and applications.
Eur. J. Oper. Res., 2018
2016
2015
Proceedings of the Applications of Evolutionary Computation - 18th European Conference, 2015
2014
Int. J. Comput. Intell. Syst., 2014
A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian Logistics.
Comput. Oper. Res., 2014
2013
Exact and heuristic algorithms for the green vehicle routing problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints.
4OR, 2012
2011
J. Glob. Optim., 2011
Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints.
Eur. J. Oper. Res., 2011
Ann. Oper. Res., 2011
2009
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach.
Comput. Oper. Res., 2009
2007
2005
Proceedings of the Applications of Stochastic Programming, 2005
2003
An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming.
J. Glob. Optim., 2003
Eur. J. Oper. Res., 2003
BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs.
Eur. J. Oper. Res., 2003
On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates.
Ann. Oper. Res., 2003
2000
Eur. J. Oper. Res., 2000
1997
Eur. J. Oper. Res., 1997