Silvano Martello

145 papers A* 1B 3Journal 137Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Recent advances in combinatorial optimization.
J. Comb. Optim.
Silvano Martello, Nikolaos F. Matsatsinis
2025 J jnl
New Challenges in Combinatorial Optimization.
J. Comb. Optim.
Bo Chen, Alexander S. Kulikov, Silvano Martello
2025 J jnl
The quadratic knapsack problem with setup.
Comput. Oper. Res.
Laura Galli, Silvano Martello, Carlos Rodrigo Rey Barra, Paolo Toth
2025 J jnl
The quadratic knapsack problem.
Eur. J. Oper. Res.
Laura Galli, Silvano Martello, Paolo Toth
2024 J jnl
21 volumes for the 21st century.
4OR
Yves Crama, Michel Grabisch, Silvano Martello
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
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
2024 J jnl
Still more surveys in operations research...
Ann. Oper. Res.
Yves Crama, Michel Grabisch, Silvano Martello
2023 J jnl
Emerging applications, models and algorithms in combinatorial optimization.
Discret. Appl. Math.
Antonio Alonso-Ayuso, Laureano F. Escudero, Silvano Martello
2023 J jnl
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem.
Discret. Appl. Math.
Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth
2022 J jnl
2DPackLib: a two-dimensional cutting and packing library.
Optim. Lett.
Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci
2022 J jnl
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion.
INFORMS J. Comput.
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
2022 J jnl
Knapsack problems - An overview of recent advances. Part I: Single knapsack problems.
Comput. Oper. Res.
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello
2022 J jnl
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems.
Comput. Oper. Res.
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello
2022 J jnl
Preface.
Ann. Oper. Res.
Yves Crama, Michel Grabisch, Silvano Martello
2022 J jnl
Sixty-one surveys in operations research.
Ann. Oper. Res.
Yves Crama, Michel Grabisch, Silvano Martello
2021 J jnl
4OR comes of age.
4OR
Yves Crama, Michel Grabisch, Silvano Martello
2021 J jnl
Exact solution techniques for two-dimensional cutting and packing.
Eur. J. Oper. Res.
Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Flávio Keidi Miyazawa, Michele Monaci
2021 J jnl
New progress in combinatorial optimization.
Discret. Appl. Math.
Bo Chen, Silvano Martello, Bernard Ries
2021 J jnl
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Eur. J. Oper. Res.
Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth
2021 J jnl
The assignment and loading transportation problem.
Eur. J. Oper. Res.
Gabriel Homsi, Jeremy Jordan, Silvano Martello, Michele Monaci
2021 J jnl
Theory and applications in combinatorial optimization.
J. Comb. Optim.
John Baptist Gauci, Silvano Martello
2020 J jnl
Lower and upper bounds for the non-linear generalized assignment problem.
Comput. Oper. Res.
Claudia D'Ambrosio, Silvano Martello, Michele Monaci
2019 J jnl
Combinatorial Optimization: Between Practice and Theory.
Discret. Appl. Math.
Andrej Brodnik, Silvano Martello
2019 J jnl
Mathematical models and decomposition methods for the multiple knapsack problem.
Eur. J. Oper. Res.
Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello
2018 J jnl
BPPLIB: a library for bin packing and cutting stock problems.
Optim. Lett.
Maxence Delorme, Manuel Iori, Silvano Martello
2018 J jnl
Computational advances in combinatorial optimization.
Discret. Appl. Math.
Tibor Jordán, Tamás Kis, Silvano Martello
2018 J jnl
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.
Comput. Ind. Eng.
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
2018 J jnl
Preface.
Ann. Oper. Res.
Yves Crama, Michel Grabisch, Silvano Martello
2018 J jnl
Relaxations and heuristics for the multiple non-linear separable knapsack problem.
Comput. Oper. Res.
Claudia D'Ambrosio, Silvano Martello, Luca Mencarelli
2018 J jnl
Surveys in operations research.
Ann. Oper. Res.
Yves Crama, Michel Grabisch, Silvano Martello
2018 J jnl
Sweet sixteen.
4OR
Yves Crama, Michel Grabisch, Silvano Martello
2017 J jnl
Combinatorial optimization: theory, computation, and applications.
Discret. Appl. Math.
Bo Chen, Peter Gritzmann, Silvano Martello
2017 J jnl
Logic based Benders' decomposition for orthogonal stock cutting problems.
Comput. Oper. Res.
Maxence Delorme, Manuel Iori, Silvano Martello
2017 J jnl
Training software for orthogonal packing problems.
Comput. Ind. Eng.
Gianluca Costa, Maxence Delorme, Manuel Iori, Enrico Malaguti, Silvano Martello
2016 J jnl
A brand new cheating attempt: a case of usurped identity.
4OR
Yves Crama, Michel Grabisch, Silvano Martello
2016 J jnl
Bin packing and cutting stock problems: Mathematical models and exact algorithms.
Eur. J. Oper. Res.
Maxence Delorme, Manuel Iori, Silvano Martello
2016 J jnl
Heuristics for the General Multiple Non-linear Knapsack Problem.
Electron. Notes Discret. Math.
Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello
2016 J jnl
Preface.
Ann. Oper. Res.
Leo Liberti, Thierry Marchant, Silvano Martello
2016 J jnl
Twelve surveys in operations research.
Ann. Oper. Res.
Leo Liberti, Thierry Marchant, Silvano Martello
2015 J jnl
Advances in Combinatorial Optimization.
Discret. Appl. Math.
Silvano Martello, Bernard Ries
2015 J jnl
Decision Making under Uncertainty in Electricity Markets.
J. Oper. Res. Soc.
Silvano Martello
2015 J jnl
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem.
INFORMS J. Comput.
Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura
2015 J jnl
Models and algorithms for packing rectangles into the smallest square.
Comput. Oper. Res.
Silvano Martello, Michele Monaci
2015 J jnl
The dirty dozen of 4OR.
4OR
Leo Liberti, Thierry Marchant, Silvano Martello
2014 — conf
Algorithms for the min-max regret generalized assignment problem with interval data.
IEEM
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
2014 J jnl
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.
IEEE/ACM Trans. Netw.
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2014 J jnl
Graphsj 3: a Modern Didactic Application for Graph Algorithms.
J. Comput. Sci.
Gianluca Costa, Claudia D'Ambrosio, Silvano Martello
2014 J jnl
Optimistic MILP modeling of non-linear optimization problems.
Eur. J. Oper. Res.
Riccardo Rovatti, Claudia D'Ambrosio, Andrea Lodi, Silvano Martello
2013 J jnl
An overview of computational issues in combinatorial optimization.
Ann. Oper. Res.
Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich
2013 J jnl
Eleven surveys in operations research: III.
Ann. Oper. Res.
Leo Liberti, Thierry Marchant, Silvano Martello
2013 J jnl
Preface.
Ann. Oper. Res.
Leo Liberti, Thierry Marchant, Silvano Martello
2012 J jnl
A look at the past and present of optimization - An editorial.
Eur. J. Oper. Res.
Silvano Martello, José M. P. Paixão
2012 J jnl
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.
J. Heuristics
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2012 J jnl
Complexity and approximation of an area packing problem.
Optim. Lett.
Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger
2012 J jnl
No end of the world in 2012 for 4OR.
4OR
Leo Liberti, Thierry Marchant, Silvano Martello
2011 J jnl
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.
Comput. Networks
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2011 J jnl
Combinatorial optimization issues in scheduling.
J. Sched.
Jacek Blazewicz, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov
2011 J jnl
Developments in combinatorial optimization (ECCO-XX): Guest editorial.
Comput. Optim. Appl.
Silvano Martello, Hercules Vladimirou
2011 J jnl
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.
Manag. Sci.
Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen
2011 J jnl
Heuristic algorithms for the general nonlinear separable knapsack problem.
Comput. Oper. Res.
Claudia D'Ambrosio, Silvano Martello
2010 J jnl
An aggregate label setting policy for the multi-objective shortest path problem.
Eur. J. Oper. Res.
Manuel Iori, Silvano Martello, Daniele Pretolani
2010 A* conf
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA.
INFOCOM
Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci
2010 J jnl
Eleven surveys in operations research: II.
Ann. Oper. Res.
Denis Bouyssou, Silvano Martello, Frank Plastria
2010 J jnl
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication.
Central Eur. J. Oper. Res.
Silvano Martello
2010 J jnl
Models and algorithms for fair layout optimization problems.
Ann. Oper. Res.
Albert Einstein Fernandes Muritiba, Manuel Iori, Silvano Martello, Marcos José Negreiros Gomes
2010 J jnl
Piecewise linear approximation of functions of two variables in MILP models.
Oper. Res. Lett.
Claudia D'Ambrosio, Andrea Lodi, Silvano Martello
2010 J jnl
Preface.
Ann. Oper. Res.
Denis Bouyssou, Silvano Martello, Frank Plastria
2009 — book
Assignment Problems.
Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello
2009 J jnl
No 7-year itch at
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2009 J jnl
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu.
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2008 J jnl
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.
Networks
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2008 J jnl
Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII).
Eur. J. Oper. Res.
Mikhail Y. Kovalyov, Silvano Martello
2008 J jnl
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.
Networks
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2008 J jnl
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
INFORMS J. Comput.
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2008 — ch.
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems.
Metaheuristics for Scheduling in Industrial and Manufacturing Applications
Manuel Iori, Silvano Martello
2007 J jnl
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw.
Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst
2007 J jnl
An optimization problem in the electricity market.
4OR
Alberto Borghetti, Andrea Lodi, Silvano Martello, Michele Martignani, Carlo Alberto Nucci, Alessandro Trebbi
2007 J jnl
Eleven surveys in Operations Research.
Ann. Oper. Res.
Denis Bouyssou, Silvano Martello, Frank Plastria
2007 J jnl
Preface.
Ann. Oper. Res.
Denis Bouyssou, Silvano Martello, Frank Plastria
2006 J jnl
A Tabu Search Algorithm for a Routing and Container Loading Problem.
Transp. Sci.
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2006 J jnl
A case of plagiarism: Danut Marcu.
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2006 J jnl
Lower bounds and heuristic algorithms for the k.
Eur. J. Oper. Res.
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
2006 J jnl
Packing into the smallest square: Worst-case analysis of lower bounds.
Discret. Optim.
Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci
2006 J jnl
Rich models in discrete optimization: Formulation and resolution (ECCO XVI).
Eur. J. Oper. Res.
Geir Hasle, Arne Løkketangen, Silvano Martello
2005 J jnl
A note on exact algorithms for the identical parallel machine scheduling problem.
Eur. J. Oper. Res.
Mauro Dell'Amico, Silvano Martello
2005 J jnl
Acknowledgement to referees.
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2005 J jnl
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.
Oper. Res.
Edgar den Boef, Jan H. M. Korst, Silvano Martello, David Pisinger, Daniele Vigo
2005 J jnl
Logistics: From theory to application (ECCO XIV).
Eur. J. Oper. Res.
Silvano Martello, Erwin Pesch
2005 J jnl
Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV).
Eur. J. Oper. Res.
Luca Maria Gambardella, Silvano Martello
2004 J jnl
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||C
J. Heuristics
Mauro Dell'Amico, Manuel Iori, Silvano Martello
2004 J jnl
Models and Bounds for Two-Dimensional Level Packing Problems.
J. Comb. Optim.
Andrea Lodi, Silvano Martello, Daniele Vigo
2004 J jnl
Stefano Pallottino (1945-2004).
4OR
Silvano Martello
2004 J jnl
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.
Ann. Oper. Res.
Andrea Lodi, Silvano Martello, Daniele Vigo
2003 J jnl
4OR for what purpose?
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2003 J jnl
Acknowledgement to referees.
4OR
Denis Bouyssou, Silvano Martello, Frank Plastria
2003 J jnl
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.
Oper. Res.
Silvano Martello, Paolo Toth
2003 J jnl
An Exact Approach to the Strip-Packing Problem.
INFORMS J. Comput.
Silvano Martello, Michele Monaci, Daniele Vigo
2003 J jnl
Upper bounds and algorithms for the maximum cardinality bin packing problem.
Eur. J. Oper. Res.
Martine Labbé, Gilbert Laporte, Silvano Martello
2002 J jnl
A lower bound for the non-oriented two-dimensional bin packing problem.
Discret. Appl. Math.
Mauro Dell'Amico, Silvano Martello, Daniele Vigo
2002 J jnl
Graphs and Scheduling (ECCO XII).
Eur. J. Oper. Res.
Silvano Martello, Jean François Maurras
2002 J jnl
Graphs and Scheduling (ECCO XIII).
Eur. J. Oper. Res.
Gennaro Improta, Silvano Martello
2002 J jnl
Heuristic algorithms for the three-dimensional bin packing problem.
Eur. J. Oper. Res.
Andrea Lodi, Silvano Martello, Daniele Vigo
2002 J jnl
Recent advances on two-dimensional bin packing problems.
Discret. Appl. Math.
Andrea Lodi, Silvano Martello, Daniele Vigo
2002 J jnl
Two-dimensional packing problems: A survey.
Eur. J. Oper. Res.
Andrea Lodi, Silvano Martello, Michele Monaci
2001 J jnl
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.
Manag. Sci.
Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth
2001 J jnl
Editorial.
Discret. Appl. Math.
Roberto Battiti, Alan A. Bertossi, Silvano Martello
2001 J jnl
Efficient algorithms and codes for k-cardinality assignment problems.
Discret. Appl. Math.
Mauro Dell'Amico, Andrea Lodi, Silvano Martello
2001 J jnl
Preface.
Discret. Appl. Math.
Martine Labbé, Gilbert Laporte, Silvano Martello
2000 J jnl
New trends in exact algorithms for the 0-1 knapsack problem.
Eur. J. Oper. Res.
Silvano Martello, David Pisinger, Paolo Toth
2000 J jnl
The Three-Dimensional Bin Packing Problem.
Oper. Res.
Silvano Martello, David Pisinger, Daniele Vigo
1999 J jnl
Approximation algorithms for the oriented two-dimensional bin packing problem.
Eur. J. Oper. Res.
Andrea Lodi, Silvano Martello, Daniele Vigo
1999 — ch.
Bin Packing Approximation Algorithms: Combinatorial Analysis.
Handbook of Combinatorial Optimization
Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo
1999 J jnl
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.
INFORMS J. Comput.
Andrea Lodi, Silvano Martello, Daniele Vigo
1999 J jnl
Reduction of the Three-Partition Problem.
J. Comb. Optim.
Mauro Dell'Amico, Silvano Martello
1998 J jnl
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.
Ann. Oper. Res.
Laureano F. Escudero, Silvano Martello, Paolo Toth
1997 J jnl
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discret. Appl. Math.
Silvano Martello, François Soumis, Paolo Toth
1997 J jnl
The k-cardinality Assignment Problem.
Discret. Appl. Math.
Mauro Dell'Amico, Silvano Martello
1997 J jnl
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems.
Oper. Res.
Silvano Martello, Paolo Toth
1996 J jnl
Open shop, satellite communication and a theorem by Egerváry (1931).
Oper. Res. Lett.
Mauro Dell'Amico, Silvano Martello
1995 B conf
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.
IPCO
Laureano F. Escudero, Silvano Martello, Paolo Toth
1995 J jnl
An exact algorithm for the dual bin packing problem.
Oper. Res. Lett.
Martine Labbé, Gilbert Laporte, Silvano Martello
1995 J jnl
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
Discret. Appl. Math.
Mauro Dell'Amico, Silvano Martello, Daniele Vigo
1995 J jnl
Optimal Scheduling of Tasks on Identical Parallel Processors.
INFORMS J. Comput.
Mauro Dell'Amico, Silvano Martello
1993 J jnl
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints.
Discret. Appl. Math.
Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello
1993 J jnl
The Delivery Man Problem and Cumulative Matroids.
Oper. Res.
Matteo Fischetti, Gilbert Laporte, Silvano Martello
1992 J jnl
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem.
Inf. Process. Lett.
Silvano Martello, Paolo Toth
1992 B conf
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
IPCO
Silvano Martello, François Soumis, Paolo Toth
1992 J jnl
Approximation Algorithms for Fixed Job Schedule Problems.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1992 B conf
Generalized Assignment Problems.
ISAAC
Silvano Martello, Paolo Toth
1990 J jnl
Lower bounds and reduction procedures for the bin packing problem.
Discret. Appl. Math.
Silvano Martello, Paolo Toth
1990 J jnl
The selective travelling salesman problem.
Discret. Appl. Math.
Gilbert Laporte, Silvano Martello
1989 J jnl
The Fixed Job Schedule Problem with Working-Time Constraints.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1987 J jnl
The Fixed Job Schedule Problem with Spread-Time Constraints.
Oper. Res.
Matteo Fischetti, Silvano Martello, Paolo Toth
1987 J jnl
Worst-case analysis of the differencing method for the partition problem.
Math. Program.
Matteo Fischetti, Silvano Martello
1986 J jnl
Most and least uniform spanning trees.
Discret. Appl. Math.
Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth
1985 J jnl
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.
ACM Trans. Math. Softw.
Silvano Martello, Paolo Toth
1984 J jnl
An Algorithm for the Bottleneck Traveling Salesman Problem.
Oper. Res.
Giorgio Carpaneto, Silvano Martello, Paolo Toth
1984 J jnl
Worst-case analysis of greedy algorithms for the subset-sum problem.
Math. Program.
Silvano Martello, Paolo Toth
1983 J jnl
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph.
ACM Trans. Math. Softw.
Silvano Martello
1982 J jnl
Finding a minimum equivalent graph of a digraph.
Networks
Silvano Martello, Paolo Toth
1981 J jnl
A Bound and Bound algorithm for the zero-one multiple knapsack problem.
Discret. Appl. Math.
Silvano Martello, Paolo Toth
1981 J jnl
Heuristic algorithms for the multiple knapsack problem.
Computing
Silvano Martello, Paolo Toth
1980 J jnl
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems.
Oper. Res.
Silvano Martello, Paolo Toth
1979 J jnl
An algorithm for finding a minimal equivalent graph of a strongly connected digraph.
Computing
Silvano Martello
1978 J jnl
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem.
Computing
Silvano Martello, Paolo Toth