Roberto Montemanni

From MaRDI portal
(Redirected from Person:336341)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A compact model for the home healthcare routing and scheduling problem
EURO Journal on Computational Optimization
2025-12-19Paper
An exact algorithm for the hazardous orienteering problem
Networks
2025-09-01Paper
Model-based algorithms for the 0-1 time-bomb knapsack problem
Computers & Operations Research
2025-06-05Paper
A model-based algorithm for the probabilistic orienteering problem
Computers & Operations Research
2025-06-05Paper
Machine learning constructives and local searches for the travelling salesman problem2024-09-17Paper
The picking and packing problem in buy-online-pick-up-in-store retailing2024-09-17Paper
The missing Moore graph as an optimization problem
EURO Journal on Computational Optimization
2024-04-24Paper
Maximum independent sets and supervised learning
Journal of the Operations Research Society of China
2024-02-09Paper
Modeling the flying sidekick traveling salesman problem with multiple drones
Networks
2023-12-11Paper
Exact models for the flying sidekick traveling salesman problem
International Transactions in Operational Research
2023-11-27Paper
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization
2023-07-12Paper
Parallel drone scheduling vehicle routing problems with collective drones2023-07-07Paper
Constraint Programming models for the parallel drone scheduling vehicle routing problem2023-07-06Paper
Precedence-constrained arborescences
European Journal of Operational Research
2023-07-04Paper
A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
Computers & Operations Research
2023-07-04Paper
An Ant Colony System for the Team Orienteering Problem with Time Windows2023-05-12Paper
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Annals of Operations Research
2022-07-26Paper
The maximum clique problem for permutation Hamming graphs
Journal of Optimization Theory and Applications
2022-07-18Paper
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
Optimization Letters
2021-07-08Paper
A tabu search algorithm for the probabilistic orienteering problem
Computers & Operations Research
2021-05-21Paper
Models and algorithms for the Flying Sidekick Traveling Salesman Problem2019-10-04Paper
A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
Computers & Operations Research
2018-07-12Paper
A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
Operations Research Proceedings
2017-12-01Paper
Heuristic Algorithms for Constructing Binary Constant Weight Codes
IEEE Transactions on Information Theory
2017-08-08Paper
A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks2017-08-04Paper
Mathematical programming models for home healthcare service optimisation
International Journal of Operational Research
2017-05-31Paper
scientific article; zbMATH DE number 6676558 (Why is no real title available?)2017-01-20Paper
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
Computers & Operations Research
2016-11-10Paper
Sampling-based objective function evaluation techniques for the orienteering problem with stochastic travel and service times
Operations Research Proceedings
2016-05-19Paper
scientific article; zbMATH DE number 6545534 (Why is no real title available?)2016-02-25Paper
An enhanced Ant Colony System for the Sequential Ordering Problem
Operations Research Proceedings
2015-03-03Paper
Wireless multicasting under probabilistic node failures: a heuristic approach
Optimization and Engineering
2014-08-20Paper
Permutation codes with specified packing radius
Designs, Codes and Cryptography
2013-07-26Paper
Some constant weight codes from primitive permutation groups
The Electronic Journal of Combinatorics
2013-06-07Paper
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Mathematical Methods of Operations Research
2013-02-20Paper
Coupling ant colony systems with strong local searches
European Journal of Operational Research
2012-12-29Paper
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
Lecture Notes in Computer Science
2012-11-02Paper
Some valid inequalities for the probabilistic minimum power multicasting problem
Electronic Notes in Discrete Mathematics
2012-05-13Paper
A new table of permutation codes
Designs, Codes and Cryptography
2012-03-23Paper
A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks
JMMA. Journal of Mathematical Modelling and Algorithms
2012-02-21Paper
Minimum power multicasting in wireless networks under probabilistic node failures
Computational Optimization and Applications
2011-06-03Paper
Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
Discrete Mathematics
2011-05-31Paper
A hybrid particle swarm optimization approach for the sequential ordering problem
Computers & Operations Research
2011-01-31Paper
Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
JMMA. Journal of Mathematical Modelling and Algorithms
2009-11-25Paper
Heuristic manipulation, tabu search and frequency assignment
Computers & Operations Research
2009-11-17Paper
A heuristic manipulation technique for the sequential ordering problem
Computers & Operations Research
2008-05-23Paper
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
European Journal of Operational Research
2008-05-08Paper
Time dependent vehicle routing problem with a multi ant colony system
European Journal of Operational Research
2007-12-10Paper
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
JMMA. Journal of Mathematical Modelling and Algorithms
2007-08-27Paper
The robust shortest path problem with interval data via Benders decomposition
4OR
2006-10-11Paper
A Benders decomposition approach for the robust spanning tree problem with interval data
European Journal of Operational Research
2006-09-14Paper
Ant colony system for a dynamic vehicle routing problem
Journal of Combinatorial Optimization
2006-01-13Paper
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
Computers & Operations Research
2005-06-27Paper
A branch and bound algorithm for the robust spanning tree problem with interval data
European Journal of Operational Research
2005-02-09Paper
An exact algorithm for the robust shortest path problem with interval data
Computers & Operations Research
2004-11-12Paper
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
European Journal of Operational Research
2004-08-19Paper
A branch and bound algorithm for the robust shortest path problem with interval data.
Operations Research Letters
2004-03-15Paper
Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
4OR
2003-01-01Paper
Lower bounds for fixed spectrum frequency assignment
Annals of Operations Research
2002-06-09Paper


Research outcomes over time


This page was built for person: Roberto Montemanni