Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem. - Silvano Martello; Paolo Toth (Computing, 1978)

An algorithm for finding a minimal equivalent graph of a strongly connected digraph. - Silvano Martello (Computing, 1979)

Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems. - Silvano Martello; Paolo Toth (Oper. Res., 1980)

Heuristic algorithms for the multiple knapsack problem. - Silvano Martello; Paolo Toth (Computing, 1981)

A Bound and Bound algorithm for the zero-one multiple knapsack problem. - Silvano Martello; Paolo Toth (Discret. Appl. Math., 1981)

Finding a minimum equivalent graph of a digraph. - Silvano Martello; Paolo Toth (Networks, 1982)

Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph. - Silvano Martello (ACM Trans. Math. Softw., 1983)

An Algorithm for the Bottleneck Traveling Salesman Problem. - Giorgio Carpaneto; Silvano Martello; Paolo Toth (Oper. Res., 1984)

Worst-case analysis of greedy algorithms for the subset-sum problem. - Silvano Martello; Paolo Toth (Math. Program., 1984)

Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. - Silvano Martello; Paolo Toth (ACM Trans. Math. Softw., 1985)

Most and least uniform spanning trees. - Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth (Discret. Appl. Math., 1986)

The Fixed Job Schedule Problem with Spread-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1987)

Worst-case analysis of the differencing method for the partition problem. - Matteo Fischetti; Silvano Martello (Math. Program., 1987)

The Fixed Job Schedule Problem with Working-Time Constraints. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1989)

The selective travelling salesman problem. - Gilbert Laporte; Silvano Martello (Discret. Appl. Math., 1990)

Lower bounds and reduction procedures for the bin packing problem. - Silvano Martello; Paolo Toth (Discret. Appl. Math., 1990)

An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. - Silvano Martello; François Soumis; Paolo Toth (IPCO, 1992)

Generalized Assignment Problems. - Silvano Martello; Paolo Toth (ISAAC, 1992)

Approximation Algorithms for Fixed Job Schedule Problems. - Matteo Fischetti; Silvano Martello; Paolo Toth (Oper. Res., 1992)

A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. - Silvano Martello; Paolo Toth (Inf. Process. Lett., 1992)

Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. - Jacek Blazewicz; Wieslaw Kubiak; Silvano Martello (Discret. Appl. Math., 1993)

The Delivery Man Problem and Cumulative Matroids. - Matteo Fischetti; Gilbert Laporte; Silvano Martello (Oper. Res., 1993)

A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. - Laureano F. Escudero; Silvano Martello; Paolo Toth (IPCO, 1995)

Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. - Mauro Dell'Amico; Silvano Martello; Daniele Vigo (Discret. Appl. Math., 1995)

Optimal Scheduling of Tasks on Identical Parallel Processors. - Mauro Dell'Amico; Silvano Martello (INFORMS J. Comput., 1995)

An exact algorithm for the dual bin packing problem. - Martine Labbé; Gilbert Laporte; Silvano Martello (Oper. Res. Lett., 1995)

Open shop, satellite communication and a theorem by Egerváry (1931). - Mauro Dell'Amico; Silvano Martello (Oper. Res. Lett., 1996)

The k-cardinality Assignment Problem. - Mauro Dell'Amico; Silvano Martello (Discret. Appl. Math., 1997)

Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. - Silvano Martello; François Soumis; Paolo Toth (Discret. Appl. Math., 1997)

Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems. - Silvano Martello; Paolo Toth (Oper. Res., 1997)

On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. - Laureano F. Escudero; Silvano Martello; Paolo Toth (Ann. Oper. Res., 1998)

Bin Packing Approximation Algorithms: Combinatorial Analysis. - Edward G. Coffman Jr.; Gábor Galambos; Silvano Martello; Daniele Vigo (Handbook of Combinatorial Optimization, 1999)

Approximation algorithms for the oriented two-dimensional bin packing problem. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (Eur. J. Oper. Res., 1999)

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (INFORMS J. Comput., 1999)

Reduction of the Three-Partition Problem. - Mauro Dell'Amico; Silvano Martello (J. Comb. Optim., 1999)

New trends in exact algorithms for the 0-1 knapsack problem. - Silvano Martello; David Pisinger; Paolo Toth (Eur. J. Oper. Res., 2000)

The Three-Dimensional Bin Packing Problem. - Silvano Martello; David Pisinger; Daniele Vigo (Oper. Res., 2000)

