Marco Antonio Boschetti

Affiliations:
  • University of Bologna, Italy


According to our database1, Marco Antonio Boschetti authored at least 28 papers between 1996 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Last-mile delivery with drone and lockers.
Networks, March, 2024

2023
Matheuristics: survey and synthesis.
Int. Trans. Oper. Res., November, 2023

Graph-Enhanced Biomedical Abstractive Summarization Via Factual Evidence Extraction.
SN Comput. Sci., September, 2023

2022
Matheuristics: using mathematics for heuristic design.
4OR, 2022

Self-adaptive Publish/Subscribe Network Design.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2019
Client-side Computational Optimization.
ACM Trans. Math. Softw., 2019

Membership overlay design optimization with resource constraints (accelerated on GPU).
J. Parallel Distributed Comput., 2019

2017
Route relaxations on GPU for vehicle routing problems.
Eur. J. Oper. Res., 2017

2016
Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem.
INFORMS J. Comput., 2016

2015
A set covering based matheuristic for a real-world city logistics problem.
Int. Trans. Oper. Res., 2015

2014
Algorithms for nesting with defects.
Discret. Appl. Math., 2014

A Lagrangian heuristic for sprint planning in agile software development.
Comput. Oper. Res., 2014

2011
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem.
INFORMS J. Comput., 2011

2010
Decomposition Techniques as Metaheuristic Frameworks.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

An Exact Algorithm for the Two-Dimensional Strip-Packing Problem.
Oper. Res., 2010

Soft Variable Fixing in Path Relinking: An Application to ACO Codes.
Proceedings of the Swarm Intelligence - 7th International Conference, 2010

2009
Benders decomposition, Lagrangean relaxation and metaheuristic design.
J. Heuristics, 2009

Exact methods for large-scale multi-period financial planning problems.
Comput. Manag. Sci., 2009

Matheuristics: Optimization, Simulation and Control.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008
A dual ascent procedure for the set partitioning problem.
Discret. Optim., 2008

2007
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem.
Eur. J. Oper. Res., 2007

2004
New lower bounds for the three-dimensional finite bin packing problem.
Discret. Appl. Math., 2004

An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem.
Ann. Oper. Res., 2004

An Ant Approach to Membership Overlay Design.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

2003
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.
4OR, 2003

The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.
4OR, 2003

1999
A Set Partitioning Approach to the Crew Scheduling Problem.
Oper. Res., 1999

1996
A Comparison of Three Basic Conjugate Direction Methods.
Numer. Linear Algebra Appl., 1996


  Loading...