|
Search the dblp DataBase
Aristide Mingozzi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Aristide Mingozzi
State Space Relaxation and Search Strategies in Dynamic Programming. [Citation Graph (0, 0)][DBLP] SARA, 2002, pp:51- [Conf]
- Aristide Mingozzi
The Multi-depot Periodic Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP] SARA, 2005, pp:347-350 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
An Adaptive Memory-Based Approach Based on Partial Enumeration. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|