Toth Paolo

Paolo Toth

Information about the author Paolo Toth will soon be added to the site.
Found 55 papers in total
Algorithms for the set covering problem
Algorithms for the set covering problem
2000
The Set Covering Problem (SCP) is a main model for several important applications,...
Algorithms and codes for dense assignment problems: The state of the art
Algorithms and codes for dense assignment problems: The state of the art
2000
The paper considers the classic linear assignment problem with a min-sum objective...
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991
A parallel version of the shortest augmenting path algorithm for the assignment...
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
2000
The design of effective exact enumerative algorithms for finding the optimal solution...
A heuristic method for the set covering problem
A heuristic method for the set covering problem
1999
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP)....
A survey of optimization models for train routing and scheduling
A survey of optimization models for train routing and scheduling
1998
The aim of this paper is to present a survey of recent optimization models for the...
An exact algorithm for the vehicle routing problem with backhauls
An exact algorithm for the vehicle routing problem with backhauls
1997
The Vehicle Routing Problem with Backhauls is an extension of the capacitated Vehicle...
New trends in exact algorithms for the 0–1 knapsack problem
New trends in exact algorithms for the 0–1 knapsack problem
2000
While the 1980s were focused on the solution of large sized ‘easy’...
Upper bounds and algorithms for hard 0–1 knapsack problems
Upper bounds and algorithms for hard 0–1 knapsack problems
1997
It is well-known that many instances of the 0–1 knapsack problem can be...
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
1997
We consider a variant of the classical symmetric Traveling Salesman Problem in which...
Exact solution of the quadratic knapsack problem
Exact solution of the quadratic knapsack problem
1999
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective...
Dynamic programming and strong bounds for the 0–1 knapsack problem
Dynamic programming and strong bounds for the 0–1 knapsack problem
1999
Two new algorithms recently proved to outperform all previous methods for the exact...
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
1999
We consider an extension of the capacitated Vehicle Routing Problem (VRP), known as...
Modeling and solving the crew rostering problem
Modeling and solving the crew rostering problem
1998
The Crew Rostering Problem (CRP) aims at determining an optimal sequencing of a given...
Solving the orienteering problem through branch-and-cut
Solving the orienteering problem through branch-and-cut
1998
In the Orienteering Problem (OP), we are given an undirected graph with edge weights...
Algorithms for railway crew management
Algorithms for railway crew management
1997
Crew management is concerned with building the work schedules of crews needed to cover...
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
1998
We present a framework for automatic tightening of general 0–1 programs. A given...
A polyhedral approach to the asymmetric traveling salesman problem
A polyhedral approach to the asymmetric traveling salesman problem
1997
Several branch-and-bound algorithms for the exact solution of the asymmetric traveling...
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991
A parallel version of the shortest augmenting path algorithm for the assignment...
The bottleneck generalized assignment problem
The bottleneck generalized assignment problem
1995
The min–max version of the generalized assignment problem is considered. We...
A note on exact algorithms for the bottleneck generalized assignment problem
A note on exact algorithms for the bottleneck generalized assignment problem
1995
We give a computational comparison between the algorithms of Mazzola–Neebe and...
Heuristic algorithms for the handicapped persons transportation problem
Heuristic algorithms for the handicapped persons transportation problem
1997
The authors examine the problem of determining an optimal schedule for a fleet of...
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
1994
The authors consider the asymmetric capacitated vehicle routing problem ( CVRP ), a...
An exact algorithm for the capacitated shortest spanning arborescence
An exact algorithm for the capacitated shortest spanning arborescence
1995
The authors are given a complete and loop-free digraph G=(V,a), where V={1,...,n} is...
Papers per page: