|
Search the dblp DataBase
Silvano Martello:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Laureano F. Escudero, Silvano Martello, Paolo Toth
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:110-123 [Conf]
- Silvano Martello, François Soumis, Paolo Toth
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP] IPCO, 1992, pp:181-200 [Conf]
- Silvano Martello, Paolo Toth
Generalized Assignment Problems. [Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:351-369 [Conf]
- Denis Bouyssou, Silvano Martello, Frank Plastria
A case of plagiarism: Danut Marcu. [Citation Graph (0, 0)][DBLP] 4OR, 2006, v:4, n:1, pp:11-13 [Journal]
- Denis Bouyssou, Silvano Martello, Frank Plastria
4OR for what purpose? [Citation Graph (0, 0)][DBLP] 4OR, 2003, v:1, n:1, pp:1-6 [Journal]
- Denis Bouyssou, Silvano Martello, Frank Plastria
Acknowledgement to referees. [Citation Graph (0, 0)][DBLP] 4OR, 2003, v:1, n:4, pp:347-348 [Journal]
- Silvano Martello
Stefano Pallottino (1945-2004). [Citation Graph (0, 0)][DBLP] 4OR, 2004, v:2, n:2, pp:93-93 [Journal]
- Denis Bouyssou, Silvano Martello, Frank Plastria
Acknowledgement to referees. [Citation Graph (0, 0)][DBLP] 4OR, 2005, v:3, n:4, pp:341-342 [Journal]
- Denis Bouyssou, Silvano Martello, Frank Plastria
4OR: Year 4. [Citation Graph (0, 0)][DBLP] 4OR, 2006, v:4, n:1, pp:1-9 [Journal]
- Roberto Battiti, Alan A. Bertossi, Silvano Martello
Editorial. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:1, pp:1- [Journal]
- Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:42, n:2, pp:123-138 [Journal]
- Mauro Dell'Amico, Andrea Lodi, Silvano Martello
Efficient algorithms and codes for k-cardinality assignment problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:1, pp:25-40 [Journal]
- Mauro Dell'Amico, Silvano Martello
The k-cardinality Assignment Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:103-121 [Journal]
- Mauro Dell'Amico, Silvano Martello, Daniele Vigo
A lower bound for the non-oriented two-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:13-24 [Journal]
- Mauro Dell'Amico, Silvano Martello, Daniele Vigo
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:63, n:1, pp:25-41 [Journal]
- Martine Labbé, Gilbert Laporte, Silvano Martello
Preface. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:1- [Journal]
- Andrea Lodi, Silvano Martello, Daniele Vigo
Recent advances on two-dimensional bin packing problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:379-396 [Journal]
- Silvano Martello, François Soumis, Paolo Toth
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:75, n:2, pp:169-188 [Journal]
- Mauro Dell'Amico, Manuel Iori, Silvano Martello
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2004, v:10, n:2, pp:169-204 [Journal]
- Silvano Martello, Michele Monaci, Daniele Vigo
An Exact Approach to the Strip-Packing Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2003, v:15, n:3, pp:310-319 [Journal]
- Silvano Martello, Paolo Toth
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:4, pp:221-222 [Journal]
- Mauro Dell'Amico, Silvano Martello
Reduction of the Three-Partition Problem. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1999, v:3, n:1, pp:17-30 [Journal]
- Andrea Lodi, Silvano Martello, Daniele Vigo
Models and Bounds for Two-Dimensional Level Packing Problems. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2004, v:8, n:3, pp:363-379 [Journal]
- Silvano Martello, Paolo Toth
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 1985, v:11, n:2, pp:135-140 [Journal]
- Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
Lower bounds and heuristic algorithms for the k. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:3, pp:725-742 [Journal]
- Geir Hasle, Arne Løkketangen, Silvano Martello
Rich models in discrete optimization: Formulation and resolution (ECCO XVI). [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:175, n:3, pp:1752-1753 [Journal]
- Silvano Martello, Erwin Pesch
Logistics: From theory to application (ECCO XIV). [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:1-3 [Journal]
- Luca Maria Gambardella, Silvano Martello
Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV). [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:166, n:1, pp:1-2 [Journal]
- Mauro Dell'Amico, Silvano Martello
A note on exact algorithms for the identical parallel machine scheduling problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:160, n:2, pp:576-578 [Journal]
- Andrea Lodi, Silvano Martello, Michele Monaci
Two-dimensional packing problems: A survey. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2002, v:141, n:2, pp:241-252 [Journal]
- Andrea Lodi, Silvano Martello, Daniele Vigo
Heuristic algorithms for the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2002, v:141, n:2, pp:410-420 [Journal]
- Gennaro Improta, Silvano Martello
Graphs and Scheduling (ECCO XIII). [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2002, v:142, n:2, pp:219-220 [Journal]
- Martine Labbé, Gilbert Laporte, Silvano Martello
Upper bounds and algorithms for the maximum cardinality bin packing problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:149, n:3, pp:490-498 [Journal]
- Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 2007, v:33, n:1, pp:7- [Journal]
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. [Citation Graph (, )][DBLP]
An optimization problem in the electricity market. [Citation Graph (, )][DBLP]
No 7-year itch at 4OR. [Citation Graph (, )][DBLP]
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. [Citation Graph (, )][DBLP]
Heuristic algorithms for the general nonlinear separable knapsack problem. [Citation Graph (, )][DBLP]
The selective travelling salesman problem. [Citation Graph (, )][DBLP]
Lower bounds and reduction procedures for the bin packing problem. [Citation Graph (, )][DBLP]
Search in 0.027secs, Finished in 0.029secs
|