Editorial. - Roberto Battiti; Alan A. Bertossi; Silvano Martello (Discret. Appl. Math., 2001)

Efficient algorithms and codes for k-cardinality assignment problems. - Mauro Dell'Amico; Andrea Lodi 001; Silvano Martello (Discret. Appl. Math., 2001)

Preface. - Martine Labbé; Gilbert Laporte; Silvano Martello (Discret. Appl. Math., 2001)

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. - Matteo Fischetti; Andrea Lodi 001; Silvano Martello; Paolo Toth (Manag. Sci., 2001)

A lower bound for the non-oriented two-dimensional bin packing problem. - Mauro Dell'Amico; Silvano Martello; Daniele Vigo (Discret. Appl. Math., 2002)

Recent advances on two-dimensional bin packing problems. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (Discret. Appl. Math., 2002)

Graphs and Scheduling (ECCO XIII). - Gennaro Improta; Silvano Martello (Eur. J. Oper. Res., 2002)

Two-dimensional packing problems: A survey. - Andrea Lodi 001; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2002)

Heuristic algorithms for the three-dimensional bin packing problem. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (Eur. J. Oper. Res., 2002)

Graphs and Scheduling (ECCO XII). - Silvano Martello; Jean François Maurras (Eur. J. Oper. Res., 2002)

4OR for what purpose? - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2003)

Upper bounds and algorithms for the maximum cardinality bin packing problem. - Martine Labbé; Gilbert Laporte; Silvano Martello (Eur. J. Oper. Res., 2003)

An Exact Approach to the Strip-Packing Problem. - Silvano Martello; Michele Monaci; Daniele Vigo (INFORMS J. Comput., 2003)

An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem. - Silvano Martello; Paolo Toth (Oper. Res., 2003)

Stefano Pallottino (1945-2004). - Silvano Martello (4OR, 2004)

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (Ann. Oper. Res., 2004)

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello (J. Heuristics, 2004)

Models and Bounds for Two-Dimensional Level Packing Problems. - Andrea Lodi 001; Silvano Martello; Daniele Vigo (J. Comb. Optim., 2004)

Acknowledgement to referees. - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2005)

A note on exact algorithms for the identical parallel machine scheduling problem. - Mauro Dell'Amico; Silvano Martello (Eur. J. Oper. Res., 2005)

Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV). - Luca Maria Gambardella; Silvano Martello (Eur. J. Oper. Res., 2005)

Logistics: From theory to application (ECCO XIV). - Silvano Martello; Erwin Pesch (Eur. J. Oper. Res., 2005)

Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems. - Edgar den Boef; Jan H. M. Korst; Silvano Martello; David Pisinger; Daniele Vigo (Oper. Res., 2005)

4OR: Year 4. - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2006)

A case of plagiarism: Danut Marcu. - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2006)

Packing into the smallest square: Worst-case analysis of lower bounds. - Alberto Caprara; Andrea Lodi 001; Silvano Martello; Michele Monaci (Discret. Optim., 2006)

Lower bounds and heuristic algorithms for the k. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2006)

Rich models in discrete optimization: Formulation and resolution (ECCO XVI). - Geir Hasle; Arne Løkketangen; Silvano Martello (Eur. J. Oper. Res., 2006)

A Tabu Search Algorithm for a Routing and Container Loading Problem. - Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello (Transp. Sci., 2006)

An optimization problem in the electricity market. - Alberto Borghetti; Andrea Lodi 001; Silvano Martello; Michele Martignani; Carlo Alberto Nucci; Alessandro Trebbi (4OR, 2007)

Eleven surveys in Operations Research. - Denis Bouyssou; Silvano Martello; Frank Plastria (Ann. Oper. Res., 2007)

Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. - Silvano Martello; David Pisinger; Daniele Vigo; Edgar den Boef; Jan H. M. Korst (ACM Trans. Math. Softw., 2007)

Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII). - Mikhail Y. Kovalyov; Silvano Martello (Eur. J. Oper. Res., 2008)

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (INFORMS J. Comput., 2008)

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. - Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello (Networks, 2008)

Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. - Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello (Networks, 2008)

Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems. - Manuel Iori; Silvano Martello (Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008)

Assignment Problems. - Rainer E. Burkard; Mauro Dell'Amico; Silvano Martello (SIAM, 2009)

No 7-year itch at 4OR. - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2009)

Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. - Denis Bouyssou; Silvano Martello; Frank Plastria (4OR, 2009)

