Toth Paolo

Paolo Toth

Information about the author Paolo Toth will soon be added to the site.
Found 55 papers in total
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions
2016
On a daily basis, large‐scale disruptions require infrastructure managers and...
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
2013
We improve the well‐known result presented in Bertsimas and Sim (2003)...
Exact approaches for solving robust prize‐collecting Steiner tree problems
Exact approaches for solving robust prize‐collecting Steiner tree problems
2013
In the Prize‐Collecting Steiner Tree Problem (PCStT) we are given a set of...
An Exact Algorithm for the Multitrip Vehicle Routing Problem
An Exact Algorithm for the Multitrip Vehicle Routing Problem
2013
The multitrip vehicle routing problem (MTVRP) is a variant of the capacitated vehicle...
Finding cliques of maximum weight on a generalization of permutation graphs
Finding cliques of maximum weight on a generalization of permutation graphs
2013
We propose a dynamic programming procedure for computing the clique of maximum weight...
On integer polytopes with few nonzero vertices
On integer polytopes with few nonzero vertices
2013
We provide a simple description in terms of linear inequalities of the convex hull of...
The Generalized Covering Salesman Problem
The Generalized Covering Salesman Problem
2012
Given a graph G = ( N , E ), the covering salesman problem (CSP) is to identify the...
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
2010
Given an undirected graph whose edges are labeled or colored, edge weights indicating...
A two‐phase hybrid heuristic algorithm for the capacitated location‐routing problem
A two‐phase hybrid heuristic algorithm for the capacitated location‐routing problem
2013
In this paper, we propose a two‐phase hybrid heuristic algorithm to solve the...
Nominal and robust train timetabling problems
Nominal and robust train timetabling problems
2012
In this paper we survey the main studies dealing with the train timetabling problem in...
An Integer Linear Programming based heuristic for the Capacitated m‐Ring‐Star Problem
An Integer Linear Programming based heuristic for the Capacitated m‐Ring‐Star Problem
2012
We address the Capacitated m‐Ring‐Star Problem in which the aim is to...
A Freight Service Design Problem for a Railway Corridor
A Freight Service Design Problem for a Railway Corridor
2011
We study the problem of designing a set of highly profitable freight routes in a...
Solution of the Train Platforming Problem
Solution of the Train Platforming Problem
2011
In this paper we study a general formulation of the train platforming problem, which...
Algorithms for the bin packing problem with conflicts
Algorithms for the bin packing problem with conflicts
2010
We consider a particular bin packing problem in which some pairs of items may be in...
Exact algorithms for routing problems under vehicle capacity constraints
Exact algorithms for routing problems under vehicle capacity constraints
2010
The solution of a vehicle routing problem calls for the determination of a set of...
A survey on vertex coloring problems
A survey on vertex coloring problems
2010
This paper surveys the most important algorithmic and computational results on the...
Scheduling extra freight trains on railway networks
Scheduling extra freight trains on railway networks
2010
We study the problem of freight transportation in railway networks, where both...
A Metaheuristic Approach for the Vertex Coloring Problem
A Metaheuristic Approach for the Vertex Coloring Problem
2008
Given an undirected graph G = ( V , E ), the vertex coloring problem (VCP)...
The granular tabu search and its application to the vehicle-routing problem
The granular tabu search and its application to the vehicle-routing problem
2003
We describe a new variant, called granular tabu search, of the well-known tabu-search...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006
Several combinatorial optimization problems can be formulated as large set-covering...
An exact algorithm for the two-constraint 0–1 knapsack problem
An exact algorithm for the two-constraint 0–1 knapsack problem
2003
We consider a knapsack problem in which each item has two types of weight and the...
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
2001
Crew and vehicle scheduling are fundamental issues in public transit management....
Modeling and solving the train timetabling problem
Modeling and solving the train timetabling problem
2002
The train timetabling problem aims at determining a periodic timetable for a set of...
An exact algorithm for the subset sum problem
An exact algorithm for the subset sum problem
2002
The subset sum problem (SSP) is defined as: ‘Given n positive integers w 1 ,...,...
Papers per page: