Antonio Alonso-Ayuso
Orcid: 0000-0002-6130-3596
According to our database1,
Antonio Alonso-Ayuso
authored at least 48 papers
between 2000 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 d-nb.info
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., February, 2024
A 2-dimensional guillotine cutting stock problem with variable-sized stock for the honeycomb cardboard industry.
Int. J. Prod. Res., January, 2024
Mathematical optimisation in the honeycomb cardboard industry: A model for the two-dimensional variable-sized cutting stock problem.
Eur. J. Oper. Res., 2024
On solving the 1.5-dimensional cutting stock problem with heterogeneous slitting lines allocation in the steel industry.
Comput. Ind. Eng., 2024
2023
Discret. Appl. Math., August, 2023
The potential of large language models for improving probability learning: A study on ChatGPT3.5 and first-year computer engineering students.
CoRR, 2023
2021
Expert Syst. Appl., 2021
Eur. J. Oper. Res., 2021
Comput. Ind. Eng., 2021
2020
Prog. Artif. Intell., 2020
GRASP with Variable NCaminoseighborhood Descent for the online order batching problem.
J. Glob. Optim., 2020
On dealing with strategic and tactical decision levels in forestry planning under uncertainty.
Comput. Oper. Res., 2020
2019
Comput. Oper. Res., 2019
Comput. Electron. Agric., 2019
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019
2018
Eur. J. Oper. Res., 2018
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
2017
On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework.
Electron. Notes Discret. Math., 2017
Comput. Oper. Res., 2017
Special issue on the 13th international conference on computational management science.
Comput. Manag. Sci., 2017
2016
Exact and Approximate Solving of the Aircraft Collision Resolution Problem via Turn Changes.
Transp. Sci., 2016
Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach.
Eur. J. Oper. Res., 2016
2015
A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes.
J. Glob. Optim., 2015
Electron. Notes Discret. Math., 2015
2014
Medium range optimization of copper extraction planning under uncertainty in future copper prices.
Eur. J. Oper. Res., 2014
On modeling the air traffic control coordination in the collision avoidance problem by mixed integer linear optimization.
Ann. Oper. Res., 2014
2013
Addendum to the paper entitled "A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon".
Comput. Oper. Res., 2013
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty.
Comput. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
Eur. J. Oper. Res., 2012
VNS based algorithm for solving a 0-1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management.
Electron. Notes Discret. Math., 2012
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty.
Comput. Oper. Res., 2012
A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon.
Comput. Oper. Res., 2012
Comput. Optim. Appl., 2012
2011
Collision Avoidance in Air Traffic Management: A Mixed-Integer Linear Optimization Approach.
IEEE Trans. Intell. Transp. Syst., 2011
2010
Stud. Inform. Univ., 2010
2009
Asia Pac. J. Oper. Res., 2009
On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty.
Ann. Oper. Res., 2009
2007
2006
Comput. Manag. Sci., 2006
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