Preface. - Denis Bouyssou; Silvano Martello; Frank Plastria (Ann. Oper. Res., 2010)

Eleven surveys in operations research: II. - Denis Bouyssou; Silvano Martello; Frank Plastria (Ann. Oper. Res., 2010)

Models and algorithms for fair layout optimization problems. - Albert Einstein Fernandes Muritiba; Manuel Iori; Silvano Martello; Marcos José Negreiros Gomes (Ann. Oper. Res., 2010)

Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. - Silvano Martello (Central Eur. J. Oper. Res., 2010)

An aggregate label setting policy for the multi-objective shortest path problem. - Manuel Iori; Silvano Martello; Daniele Pretolani (Eur. J. Oper. Res., 2010)

Piecewise linear approximation of functions of two variables in MILP models. - Claudia D'Ambrosio; Andrea Lodi 001; Silvano Martello (Oper. Res. Lett., 2010)

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. - Claudio Cicconetti; Luciano Lenzini; Andrea Lodi 001; Silvano Martello; Enzo Mingozzi; Michele Monaci (Comput. Networks, 2011)

Developments in combinatorial optimization (ECCO-XX): Guest editorial. - Silvano Martello; Hercules Vladimirou (Comput. Optim. Appl., 2011)

Heuristic algorithms for the general nonlinear separable knapsack problem. - Claudia D'Ambrosio; Silvano Martello (Comput. Oper. Res., 2011)

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. - Andrea Lodi 001; Silvano Martello; Michele Monaci; Claudio Cicconetti; Luciano Lenzini; Enzo Mingozzi; Carl Eklund; Jani Moilanen (Manag. Sci., 2011)

Combinatorial optimization issues in scheduling. - Jacek Blazewicz; Valter Boljuncic; Silvano Martello; Jadranka Skorin-Kapov (J. Sched., 2011)

No end of the world in 2012 for 4OR. - Leo Liberti; Thierry Marchant; Silvano Martello (4OR, 2012)

A look at the past and present of optimization - An editorial. - Silvano Martello; José M. P. Paixão (Eur. J. Oper. Res., 2012)

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (J. Heuristics, 2012)

Complexity and approximation of an area packing problem. - Cor A. J. Hurkens; Andrea Lodi 001; Silvano Martello; Michele Monaci; Gerhard J. Woeginger (Optim. Lett., 2012)

An overview of computational issues in combinatorial optimization. - Laureano F. Escudero; Silvano Martello; Vitaly A. Strusevich (Ann. Oper. Res., 2013)

Preface. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2013)

Eleven surveys in operations research: III. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2013)

Algorithms for the min-max regret generalized assignment problem with interval data. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (IEEM, 2014)

Optimistic MILP modeling of non-linear optimization problems. - Riccardo Rovatti; Claudia D'Ambrosio; Andrea Lodi 001; Silvano Martello (Eur. J. Oper. Res., 2014)

Graphsj 3: a Modern Didactic Application for Graph Algorithms. - Gianluca Costa; Claudia D'Ambrosio; Silvano Martello (J. Comput. Sci., 2014)

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA. - Claudio Cicconetti; Luciano Lenzini; Andrea Lodi 001; Silvano Martello; Enzo Mingozzi; Michele Monaci (IEEE/ACM Trans. Netw., 2014)

The dirty dozen of 4OR. - Leo Liberti; Thierry Marchant; Silvano Martello (4OR, 2015)

Models and algorithms for packing rectangles into the smallest square. - Silvano Martello; Michele Monaci (Comput. Oper. Res., 2015)

Advances in Combinatorial Optimization. - Silvano Martello; Bernard Ries (Discret. Appl. Math., 2015)

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. - Fabio Furini; Manuel Iori; Silvano Martello; Mutsunori Yagiura (INFORMS J. Comput., 2015)

Decision Making under Uncertainty in Electricity Markets. - Silvano Martello (J. Oper. Res. Soc., 2015)

A brand new cheating attempt: a case of usurped identity. - Yves Crama; Michel Grabisch; Silvano Martello (4OR, 2016)

Twelve surveys in operations research. - Leo Liberti; Thierry Marchant; Silvano Martello (Ann. Oper. Res., 2016)

Heuristics for the General Multiple Non-linear Knapsack Problem. - Luca Mencarelli; Claudia D'Ambrosio; Angelo Di Zio; Silvano Martello (Electron. Notes Discret. Math., 2016)

Bin packing and cutting stock problems: Mathematical models and exact algorithms. - Maxence Delorme; Manuel Iori; Silvano Martello (Eur. J. Oper. Res., 2016)

