Person:510928

Available identifiers

zbMath Open righini.giovanniMaRDI QIDQ510928

List of research outcomes

Publication	Date of Publication	Type
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs	2023-07-13	Paper
Efficient optimization of the Held-Karp lower bound	2022-08-20	Paper
Optimally rescheduling jobs with a last-in-first-out buffer	2022-01-14	Paper
A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies	2021-02-08	Paper
Mathematical Programming Algorithms for Spatial Cloaking	2020-12-03	Paper
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization	2020-11-09	Paper
The prize-collecting scheduling problem with deadlines	2017-02-14	Paper
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows	2015-11-19	Paper
Optimal selection of contracts and work shifts in multi-skill call centers	2015-01-28	Paper
Combined location and routing problems for drug distribution	2014-05-05	Paper
Modeling and solving profitable location and distribution problems	2013-11-01	Paper
A column generation algorithm for the vehicle routing problem with soft time windows	2011-05-25	Paper
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint	2010-12-13	Paper
A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows	2010-01-20	Paper
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem	2009-08-13	Paper
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem	2009-08-13	Paper
A branch-and-price algorithm for the two-dimensional level strip packing problem	2009-07-13	Paper
A computational evaluation of a general branch-and-price framework for capacitated network location problems	2009-06-25	Paper
A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times	2009-04-27	Paper
A branch-and-price algorithm for the multi-source Weber problem	2009-02-05	Paper
Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming	2008-12-04	Paper
New dynamic programming algorithms for the resource constrained elementary shortest path problem	2008-06-20	Paper
A branch-and-bound algorithm for the linear ordering problem with cumulative costs	2008-04-22	Paper
An optimization algorithm for a penalized knapsack problem	2008-01-15	Paper
Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints	2008-01-11	Paper
Solving the swath segment selection problem through Lagrangean relaxation	2007-10-19	Paper
Dynamic programming algorithms for the elementary shortest path problem with resource constraints	2007-05-29	Paper
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times	2007-05-29	Paper
Computational approaches to a combinatorial optimization problem arising from text classification	2007-02-19	Paper
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery	2006-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q5708528	2005-11-18	Paper
A branch‐and‐price algorithm for the capacitated p‐median problem	2005-06-01	Paper
A note on the approximation of the asymmetric traveling salesman problem.	2004-01-05	Paper
Modeling and Optimizing Dynamic Dial-a-Ride Problems	2002-01-30	Paper
Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems	1999-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4229635	1999-02-22	Paper
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem	1998-08-16	Paper
A double annealing algorithm for discrete location/allocation problems	1998-07-14	Paper
Annealing algorithms for multisource absolute location problems on graph	1997-06-04	Paper
Heuristics from Nature for Hard Combinatorial Optimization Problems	1997-01-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Giovanni Righini