Search Results - "Mingozzi, A."

Refine Results
  1. 1

    An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation by Baldacci, R, Hadjiconstantinou, E, Mingozzi, A

    Published in Operations research (01-09-2004)
    “…The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to…”
    Get full text
    Journal Article
  2. 2

    Patterns of vegetation cover/dynamics in a protected Mediterranean mountain area: Influence of the ecological context and protection policy by Gargano, D., Mingozzi, A., Massolo, A., Rinaldo, S., Bernardo, L.

    Published in Plant biosystems (01-01-2012)
    “…In Mediterranean mountains, the abandonment of traditional land-uses is promoting a rapid forest expansion. This trend may be exacerbated by nature reserves,…”
    Get full text
    Journal Article
  3. 3

    A Set Partitioning Approach to the Crew Scheduling Problem by Mingozzi, A, Boschetti, M. A, Ricciardelli, S, Bianco, L

    Published in Operations research (01-11-1999)
    “…The crew scheduling problem (CSP) appears in many mass transport systems (e.g., airline, bus, and railway industry) and consists of scheduling a number of…”
    Get full text
    Journal Article
  4. 4

    An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections by Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.

    Published in Networks (01-08-2003)
    “…In this paper, we describe a new integer programming formulation for the Traveling Salesman Problem with mixed Deliveries and Collections (TSPDC) based on a…”
    Get full text
    Journal Article
  5. 5

    An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem by Boschetti, M.A., Mingozzi, A., Ricciardelli, S.

    Published in Annals of operations research (01-03-2004)
    “…The Multiple Depot Crew Scheduling Problem (MD-CSP) appears in public transit systems (e.g., airline, bus and railway industry) and consists of determining the…”
    Get full text
    Journal Article
  6. 6

    Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations by Christofides, N., Mingozzi, A., Toth, P.

    Published in Mathematical programming (01-12-1981)
    “…The authors consider the problem of routing vehicles stationed at a central facility (depot) to supply customers with known demands, in such a way as to…”
    Get full text
    Journal Article
  7. 7

    An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation by Baldacci, Roberto, Maniezzo, Vittorio, Mingozzi, Aristide

    Published in Operations research (01-05-2004)
    “…Car pooling is a transportation service organized by a large company which encourages its employees to pick up colleagues while driving to/from work to…”
    Get full text
    Journal Article
  8. 8

    The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem by BALDACCI, Roberto, BODIN, Lawrence, MINGOZZI, Aristide

    Published in Computers & operations research (01-09-2006)
    “…In the Multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (M-RRVRP), one of the very important pickup and…”
    Get full text
    Journal Article
  9. 9

    An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation by Mingozzi, Aristide, Maniezzo, Vittorio, Ricciardelli, Salvatore, Bianco, Lucio

    Published in Management science (01-05-1998)
    “…In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new…”
    Get full text
    Journal Article
  10. 10

    A dual ascent procedure for the set partitioning problem by Boschetti, M.A., Mingozzi, A., Ricciardelli, S.

    Published in Discrete optimization (01-11-2008)
    “…The set partitioning problem is a fundamental model for many important real-life transportation problems, including airline crew and bus driver scheduling and…”
    Get full text
    Journal Article
  11. 11

    A new method for solving capacitated location problems based on a set partitioning approach by Baldacci, Roberto, Hadjiconstantinou, Eleni, Maniezzo, Vittorio, Mingozzi, Aristide

    Published in Computers & operations research (01-04-2002)
    “…We consider the capacitated p-median problem (CPMP) in which a set of n customers must be partitioned into p disjoint clusters so that the total dissimilarity…”
    Get full text
    Journal Article
  12. 12

    An Exact Method for the Vehicle Routing Problem with Backhauls by Mingozzi, Aristide, Giorgi, Simone, Baldacci, Roberto

    Published in Transportation science (01-08-1999)
    “…We consider the problem in which a fleet of vehicles located at a central depot is to be optimally used to serve a set of customers partitioned into two…”
    Get full text
    Journal Article
  13. 13

    The Rollon-Rolloff Vehicle Routing Problem by Bodin, Lawrence, Mingozzi, Aristide, Baldacci, Roberto, Ball, Michael

    Published in Transportation science (01-08-2000)
    “…In this paper, a sanitation routing problem called the Rollon–Rolloff Vehicle Routing Problem (RRVRP) is defined. In the RRVRP, tractors move large trailers…”
    Get full text
    Journal Article
  14. 14

    Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints by Mingozzi, Aristide, Bianco, Lucio, Ricciardelli, Salvatore

    Published in Operations research (01-05-1997)
    “…The Traveling Salesman Problem with Time Window and Precedence Constraints ( TSP-TWPC ) is to find an Hamiltonian tour of minimum cost in a graph G = ( X , A )…”
    Get full text
    Journal Article
  15. 15

    The project scheduling problem with irregular starting time costs by Maniezzo, Vittorio, Mingozzi, Aristide

    Published in Operations research letters (01-11-1999)
    “…We consider the problem of scheduling a set of activities satisfying precedence constraints in order to minimize the sum of the costs associated with the…”
    Get full text
    Journal Article
  16. 16

    A Bionomic Approach to the Capacitated p-Median Problem by Maniezzo, Vittorio, Mingozzi, Aristide, Baldacci, Roberto

    Published in Journal of heuristics (01-09-1998)
    “…This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median…”
    Get full text
    Journal Article
  17. 17

    Partitioning a matrix with non-guillotine cuts to minimize the maximum cost by Mingozzi, Aristide, Morigi, Serena

    Published in Discrete Applied Mathematics (15-02-2002)
    “…We consider the problem of partitioning a matrix of m rows and n columns of non-negative integers into M smaller submatrices. With each submatrix is associated…”
    Get full text
    Journal Article
  18. 18
  19. 19

    Partitioning a matrix to minimize the maximum cost by Mingozzi, Aristide, Ricciardelli, Salvatore, Spadoni, Massimo

    Published in Discrete Applied Mathematics (08-09-1995)
    “…A matrix A = [ a ij ] of nonnegative integers must be partitioned into p blocks (submatrices) corresponding to a set of vertical cuts parallel to the columns…”
    Get full text
    Journal Article
  20. 20