default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvano Martello
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j134]Laura Galli
, Silvano Martello, Carlos Rodrigo Rey Barra, Paolo Toth:
The quadratic knapsack problem with setup. Comput. Oper. Res. 173: 106873 (2025)- 2024
- [j133]Yves Crama, Michel Grabisch, Silvano Martello:
21 volumes for the 21st century. 4OR 22(1): 1-16 (2024) - [j132]Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2023
- [j131]Antonio Alonso-Ayuso, Laureano F. Escudero, Silvano Martello:
Emerging applications, models and algorithms in combinatorial optimization. Discret. Appl. Math. 335: 1-3 (2023) - [j130]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. Discret. Appl. Math. 335: 36-51 (2023) - 2022
- [j129]Yves Crama, Michel Grabisch, Silvano Martello:
Preface. Ann. Oper. Res. 314(1): 1-3 (2022) - [j128]Yves Crama, Michel Grabisch, Silvano Martello:
Sixty-one surveys in operations research. Ann. Oper. Res. 314(1): 5-13 (2022) - [j127]Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello:
Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. Comput. Oper. Res. 143: 105692 (2022) - [j126]Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello:
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143: 105693 (2022) - [j125]Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion. INFORMS J. Comput. 34(5): 2523-2539 (2022) - [j124]Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci:
2DPackLib: a two-dimensional cutting and packing library. Optim. Lett. 16(2): 471-480 (2022) - 2021
- [j123]Yves Crama, Michel Grabisch, Silvano Martello:
4OR comes of age. 4OR 19(1): 1-13 (2021) - [j122]Bo Chen, Silvano Martello, Bernard Ries:
New progress in combinatorial optimization. Discret. Appl. Math. 290: 68-70 (2021) - [j121]Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Flávio Keidi Miyazawa, Michele Monaci:
Exact solution techniques for two-dimensional cutting and packing. Eur. J. Oper. Res. 289(2): 399-415 (2021) - [j120]Gabriel Homsi, Jeremy Jordan, Silvano Martello, Michele Monaci:
The assignment and loading transportation problem. Eur. J. Oper. Res. 289(3): 999-1007 (2021) - [j119]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 291(3): 871-882 (2021) - [j118]John Baptist Gauci, Silvano Martello:
Theory and applications in combinatorial optimization. J. Comb. Optim. 42(2): 207-211 (2021) - 2020
- [j117]Claudia D'Ambrosio, Silvano Martello, Michele Monaci:
Lower and upper bounds for the non-linear generalized assignment problem. Comput. Oper. Res. 120: 104933 (2020)
2010 – 2019
- 2019
- [j116]Andrej Brodnik, Silvano Martello:
Combinatorial Optimization: Between Practice and Theory. Discret. Appl. Math. 264: 1-3 (2019) - [j115]Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello:
Mathematical models and decomposition methods for the multiple knapsack problem. Eur. J. Oper. Res. 274(3): 886-899 (2019) - 2018
- [j114]Yves Crama, Michel Grabisch, Silvano Martello:
Sweet sixteen. 4OR 16(1): 1-13 (2018) - [j113]Yves Crama, Michel Grabisch, Silvano Martello:
Preface. Ann. Oper. Res. 271(1): 1-2 (2018) - [j112]Yves Crama, Michel Grabisch, Silvano Martello:
Surveys in operations research. Ann. Oper. Res. 271(1): 3-10 (2018) - [j111]Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem. Comput. Ind. Eng. 125: 98-110 (2018) - [j110]Claudia D'Ambrosio, Silvano Martello, Luca Mencarelli:
Relaxations and heuristics for the multiple non-linear separable knapsack problem. Comput. Oper. Res. 93: 79-89 (2018) - [j109]Tibor Jordán, Tamás Kis, Silvano Martello:
Computational advances in combinatorial optimization. Discret. Appl. Math. 242: 1-3 (2018) - [j108]Maxence Delorme, Manuel Iori, Silvano Martello:
BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12(2): 235-250 (2018) - 2017
- [j107]Gianluca Costa, Maxence Delorme, Manuel Iori, Enrico Malaguti, Silvano Martello:
Training software for orthogonal packing problems. Comput. Ind. Eng. 111: 139-147 (2017) - [j106]Maxence Delorme, Manuel Iori, Silvano Martello:
Logic based Benders' decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78: 290-298 (2017) - [j105]Bo Chen, Peter Gritzmann, Silvano Martello:
Combinatorial optimization: theory, computation, and applications. Discret. Appl. Math. 217: 1-2 (2017) - 2016
- [j104]Yves Crama, Michel Grabisch, Silvano Martello:
A brand new cheating attempt: a case of usurped identity. 4OR 14(4): 333-336 (2016) - [j103]Leo Liberti, Thierry Marchant, Silvano Martello:
Preface. Ann. Oper. Res. 240(1): 1 (2016) - [j102]Leo Liberti, Thierry Marchant, Silvano Martello:
Twelve surveys in operations research. Ann. Oper. Res. 240(1): 3-11 (2016) - [j101]Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello:
Heuristics for the General Multiple Non-linear Knapsack Problem. Electron. Notes Discret. Math. 55: 69-72 (2016) - [j100]Maxence Delorme, Manuel Iori, Silvano Martello:
Bin packing and cutting stock problems: Mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1): 1-20 (2016) - 2015
- [j99]Leo Liberti, Thierry Marchant, Silvano Martello:
The dirty dozen of 4OR. 4OR 13(1): 1-13 (2015) - [j98]Silvano Martello, Michele Monaci:
Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63: 161-171 (2015) - [j97]Silvano Martello, Bernard Ries:
Advances in Combinatorial Optimization. Discret. Appl. Math. 196: 1-3 (2015) - [j96]Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. INFORMS J. Comput. 27(2): 392-405 (2015) - [j95]Silvano Martello:
Decision Making under Uncertainty in Electricity Markets. J. Oper. Res. Soc. 66(1): 174 (2015) - 2014
- [j94]Riccardo Rovatti, Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Optimistic MILP modeling of non-linear optimization problems. Eur. J. Oper. Res. 239(1): 32-45 (2014) - [j93]Gianluca Costa, Claudia D'Ambrosio, Silvano Martello:
Graphsj 3: a Modern Didactic Application for Graph Algorithms. J. Comput. Sci. 10(7): 1115-1119 (2014) - [j92]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA. IEEE/ACM Trans. Netw. 22(5): 1645-1658 (2014) - [c5]Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Algorithms for the min-max regret generalized assignment problem with interval data. IEEM 2014: 734-738 - 2013
- [j91]Leo Liberti, Thierry Marchant, Silvano Martello:
Preface. Ann. Oper. Res. 204(1): 1 (2013) - [j90]Leo Liberti, Thierry Marchant, Silvano Martello:
Eleven surveys in operations research: III. Ann. Oper. Res. 204(1): 3-9 (2013) - [j89]Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich:
An overview of computational issues in combinatorial optimization. Ann. Oper. Res. 207(1): 1-5 (2013) - 2012
- [j88]Leo Liberti, Thierry Marchant, Silvano Martello:
No end of the world in 2012 for 4OR. 4OR 10(1): 1-13 (2012) - [j87]Silvano Martello, José M. P. Paixão:
A look at the past and present of optimization - An editorial. Eur. J. Oper. Res. 219(3): 638-640 (2012) - [j86]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. J. Heuristics 18(6): 939-942 (2012) - [j85]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. Optim. Lett. 6(1): 1-9 (2012) - 2011
- [j84]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. Comput. Networks 55(16): 3680-3693 (2011) - [j83]Silvano Martello, Hercules Vladimirou:
Developments in combinatorial optimization (ECCO-XX): Guest editorial. Comput. Optim. Appl. 48(2): 341-343 (2011) - [j82]Claudia D'Ambrosio, Silvano Martello:
Heuristic algorithms for the general nonlinear separable knapsack problem. Comput. Oper. Res. 38(2): 505-513 (2011) - [j81]Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen:
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. Manag. Sci. 57(12): 2130-2144 (2011) - [j80]Jacek Blazewicz, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov:
Combinatorial optimization issues in scheduling. J. Sched. 14(3): 221-223 (2011) - 2010
- [j79]Denis Bouyssou, Silvano Martello, Frank Plastria:
Preface. Ann. Oper. Res. 175(1): 1 (2010) - [j78]Denis Bouyssou, Silvano Martello, Frank Plastria:
Eleven surveys in operations research: II. Ann. Oper. Res. 175(1): 3-8 (2010) - [j77]Albert Einstein Fernandes Muritiba, Manuel Iori, Silvano Martello, Marcos José Negreiros Gomes:
Models and algorithms for fair layout optimization problems. Ann. Oper. Res. 179(1): 5-14 (2010) - [j76]Silvano Martello:
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. Central Eur. J. Oper. Res. 18(1): 47-58 (2010) - [j75]Manuel Iori, Silvano Martello, Daniele Pretolani:
An aggregate label setting policy for the multi-objective shortest path problem. Eur. J. Oper. Res. 207(3): 1489-1496 (2010) - [j74]Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38(1): 39-46 (2010) - [c4]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. INFOCOM 2010: 2160-2168
2000 – 2009
- 2009
- [b1]Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello:
Assignment Problems. SIAM 2009, ISBN 978-0-89871-663-4, pp. I-XX, 1-382 - [j73]Denis Bouyssou, Silvano Martello, Frank Plastria:
No 7-year itch at 4OR. 4OR 7(1): 1-15 (2009) - [j72]Denis Bouyssou, Silvano Martello, Frank Plastria:
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR 7(1): 17-20 (2009) - 2008
- [j71]Mikhail Y. Kovalyov, Silvano Martello:
Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII). Eur. J. Oper. Res. 189(3): 803-806 (2008) - [j70]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. INFORMS J. Comput. 20(3): 333-344 (2008) - [j69]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4-18 (2008) - [j68]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(2): 153 (2008) - [p2]Manuel Iori, Silvano Martello:
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 41-59 - 2007
- [j67]Alberto Borghetti, Andrea Lodi, Silvano Martello, Michele Martignani, Carlo Alberto Nucci, Alessandro Trebbi:
An optimization problem in the electricity market. 4OR 5(3): 247-259 (2007) - [j66]Denis Bouyssou, Silvano Martello, Frank Plastria:
Preface. Ann. Oper. Res. 153(1): 1 (2007) - [j65]Denis Bouyssou, Silvano Martello, Frank Plastria:
Eleven surveys in Operations Research. Ann. Oper. Res. 153(1): 3-7 (2007) - [j64]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. ACM Trans. Math. Softw. 33(1): 7 (2007) - 2006
- [j63]Denis Bouyssou, Silvano Martello, Frank Plastria:
4OR: Year 4. 4OR 4(1): 1-9 (2006) - [j62]Denis Bouyssou, Silvano Martello, Frank Plastria:
A case of plagiarism: Danut Marcu. 4OR 4(1): 11-13 (2006) - [j61]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - [j60]Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
Lower bounds and heuristic algorithms for the k. Eur. J. Oper. Res. 171(3): 725-742 (2006) - [j59]Geir Hasle, Arne Løkketangen, Silvano Martello:
Rich models in discrete optimization: Formulation and resolution (ECCO XVI). Eur. J. Oper. Res. 175(3): 1752-1753 (2006) - [j58]Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
A Tabu Search Algorithm for a Routing and Container Loading Problem. Transp. Sci. 40(3): 342-350 (2006) - 2005
- [j57]Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 4OR 3(4): 341-342 (2005) - [j56]Mauro Dell'Amico, Silvano Martello:
A note on exact algorithms for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 160(2): 576-578 (2005) - [j55]Silvano Martello, Erwin Pesch:
Logistics: From theory to application (ECCO XIV). Eur. J. Oper. Res. 162(1): 1-3 (2005) - [j54]Luca Maria Gambardella, Silvano Martello:
Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV). Eur. J. Oper. Res. 166(1): 1-2 (2005) - [j53]Edgar den Boef, Jan H. M. Korst, Silvano Martello, David Pisinger, Daniele Vigo:
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems. Oper. Res. 53(4): 735-736 (2005) - 2004
- [j52]Silvano Martello:
Stefano Pallottino (1945-2004). 4OR 2(2): 93-93 (2004) - [j51]Andrea Lodi, Silvano Martello, Daniele Vigo:
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Ann. Oper. Res. 131(1-4): 203-213 (2004) - [j50]Mauro Dell'Amico, Manuel Iori, Silvano Martello:
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. J. Heuristics 10(2): 169-204 (2004) - [j49]Andrea Lodi, Silvano Martello, Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8(3): 363-379 (2004) - 2003
- [j48]Denis Bouyssou, Silvano Martello, Frank Plastria:
4OR for what purpose? 4OR 1(1): 1-6 (2003) - [j47]Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 4OR 1(4): 347-348 (2003) - [j46]Martine Labbé, Gilbert Laporte, Silvano Martello:
Upper bounds and algorithms for the maximum cardinality bin packing problem. Eur. J. Oper. Res. 149(3): 490-498 (2003) - [j45]Silvano Martello, Michele Monaci, Daniele Vigo:
An Exact Approach to the Strip-Packing Problem. INFORMS J. Comput. 15(3): 310-319 (2003) - [j44]Silvano Martello, Paolo Toth:
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem. Oper. Res. 51(5): 826-835 (2003) - 2002
- [j43]Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
A lower bound for the non-oriented two-dimensional bin packing problem. Discret. Appl. Math. 118(1-2): 13-24 (2002) - [j42]Andrea Lodi, Silvano Martello, Daniele Vigo:
Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1-3): 379-396 (2002) - [j41]Silvano Martello, Jean François Maurras:
Graphs and Scheduling (ECCO XII). Eur. J. Oper. Res. 137(2): 231-232 (2002) - [j40]Andrea Lodi, Silvano Martello, Michele Monaci:
Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141(2): 241-252 (2002) - [j39]Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141(2): 410-420 (2002) - [j38]Gennaro Improta, Silvano Martello:
Graphs and Scheduling (ECCO XIII). Eur. J. Oper. Res. 142(2): 219-220 (2002) - 2001
- [j37]Roberto Battiti, Alan A. Bertossi, Silvano Martello:
Editorial. Discret. Appl. Math. 110(1): 1 (2001) - [j36]Mauro Dell'Amico, Andrea Lodi, Silvano Martello:
Efficient algorithms and codes for k-cardinality assignment problems. Discret. Appl. Math. 110(1): 25-40 (2001) - [j35]Martine Labbé, Gilbert Laporte, Silvano Martello:
Preface. Discret. Appl. Math. 112(1-3): 1 (2001) - [j34]Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth:
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. Manag. Sci. 47(6): 833-850 (2001) - 2000
- [j33]Silvano Martello, David Pisinger, Paolo Toth:
New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. 123(2): 325-332 (2000) - [j32]Silvano Martello, David Pisinger, Daniele Vigo:
The Three-Dimensional Bin Packing Problem. Oper. Res. 48(2): 256-267 (2000)
1990 – 1999
- 1999
- [j31]Andrea Lodi, Silvano Martello, Daniele Vigo:
Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Oper. Res. 112(1): 158-166 (1999) - [j30]Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS J. Comput. 11(4): 345-357 (1999) - [j29]Mauro Dell'Amico, Silvano Martello:
Reduction of the Three-Partition Problem. J. Comb. Optim. 3(1): 17-30 (1999) - [p1]Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo:
Bin Packing Approximation Algorithms: Combinatorial Analysis. Handbook of Combinatorial Optimization 1999: 151-207 - 1998
- [j28]Laureano F. Escudero, Silvano Martello, Paolo Toth:
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. Ann. Oper. Res. 81: 379-404 (1998) - 1997
- [j27]Silvano Martello, François Soumis, Paolo Toth:
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. Discret. Appl. Math. 75(2): 169-188 (1997) - [j26]Mauro Dell'Amico, Silvano Martello:
The k-cardinality Assignment Problem. Discret. Appl. Math. 76(1-3): 103-121 (1997) - [j25]Silvano Martello, Paolo Toth:
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems. Oper. Res. 45(5): 768-778 (1997) - 1996
- [j24]Mauro Dell'Amico, Silvano Martello:
Open shop, satellite communication and a theorem by Egerváry (1931). Oper. Res. Lett. 18(5): 207-211 (1996) - 1995
- [j23]Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discret. Appl. Math. 63(1): 25-41 (1995) - [j22]Mauro Dell'Amico, Silvano Martello:
Optimal Scheduling of Tasks on Identical Parallel Processors. INFORMS J. Comput. 7(2): 191-200 (1995) - [j21]Martine Labbé, Gilbert Laporte, Silvano Martello:
An exact algorithm for the dual bin packing problem. Oper. Res. Lett. 17(1): 9-18 (1995) - [c3]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. IPCO 1995: 110-123 - 1993
- [j20]Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello:
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. Discret. Appl. Math. 42(2): 123-138 (1993) - [j19]Matteo Fischetti, Gilbert Laporte, Silvano Martello:
The Delivery Man Problem and Cumulative Matroids. Oper. Res. 41(6): 1055-1064 (1993) - 1992
- [j18]Matteo Fischetti, Silvano Martello, Paolo Toth:
Approximation Algorithms for Fixed Job Schedule Problems. Oper. Res. 40(Supplement-1): S96-S108 (1992) - [j17]Silvano Martello, Paolo Toth:
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. Inf. Process. Lett. 44(4): 221-222 (1992) - [c2]Silvano Martello, François Soumis, Paolo Toth:
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. IPCO 1992: 181-200 - [c1]Silvano Martello, Paolo Toth:
Generalized Assignment Problems. ISAAC 1992: 351-369 - 1990
- [j16]Gilbert Laporte, Silvano Martello:
The selective travelling salesman problem. Discret. Appl. Math. 26(2-3): 193-207 (1990) - [j15]Silvano Martello, Paolo Toth:
Lower bounds and reduction procedures for the bin packing problem. Discret. Appl. Math. 28(1): 59-70 (1990)
1980 – 1989
- 1989
- [j14]Matteo Fischetti, Silvano Martello, Paolo Toth:
The Fixed Job Schedule Problem with Working-Time Constraints. Oper. Res. 37(3): 395-403 (1989) - 1987
- [j13]Matteo Fischetti, Silvano Martello, Paolo Toth:
The Fixed Job Schedule Problem with Spread-Time Constraints. Oper. Res. 35(6): 849-858 (1987) - [j12]Matteo Fischetti, Silvano Martello:
Worst-case analysis of the differencing method for the partition problem. Math. Program. 37(1): 117-120 (1987) - 1986
- [j11]Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth:
Most and least uniform spanning trees. Discret. Appl. Math. 15(2-3): 181-197 (1986) - 1985
- [j10]Silvano Martello, Paolo Toth:
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. ACM Trans. Math. Softw. 11(2): 135-140 (1985) - 1984
- [j9]Giorgio Carpaneto, Silvano Martello, Paolo Toth:
An Algorithm for the Bottleneck Traveling Salesman Problem. Oper. Res. 32(2): 380-389 (1984) - [j8]Silvano Martello, Paolo Toth:
Worst-case analysis of greedy algorithms for the subset-sum problem. Math. Program. 28(2): 198-205 (1984) - 1983
- [j7]Silvano Martello:
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph. ACM Trans. Math. Softw. 9(1): 131-138 (1983) - 1982
- [j6]Silvano Martello, Paolo Toth:
Finding a minimum equivalent graph of a digraph. Networks 12(2): 89-100 (1982) - 1981
- [j5]Silvano Martello, Paolo Toth:
Heuristic algorithms for the multiple knapsack problem. Computing 27(2): 93-112 (1981) - [j4]Silvano Martello, Paolo Toth:
A Bound and Bound algorithm for the zero-one multiple knapsack problem. Discret. Appl. Math. 3(4): 275-288 (1981) - 1980
- [j3]Silvano Martello, Paolo Toth:
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems. Oper. Res. 28(5): 1226-1227 (1980)
1970 – 1979
- 1979
- [j2]Silvano Martello:
An algorithm for finding a minimal equivalent graph of a strongly connected digraph. Computing 21(3): 183-194 (1979) - 1978
- [j1]Silvano Martello, Paolo Toth:
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem. Computing 21(1): 81-86 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
