Silvano Martello

ORCID

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 39

Top Venues

Publications

Yves Crama, Michel Grabisch, Silvano Martello
21 volumes for the 21st century. 4OR 22 (1) (2024)
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) (2024)
Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. Discret. Appl. Math. 335 (2023)
Antonio Alonso-Ayuso, Laureano F. Escudero, Silvano Martello
Emerging applications, models and algorithms in combinatorial optimization. Discret. Appl. Math. 335 (2023)
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello
Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. Comput. Oper. Res. 143 (2022)
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) (2022)
Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci
2DPackLib: a two-dimensional cutting and packing library. Optim. Lett. 16 (2) (2022)
Yves Crama, Michel Grabisch, Silvano Martello
Preface. Ann. Oper. Res. 314 (1) (2022)
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 (2022)
Yves Crama, Michel Grabisch, Silvano Martello
Sixty-one surveys in operations research. Ann. Oper. Res. 314 (1) (2022)
Gabriel Homsi, Jeremy Jordan, Silvano Martello, Michele Monaci
The assignment and loading transportation problem. Eur. J. Oper. Res. 289 (3) (2021)
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) (2021)
Yves Crama, Michel Grabisch, Silvano Martello
4OR comes of age. 4OR 19 (1) (2021)
John Baptist Gauci, Silvano Martello
Theory and applications in combinatorial optimization. J. Comb. Optim. 42 (2) (2021)
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) (2021)
Bo Chen, Silvano Martello, Bernard Ries
New progress in combinatorial optimization. Discret. Appl. Math. 290 (2021)
Claudia D'Ambrosio, Silvano Martello, Michele Monaci
Lower and upper bounds for the non-linear generalized assignment problem. Comput. Oper. Res. 120 (2020)
Andrej Brodnik, Silvano Martello
Combinatorial Optimization: Between Practice and Theory. Discret. Appl. Math. 264 (2019)
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) (2019)
Yves Crama, Michel Grabisch, Silvano Martello
Surveys in operations research. Ann. Oper. Res. 271 (1) (2018)
Tibor Jordán, Tamás Kis, Silvano Martello
Computational advances in combinatorial optimization. Discret. Appl. Math. 242 (2018)
Yves Crama, Michel Grabisch, Silvano Martello
Preface. Ann. Oper. Res. 271 (1) (2018)
Claudia D'Ambrosio, Silvano Martello, Luca Mencarelli
Relaxations and heuristics for the multiple non-linear separable knapsack problem. Comput. Oper. Res. 93 (2018)
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 (2018)
Maxence Delorme, Manuel Iori, Silvano Martello
BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12 (2) (2018)
Yves Crama, Michel Grabisch, Silvano Martello
Sweet sixteen. 4OR 16 (1) (2018)
Maxence Delorme, Manuel Iori, Silvano Martello
Logic based Benders' decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78 (2017)
Bo Chen, Peter Gritzmann, Silvano Martello
Combinatorial optimization: theory, computation, and applications. Discret. Appl. Math. 217 (2017)
Gianluca Costa, Maxence Delorme, Manuel Iori, Enrico Malaguti, Silvano Martello
Training software for orthogonal packing problems. Comput. Ind. Eng. 111 (2017)
Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello
Heuristics for the General Multiple Non-linear Knapsack Problem. Electron. Notes Discret. Math. 55 (2016)
Maxence Delorme, Manuel Iori, Silvano Martello
Bin packing and cutting stock problems: Mathematical models and exact algorithms. Eur. J. Oper. Res. 255 (1) (2016)
Yves Crama, Michel Grabisch, Silvano Martello
A brand new cheating attempt: a case of usurped identity. 4OR 14 (4) (2016)
Leo Liberti, Thierry Marchant, Silvano Martello
Preface. Ann. Oper. Res. 240 (1) (2016)
Leo Liberti, Thierry Marchant, Silvano Martello
Twelve surveys in operations research. Ann. Oper. Res. 240 (1) (2016)
Leo Liberti, Thierry Marchant, Silvano Martello
The dirty dozen of 4OR. 4OR 13 (1) (2015)
Silvano Martello
Decision Making under Uncertainty in Electricity Markets. J. Oper. Res. Soc. 66 (1) (2015)
Silvano Martello, Michele Monaci
Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63 (2015)
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) (2015)
Silvano Martello, Bernard Ries
Advances in Combinatorial Optimization. Discret. Appl. Math. 196 (2015)
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
Algorithms for the min-max regret generalized assignment problem with interval data. IEEM (2014)
Riccardo Rovatti, Claudia D'Ambrosio, Andrea Lodi, Silvano Martello
Optimistic MILP modeling of non-linear optimization problems. Eur. J. Oper. Res. 239 (1) (2014)
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) (2014)
Gianluca Costa, Claudia D'Ambrosio, Silvano Martello
Graphsj 3: a Modern Didactic Application for Graph Algorithms. J. Comput. Sci. 10 (7) (2014)
Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich
An overview of computational issues in combinatorial optimization. Ann. Oper. Res. 207 (1) (2013)
Leo Liberti, Thierry Marchant, Silvano Martello
Eleven surveys in operations research: III. Ann. Oper. Res. 204 (1) (2013)
Leo Liberti, Thierry Marchant, Silvano Martello
Preface. Ann. Oper. Res. 204 (1) (2013)
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) (2012)
Leo Liberti, Thierry Marchant, Silvano Martello
No end of the world in 2012 for 4OR. 4OR 10 (1) (2012)
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) (2012)
Silvano Martello, José M. P. Paixão
A look at the past and present of optimization - An editorial. Eur. J. Oper. Res. 219 (3) (2012)
Silvano Martello, Hercules Vladimirou
Developments in combinatorial optimization (ECCO-XX): Guest editorial. Comput. Optim. Appl. 48 (2) (2011)
Jacek Blazewicz, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov
Combinatorial optimization issues in scheduling. J. Sched. 14 (3) (2011)
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) (2011)
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) (2011)
Claudia D'Ambrosio, Silvano Martello
Heuristic algorithms for the general nonlinear separable knapsack problem. Comput. Oper. Res. 38 (2) (2011)
Silvano Martello
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. Central Eur. J. Oper. Res. 18 (1) (2010)
Denis Bouyssou, Silvano Martello, Frank Plastria
Preface. Ann. Oper. Res. 175 (1) (2010)
Claudia D'Ambrosio, Andrea Lodi, Silvano Martello
Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38 (1) (2010)
Manuel Iori, Silvano Martello, Daniele Pretolani
An aggregate label setting policy for the multi-objective shortest path problem. Eur. J. Oper. Res. 207 (3) (2010)
Albert Einstein Fernandes Muritiba, Manuel Iori, Silvano Martello, Marcos J. Negreiros Gomes
Models and algorithms for fair layout optimization problems. Ann. Oper. Res. 179 (1) (2010)
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. INFOCOM (2010)
Denis Bouyssou, Silvano Martello, Frank Plastria
Eleven surveys in operations research: II. Ann. Oper. Res. 175 (1) (2010)
Denis Bouyssou, Silvano Martello, Frank Plastria
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR 7 (1) (2009)
Denis Bouyssou, Silvano Martello, Frank Plastria
. 4OR 7 (1) (2009)
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) (2008)
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) (2008)
Mikhail Y. Kovalyov, Silvano Martello
Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII). Eur. J. Oper. Res. 189 (3) (2008)
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) (2008)
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) (2007)
Denis Bouyssou, Silvano Martello, Frank Plastria
Preface. Ann. Oper. Res. 153 (1) (2007)
Denis Bouyssou, Silvano Martello, Frank Plastria
Eleven surveys in Operations Research. Ann. Oper. Res. 153 (1) (2007)
Alberto Borghetti, Andrea Lodi, Silvano Martello, Michele Martignani, Carlo Alberto Nucci, Alessandro Trebbi
An optimization problem in the electricity market. 4OR 5 (3) (2007)
Geir Hasle, Arne Løkketangen, Silvano Martello
Rich models in discrete optimization: Formulation and resolution (ECCO XVI). Eur. J. Oper. Res. 175 (3) (2006)
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
Lower bounds and heuristic algorithms for the k. Eur. J. Oper. Res. 171 (3) (2006)
Denis Bouyssou, Silvano Martello, Frank Plastria
: Year 4. 4OR 4 (1) (2006)
Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3 (4) (2006)
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
A Tabu Search Algorithm for a Routing and Container Loading Problem. Transp. Sci. 40 (3) (2006)
Denis Bouyssou, Silvano Martello, Frank Plastria
A case of plagiarism: Danut Marcu. 4OR 4 (1) (2006)
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) (2005)
Mauro Dell'Amico, Silvano Martello
A note on exact algorithms for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 160 (2) (2005)
Luca Maria Gambardella, Silvano Martello
Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV). Eur. J. Oper. Res. 166 (1) (2005)
Silvano Martello, Erwin Pesch
Logistics: From theory to application (ECCO XIV). Eur. J. Oper. Res. 162 (1) (2005)
Denis Bouyssou, Silvano Martello, Frank Plastria
Acknowledgement to referees. 4OR 3 (4) (2005)
Andrea Lodi, Silvano Martello, Daniele Vigo
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Ann. Oper. Res. 131 (1-4) (2004)
Andrea Lodi, Silvano Martello, Daniele Vigo
Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8 (3) (2004)
Silvano Martello
Stefano Pallottino (1945-2004). 4OR 2 (2) (2004)
Mauro Dell'Amico, Manuel Iori, Silvano Martello
Problem. J. Heuristics 10 (2) (2004)
Silvano Martello, Michele Monaci, Daniele Vigo
An Exact Approach to the Strip-Packing Problem. INFORMS J. Comput. 15 (3) (2003)
Denis Bouyssou, Silvano Martello, Frank Plastria
Acknowledgement to referees. 4OR 1 (4) (2003)
Silvano Martello, Paolo Toth
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem. Oper. Res. 51 (5) (2003)
Martine Labbé, Gilbert Laporte, Silvano Martello
Upper bounds and algorithms for the maximum cardinality bin packing problem. Eur. J. Oper. Res. 149 (3) (2003)
Denis Bouyssou, Silvano Martello, Frank Plastria
4OR for what purpose? 4OR 1 (1) (2003)
Andrea Lodi, Silvano Martello, Daniele Vigo
Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123 (1-3) (2002)
Andrea Lodi, Silvano Martello, Michele Monaci
Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141 (2) (2002)
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) (2002)
Gennaro Improta, Silvano Martello
Graphs and Scheduling (ECCO XIII). Eur. J. Oper. Res. 142 (2) (2002)
Silvano Martello, Jean François Maurras
Graphs and Scheduling (ECCO XII). Eur. J. Oper. Res. 137 (2) (2002)
Andrea Lodi, Silvano Martello, Daniele Vigo
Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141 (2) (2002)
Roberto Battiti, Alan A. Bertossi, Silvano Martello
Editorial. Discret. Appl. Math. 110 (1) (2001)
Mauro Dell'Amico, Andrea Lodi, Silvano Martello
Efficient algorithms and codes for k-cardinality assignment problems. Discret. Appl. Math. 110 (1) (2001)

Silvano Martello.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Silvano Martello