Giovanni Righini
Orcid: 0000-0001-9830-7454
According to our database1,
Giovanni Righini
authored at least 55 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.
J. Sched., August, 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs.
J. Sched., June, 2023
2022
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022
2021
Transp. Sci., 2021
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies.
Oper. Res. Forum, 2021
2020
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020
2018
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization.
INFORMS J. Comput., 2018
2016
Electron. Notes Discret. Math., 2016
EURO J. Transp. Logist., 2016
2014
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm.
Networks, 2014
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows.
Math. Program. Comput., 2014
EURO J. Comput. Optim., 2014
Discret. Appl. Math., 2014
Mathematical Programming bounds for Large-Scale Unit Commitment Problems in Medium-Term Energy System Simulations.
Proceedings of the 4th Student Conference on Operational Research, 2014
Optimization of Shifts and On-Call Coverage of Cardiologists Working in a Hospital Complex Structure by using Free Software.
Proceedings of the Computing in Cardiology, CinC 2014, 2014
2013
Optim. Lett., 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
J. Comput. Biol., 2012
2011
An Automatic Planning and Scheduling System for the Mars Express Uplink Scheduling Problem.
IEEE Trans. Syst. Man Cybern. Part C, 2011
A column generation algorithm for the vehicle routing problem with soft time windows.
4OR, 2011
2010
IEEE Trans. Syst. Man Cybern. Part C, 2010
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint.
Ann. Oper. Res., 2010
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times.
Math. Methods Oper. Res., 2009
Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming.
Comput. Oper. Res., 2009
A computational evaluation of a general branch-and-price framework for capacitated network location problems.
Ann. Oper. Res., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
New dynamic programming algorithms for the resource constrained elementary shortest path problem.
Networks, 2008
Oper. Res., 2008
Eur. J. Oper. Res., 2008
Comput. Oper. Res., 2008
4OR, 2008
2007
Computational approaches to a combinatorial optimization problem arising from text classification.
Comput. Oper. Res., 2007
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery.
Comput. Oper. Res., 2007
2006
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection.
Transp. Sci., 2006
Oper. Res., 2006
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times.
Electron. Notes Discret. Math., 2006
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints.
Discret. Optim., 2006
2005
Networks, 2005
2004
Eur. J. Oper. Res., 2004
Dynamic programming algorithms for the elementary shortest path problem with resource constraints.
Electron. Notes Discret. Math., 2004
2003
Electron. Notes Discret. Math., 2003
1999
Discret. Appl. Math., 1999
Proceedings of the Computational Intelligence, 1999
1997
Comput. Optim. Appl., 1997