Training software for orthogonal packing problems. - Gianluca Costa; Maxence Delorme; Manuel Iori; Enrico Malaguti; Silvano Martello (Comput. Ind. Eng., 2017)

Logic based Benders' decomposition for orthogonal stock cutting problems. - Maxence Delorme; Manuel Iori; Silvano Martello (Comput. Oper. Res., 2017)

Combinatorial optimization: theory, computation, and applications. - Bo Chen 002; Peter Gritzmann; Silvano Martello (Discret. Appl. Math., 2017)

Sweet sixteen. - Yves Crama; Michel Grabisch; Silvano Martello (4OR, 2018)

Preface. - Yves Crama; Michel Grabisch; Silvano Martello (Ann. Oper. Res., 2018)

Surveys in operations research. - Yves Crama; Michel Grabisch; Silvano Martello (Ann. Oper. Res., 2018)

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (Comput. Ind. Eng., 2018)

Relaxations and heuristics for the multiple non-linear separable knapsack problem. - Claudia D'Ambrosio; Silvano Martello; Luca Mencarelli (Comput. Oper. Res., 2018)

Computational advances in combinatorial optimization. - Tibor Jordán; Tamás Kis; Silvano Martello (Discret. Appl. Math., 2018)

BPPLIB: a library for bin packing and cutting stock problems. - Maxence Delorme; Manuel Iori; Silvano Martello (Optim. Lett., 2018)

Combinatorial Optimization: Between Practice and Theory. - Andrej Brodnik; Silvano Martello (Discret. Appl. Math., 2019)

Mathematical models and decomposition methods for the multiple knapsack problem. - Mauro Dell'Amico; Maxence Delorme; Manuel Iori; Silvano Martello (Eur. J. Oper. Res., 2019)

Lower and upper bounds for the non-linear generalized assignment problem. - Claudia D'Ambrosio; Silvano Martello; Michele Monaci (Comput. Oper. Res., 2020)

4OR comes of age. - Yves Crama; Michel Grabisch; Silvano Martello (4OR, 2021)

New progress in combinatorial optimization. - Bo Chen 002; Silvano Martello; Bernard Ries (Discret. Appl. Math., 2021)

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Eur. J. Oper. Res., 2021)

The assignment and loading transportation problem. - Gabriel Homsi; Jeremy Jordan; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2021)

Exact solution techniques for two-dimensional cutting and packing. - Manuel Iori; Vinícius Loti de Lima; Silvano Martello; Flávio Keidi Miyazawa; Michele Monaci (Eur. J. Oper. Res., 2021)

Theory and applications in combinatorial optimization. - John Baptist Gauci; Silvano Martello (J. Comb. Optim., 2021)

Sixty-one surveys in operations research. - Yves Crama; Michel Grabisch; Silvano Martello (Ann. Oper. Res., 2022)

Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. - Valentina Cacchiani; Manuel Iori; Alberto Locatelli; Silvano Martello (Comput. Oper. Res., 2022)

Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. - Valentina Cacchiani; Manuel Iori; Alberto Locatelli; Silvano Martello (Comput. Oper. Res., 2022)

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (INFORMS J. Comput., 2022)

2DPackLib: a two-dimensional cutting and packing library. - Manuel Iori; Vinícius Loti de Lima; Silvano Martello; Michele Monaci (Optim. Lett., 2022)

Emerging applications, models and algorithms in combinatorial optimization. - Antonio Alonso-Ayuso; Laureano F. Escudero; Silvano Martello (Discret. Appl. Math., 2023)

Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Discret. Appl. Math., 2023)

21 volumes for the 21st century. - Yves Crama; Michel Grabisch; Silvano Martello (4OR, 2024)

Operational Research: methods and applications. - 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; et al. (J. Oper. Res. Soc., 2024)

Still more surveys in operations research... - Yves Crama; Michel Grabisch; Silvano Martello (Ann. Oper. Res., 2024)

The quadratic knapsack problem with setup. - Laura Galli; Silvano Martello; Carlos Rodrigo Rey Barra 001; Paolo Toth (Comput. Oper. Res., 2025)

The quadratic knapsack problem. - Laura Galli; Silvano Martello; Paolo Toth (Eur. J. Oper. Res., 2025)

New Challenges in Combinatorial Optimization. - Bo Chen 002; Alexander S. Kulikov; Silvano Martello (J. Comb. Optim., 2025)