Giovanni Righini

Orcid: 0000-0001-9830-7454

According to our database1, Giovanni Righini authored at least 53 papers between 1997 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs.
J. Sched., June, 2023

2022
The Skewed Kruskal Algorithm.
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

2021
A New Algorithm for the Single Source Weber Problem with Limited Distances.
Transp. Sci., 2021

Optimally rescheduling jobs with a Last-In-First-Out buffer.
J. Sched., 2021

A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies.
Oper. Res. Forum, 2021

Efficient optimization of the Held-Karp lower bound.
Open J. Math. Optim., 2021

Optimally rescheduling jobs with a LIFO buffer.
CoRR, 2021

2020
Automated Tuning of a Column Generation Algorithm.
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

Mathematical Programming Algorithms for Spatial Cloaking.
INFORMS J. Comput., 2018

2016
The Prize-collecting Scheduling Problem with Deadlines.
Electron. Notes Discret. Math., 2016

Preface.
Electron. Notes Discret. Math., 2016

A network flow model of the Northern Italy waterway system.
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

Optimal selection of contracts and work shifts in multi-skill call centers.
EURO J. Comput. Optim., 2014

Combined location and routing problems for drug distribution.
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
Modeling and solving profitable location and distribution problems.
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
Algorithms for the Design of Maximum Hydropathic Complementarity Molecules.
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

Editorial: Preface to the Special Issue.
Networks, 2011

A column generation algorithm for the vehicle routing problem with soft time windows.
4OR, 2011

2010
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem.
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 Column Generation Algorithm for a Rich Vehicle-Routing Problem.
Transp. Sci., 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

Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location.
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

An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem.
Oper. Res., 2008

A branch-and-bound algorithm for the linear ordering problem with cumulative costs.
Eur. J. Oper. Res., 2008

Solving the swath segment selection problem through Lagrangean relaxation.
Comput. Oper. Res., 2008

A branch-and-price algorithm for the two-dimensional level strip packing problem.
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

An optimization algorithm for a penalized knapsack problem.
Oper. Res. Lett., 2006

A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem.
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
A branch-and-price algorithm for the capacitated <i>p</i>-median problem.
Networks, 2005

2004
A note on the approximation of the asymmetric traveling salesman problem.
Eur. J. Oper. Res., 2004

Dynamic programming algorithms for the elementary shortest path problem with resource constraints.
Electron. Notes Discret. Math., 2004

2003
A combinatorial optimization problem arising from text classification.
Electron. Notes Discret. Math., 2003

1999
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems.
Discret. Appl. Math., 1999

A Human Centered Architecture for Distributed Retrieval of Medical Images.
Proceedings of the Computational Intelligence, 1999

1997
Annealing Algorithms for Multisource Absolute Location Problems on Graph.
Comput. Optim. Appl., 1997


  Loading...