Herminia I. Calvete

According to our database1, Herminia I. Calvete authored at least 34 papers between 1995 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences.
Comput. Oper. Res., 2020

The rank pricing problem: Models and branch-and-cut algorithms.
Comput. Oper. Res., 2019

Dealing with residual energy when transmitting data in energy-constrained capacitated networks.
Eur. J. Oper. Res., 2018

A matheuristic for the two-stage fixed-charge transportation problem.
Comput. Oper. Res., 2018

The energy-constrained quickest path problem.
Optim. Lett., 2017

An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots.
OR Spectr., 2016

MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem.
Eur. J. Oper. Res., 2016

Integrated Supply Chain Planning: A Review.
Proceedings of the Modeling and Simulation in Engineering, Economics and Management, 2016

Corrigendum to "An efficient evolutionary algorithm for the ring star problem" [Calvete et al. European J. of Operational Research, 231 (2013), 22-33].
Eur. J. Oper. Res., 2015

An efficient evolutionary algorithm for the ring star problem.
Eur. J. Oper. Res., 2013

A Hybrid Algorithm for Solving a Bilevel Production-Distribution Planning Problem.
Proceedings of the Modeling and Simulation in Engineering, Economics, and Management, 2013

An Evolutionary Algorithm for the Biobjective Capacitated m-Ring Star Problem.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Bilevel problems over polyhedra with extreme point optimal solutions.
J. Glob. Optim., 2012

Linear bilevel programming with interval coefficients.
J. Comput. Appl. Math., 2012

Algorithms for the quickest path problem and the reliable quickest path problem.
Comput. Manag. Sci., 2012

Ant Colony Optimization for Solving the Vehicle Routing Problem with Delivery Preferences.
Proceedings of the Modeling and Simulation in Engineering, Economics and Management, 2012

Bilevel model for production-distribution planning solved by using ant colony optimization.
Comput. Oper. Res., 2011

Evolutive and ACO Strategies for Solving the Multi-depot Vehicle Routing Problem.
Proceedings of the ECTA and FCTA 2011, 2011

Linear bilevel programs with multiple objectives at the upper level.
J. Comput. Appl. Math., 2010

Bilevel Fractional Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A genetic algorithm for solving linear fractional bilevel problems.
Ann. Oper. Res., 2009

A new approach for solving linear bilevel problems using genetic algorithms.
Eur. J. Oper. Res., 2008

A Multiobjective Bilevel Program for Production-Distribution Planning in a Supply Chain.
Proceedings of the Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, 2008

Linear bilevel multi-follower programming with independent followers.
J. Glob. Optim., 2007

A goal programming approach to vehicle routing problems with soft time windows.
Eur. J. Oper. Res., 2007

Solving linear fractional bilevel programs.
Oper. Res. Lett., 2004

A note on 'bilevel linear fractional programming problem'.
Eur. J. Oper. Res., 2004

The quickest path problem with interval lead times.
Comput. Oper. Res., 2004

A penalty Method for Solving bilevel Linear fractional/Linear Programming Problems.
Asia Pac. J. Oper. Res., 2004

The quickest path problem with batch constraints.
Oper. Res. Lett., 2003

Network simplex algorithm for the general equal flow problem.
Eur. J. Oper. Res., 2003

The bilevel linear/linear fractional programming problem.
Eur. J. Oper. Res., 1999

Lexicographic optimisation in generalised network flow problems.
J. Oper. Res. Soc., 1998

An approach for the network flow problem with multiple objectives.
Comput. Oper. Res., 1995