The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aristide Mingozzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Aristide Mingozzi
    State Space Relaxation and Search Strategies in Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    SARA, 2002, pp:51- [Conf]
  2. Aristide Mingozzi
    The Multi-depot Periodic Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    SARA, 2005, pp:347-350 [Conf]
  3. Marco A. Boschetti, Aristide Mingozzi
    The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:1, pp:27-42 [Journal]
  4. Marco A. Boschetti, Aristide Mingozzi
    The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:2, pp:135-147 [Journal]
  5. Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi
    The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2667-2702 [Journal]
  6. Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi
    A new method for solving capacitated location problems based on a set partitioning approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:4, pp:365-386 [Journal]
  7. Aristide Mingozzi, Serena Morigi
    Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:3, pp:243-260 [Journal]
  8. Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni
    Partitioning a Matrix to Minimize the Maximum Cost. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:221-248 [Journal]
  9. Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci
    A Bionomic Approach to the Capacitated p-Median Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1998, v:4, n:3, pp:263-280 [Journal]
  10. Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
    An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:26-41 [Journal]
  11. Vittorio Maniezzo, Aristide Mingozzi
    The project scheduling problem with irregular starting time costs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:25, n:4, pp:175-182 [Journal]

  12. An Adaptive Memory-Based Approach Based on Partial Enumeration. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002