Avella Pasquale

Pasquale Avella

Information about the author Pasquale Avella will soon be added to the site.
Found 19 papers in total
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
2015
The inventory routing problem (IRP) involves the distribution of one or more products...
An aggregation heuristic for large scale p‐median problem
An aggregation heuristic for large scale p‐median problem
2012
The p ‐median problem (PMP) consists of locating p facilities (medians) in...
Computational experience with general cutting planes for the Set Covering problem
Computational experience with general cutting planes for the Set Covering problem
2009
In this paper we present a cutting plane algorithm for the Set Covering problem....
A computational study of exact knapsack separation for the generalized assignment problem
A computational study of exact knapsack separation for the generalized assignment problem
2010
The Generalized Assignment Problem is a well-known NP-hard combinatorial optimization...
An effective heuristic for large-scale capacitated facility location problems
An effective heuristic for large-scale capacitated facility location problems
2009
The Capacitated Facility Location Problem ( CFLP ) consists of locating a set of...
An LP-based heuristic for a time-constrained routing problem
An LP-based heuristic for a time-constrained routing problem
2006
In this paper we present an LP-based heuristic for the solution of a Time Constrained...
A computational study of local search algorithms for Italian high-school timetabling
A computational study of local search algorithms for Italian high-school timetabling
2007
In this paper we report on a computational experience with a local search algorithm...
A computational study of a cutting plane algorithm for university course timetabling
A computational study of a cutting plane algorithm for university course timetabling
2005
In this paper, we describe a case-study where a Branch-and-Cut algorithm yields the...
Metric inequalities and the Network Loading Problem
Metric inequalities and the Network Loading Problem
2007
Given a simple graph G(V,E) and a set of traffic demands between the nodes of G , the...
Near-optimal solutions of large-scale single-machine scheduling problems
Near-optimal solutions of large-scale single-machine scheduling problems
2005
The single-machine scheduling problem (SMSP) with release dates concerns the optimal...
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
2005
In this paper we address the problem of finding the radial configuration of an...
A branch-and-cut algorithm for the median-path problem
A branch-and-cut algorithm for the median-path problem
2005
The Median-Path problem consists of locating an st -path on a network, minimizing a...
Solving a fuel delivery problem by heuristic and exact approaches
Solving a fuel delivery problem by heuristic and exact approaches
2004
In this paper we study the case of a company that delivers different types of fuel to...
Resource constrained shortest path problems in path planning for fleet management
Resource constrained shortest path problems in path planning for fleet management
2004
In the management and control of a vehicle fleet on a road network, the problem arises...
A penalty function heuristic for the resource constrained shortest path problem
A penalty function heuristic for the resource constrained shortest path problem
2002
The resource constrained shortest path problem (RCSP) consists of finding the shortest...
Logical reduction tests for the p-median problem
Logical reduction tests for the p-median problem
1999
Preprocessing plays a crucial role in solving combinatorial optimization problems. It...
Reduction test for the p-median problem
Reduction test for the p-median problem
1996
Preprocessing plays a crucial role in solving combinatorial optimization problems. It...
A new criterion of classification for the network plant location
A new criterion of classification for the network plant location
1994
Network plant location problems with min-sum criterion consist of determining a subset...
Portfolio Selection: A mixed-integer programming model solved by a Branch and Bound algorithm
Portfolio Selection: A mixed-integer programming model solved by a Branch and Bound algorithm
1990
Portfolio Selection can be represented by Markowitz’s continuous model. This...
Papers per page: