#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1980

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mauro Dell'Amico, Marco Trubian
- Annals OR
- 1993

In this paper, we apply the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization. We show that our implementation of this method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements.

- Mauro Dell'Amico, Paolo Toth
- Discrete Applied Mathematics
- 2000

- Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello
- IFIP Congress: Fundamentals - Foundations of…
- 1998

Page 55 line 6: replace " among the matched " with " among the unmatched " ; 229 line 13: replace " Palubeckis [544] " with the following (missing) reference: G. Palubeckis. The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. 289 eqn (9.27): replace " s ∈ F " with " S ∈ F " ; 308 line 14: replace "… (More)

- Mauro Dell'Amico, Silvano Martello
- INFORMS Journal on Computing
- 1995

- Mauro Dell'Amico, Giovanni Righini, Matteo Salani
- Transportation Science
- 2006

The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from the customers to the depot must be performed by the same vehicles of limited capacity and the customers… (More)

- Roberto Baldacci, Mauro Dell'Amico, J. Salazar González
- Operations Research
- 2007

The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each non-visited customer to a visited point or customer. The number of customers visited and assigned to a ring is bounded by an upper limit: the capacity of the… (More)

- Mauro Dell'Amico, Silvano Martello
- Discrete Applied Mathematics
- 1997

- Roberto Aringhieri, Mauro Dell'Amico
- J. Heuristics
- 2005

- Mauro Dell'Amico, Silvano Martello, Daniele Vigo
- Discrete Applied Mathematics
- 2002

The two-dimensional discrete bin-packing problem (2BP ) consists in minimizing the number of identical rectangles used to pack a set of smaller rectangles. This problem is NP-complete. It occurs in industry if pieces of steel, wood, or paper have to be cut from larger rectangles. It belongs to the family of cutting and packing (C & P) problems, more… (More)

- Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
- INFORMS Journal on Computing
- 2008