default search action
Matteo Fischetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j103]Martina Fischetti
, Matteo Fischetti
Safe distancing in the time of COVID-19. Eur. J. Oper. Res. 304(1): 139-149 (2023) - [j102]Martina Fischetti, Matteo Fischetti
Integrated Layout and Cable Routing in Wind Farm Optimal Design. Manag. Sci. 69(4): 2147-2164 (2023) - 2022
- [j101]Francesco Cavaliere
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem. Math. Program. Comput. 14(4): 749-779 (2022) - [c26]Defeng Liu, Matteo Fischetti, Andrea Lodi:
Learning to Search in Local Branching. AAAI 2022: 3796-3803 - 2021
- [c25]Matteo Fischetti
Embedding Simulated Annealing within Stochastic Gradient Descent. OLA 2021: 3-13 - [i5]Defeng Liu, Matteo Fischetti, Andrea Lodi:
Learning to Search in Local Branching. CoRR abs/2112.02195 (2021) - 2020
- [j100]Matteo Fischetti
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming. Eur. J. Oper. Res. 282(2): 506-514 (2020)
2010 – 2019
- 2019
- [j99]Matteo Fischetti
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31(2): 390-410 (2019) - [i4]Matteo Fischetti, Matteo Stringher:
Embedded hyper-parameter tuning by Simulated Annealing. CoRR abs/1906.01504 (2019) - [i3]Matteo Fischetti, Domenico Salvagnin:
Finding First and Most-Beautiful Queens by Integer Programming. CoRR abs/1907.08246 (2019) - 2018
- [j98]Matteo Fischetti
Deep neural networks and mixed integer linear optimization. Constraints An Int. J. 23(3): 296-309 (2018) - [j97]Matteo Fischetti
SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. 93: 101-112 (2018) - [j96]Matteo Fischetti
A dynamic reformulation heuristic for Generalized Interdiction Problems. Eur. J. Oper. Res. 267(1): 40-51 (2018) - [j95]Matteo Fischetti
Least cost influence propagation in (social) networks. Math. Program. 170(1): 293-325 (2018) - [j94]Matteo Fischetti
On the use of intersection cuts for bilevel optimization. Math. Program. 172(1-2): 77-103 (2018) - [c24]Matteo Fischetti, Domenico Salvagnin:
Chasing First Queens by Integer Programming. CPAIOR 2018: 232-244 - [r1]Martina Fischetti
Matheuristics. Handbook of Heuristics 2018: 121-153 - [i2]Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin:
Faster SGD training by minibatch persistency. CoRR abs/1806.07353 (2018) - 2017
- [j93]Matteo Fischetti, Leo Liberti
Orbital shrinking: Theory and applications. Discret. Appl. Math. 222: 109-123 (2017) - [j92]Matteo Fischetti, Michele Monaci
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. 263(1): 258-264 (2017) - [j91]Matteo Fischetti
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65(6): 1615-1637 (2017) - [j90]Matteo Fischetti, Ivana Ljubic
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63(7): 2146-2162 (2017) - [j89]Matteo Fischetti, Markus Leitner
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2): 203-229 (2017) - [i1]Matteo Fischetti, Jason Jo:
Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study. CoRR abs/1712.06174 (2017) - 2016
- [j88]Pietro Belotti
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - [j87]Matteo Fischetti:
Fast training of Support Vector Machines with Gaussian kernel. Discret. Optim. 22: 183-194 (2016) - [j86]Matteo Fischetti, Michele Monaci
Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. 22: 195-205 (2016) - [j85]Matteo Fischetti, Ivana Ljubic
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3): 557-569 (2016) - [j84]Natashia Boland
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22(2): 181-198 (2016) - [j83]Matteo Fischetti, Andrea Lodi, Michele Monaci
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1): 113-132 (2016) - [c23]Matteo Fischetti, Ivana Ljubic
Intersection Cuts for Bilevel Optimization. IPCO 2016: 77-88 - 2015
- [j82]Matteo Fischetti, Giorgio Sartor, Arrigo Zanette:
MIP-and-refine matheuristic for smart grid energy management. Int. Trans. Oper. Res. 22(1): 49-59 (2015) - 2014
- [j81]Matteo Fischetti, Michele Monaci
Proximity search for 0-1 mixed-integer convex programming. J. Heuristics 20(6): 709-731 (2014) - [j80]Matteo Fischetti, Michele Monaci
Exploiting Erraticism in Search. Oper. Res. 62(1): 114-122 (2014) - [j79]Natashia L. Boland
Boosting the feasibility pump. Math. Program. Comput. 6(3): 255-279 (2014) - [c22]Matteo Fischetti, Michele Monaci
Self-splitting of Workload in Parallel Computation. CPAIOR 2014: 394-404 - 2013
- [j78]Matteo Fischetti, Michele Monaci
Backdoor Branching. INFORMS J. Comput. 25(4): 693-700 (2013) - [j77]Matteo Fischetti, Domenico Salvagnin:
Approximating the Split Closure. INFORMS J. Comput. 25(4): 808-819 (2013) - 2012
- [j76]Matteo Fischetti, Michele Monaci
Three Ideas for the Quadratic Assignment Problem. Oper. Res. 60(4): 954-964 (2012) - [j75]Egon Balas, Matteo Fischetti, Arrigo Zanette:
A hard integer program made easy by lexicography. Math. Program. 135(1-2): 509-514 (2012) - [j74]Matteo Fischetti, Michele Monaci
Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3): 239-273 (2012) - [j73]Matteo Fischetti, Michele Monaci
Branching on nonchimerical fractionalities. Oper. Res. Lett. 40(3): 159-164 (2012) - [j72]Valentina Cacchiani
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transp. Sci. 46(1): 124-133 (2012) - [c21]Matteo Fischetti, Leo Liberti
Orbital Shrinking. ISCO 2012: 48-58 - 2011
- [j71]Matteo Fischetti, Andrea Lodi, Andrea Tramontani:
On the separation of disjunctive cuts. Math. Program. 128(1-2): 205-230 (2011) - [j70]Arrigo Zanette, Matteo Fischetti, Egon Balas:
Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1): 153-176 (2011) - [j69]Matteo Fischetti, Domenico Salvagnin:
A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. 3(2): 79-102 (2011) - [c20]Matteo Fischetti, Michele Monaci
Backdoor Branching. IPCO 2011: 183-191 - 2010
- [j68]Matteo Fischetti, Andrea Lodi:
On the knapsack closure of 0-1 Integer Linear Programs. Electron. Notes Discret. Math. 36: 799-804 (2010) - [j67]Matteo Fischetti, Domenico Salvagnin
Pruning Moves. INFORMS J. Comput. 22(1): 108-119 (2010) - [j66]Matteo Fischetti, Domenico Salvagnin
A note on the selection of Benders' cuts. Math. Program. 124(1-2): 175-182 (2010) - [j65]Egon Balas, Matteo Fischetti, Arrigo Zanette:
On the enumerative nature of Gomory's dual cutting plane method. Math. Program. 125(2): 325-351 (2010) - [c19]Matteo Fischetti:
Towards a MIP-Cut Metascheme. CPAIOR 2010: 1-2 - [c18]Matteo Fischetti, Domenico Salvagnin
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR 2010: 123-135 - [c17]Matteo Fischetti, Domenico Salvagnin
An In-Out Approach to Disjunctive Optimization. CPAIOR 2010: 136-140 - [p2]Matteo Fischetti, Andrea Lodi, Domenico Salvagnin:
Just MIP it! Matheuristics 2010: 39-70
2000 – 2009
- 2009
- [j64]Matteo Fischetti, Ivan Luzzi:
Mixed-integer programming models for nesting problems. J. Heuristics 15(3): 201-226 (2009) - [j63]Leo G. Kroon, Dennis Huisman, Erwin J. W. Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gábor Maróti, Alexander Schrijver, Adri Steenbeek, Roelof Ybema:
The New Dutch Timetable: The OR Revolution. Interfaces 39(1): 6-17 (2009) - [j62]Matteo Fischetti, Domenico Salvagnin:
Feasibility pump 2.0. Math. Program. Comput. 1(2-3): 201-222 (2009) - [j61]Matteo Fischetti, Domenico Salvagnin
Fast Approaches to Improve the Robustness of a Railway Timetable. Transp. Sci. 43(3): 321-335 (2009) - [c16]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti:
Robustness in Train Timetabling. CTW 2009: 171-174 - [p1]Matteo Fischetti, Michele Monaci
Light Robustness. Robust and Online Large-Scale Optimization 2009: 61-84 - 2008
- [j60]Matteo Fischetti, Andrea Lodi:
Repairing MIP infeasibility through local branching. Comput. Oper. Res. 35(5): 1436-1445 (2008) - [j59]Matteo Fischetti, Michele Monaci
How tight is the corner relaxation? Discret. Optim. 5(2): 262-269 (2008) - [j58]Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti:
The Linear Ordering Problem with cumulative costs. Eur. J. Oper. Res. 189(3): 1345-1357 (2008) - [j57]Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:
Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008) - [c15]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008 - [c14]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008 - [c13]Arrigo Zanette, Matteo Fischetti, Egon Balas:
Can Pure Cutting Plane Algorithms Work?. IPCO 2008: 416-434 - [e2]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008. OASIcs 9, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [j56]Livio Bertacco, Matteo Fischetti, Andrea Lodi:
A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4(1): 63-76 (2007) - [j55]Matteo Fischetti, Andrea Lodi:
MIPping Closures: An Instant Survey. Graphs Comb. 23(Supplement-1): 233-243 (2007) - [j54]Giuseppe Andreello, Alberto Caprara, Matteo Fischetti:
Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS J. Comput. 19(2): 229-238 (2007) - [j53]Matteo Fischetti, Cristiano Saturni:
Mixed-Integer Cuts from Cyclic Groups. Math. Program. 109(1): 27-53 (2007) - [j52]Matteo Fischetti, Andrea Lodi:
Optimizing over the first Chvátal closure. Math. Program. 110(1): 3-20 (2007) - [c12]Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin:
Fast Approaches to Robust Railway Timetabling. ATMOS 2007 - [e1]Matteo Fischetti, David P. Williamson:
Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings. Lecture Notes in Computer Science 4513, Springer 2007, ISBN 978-3-540-72791-0 [contents] - 2006
- [j51]Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3(1): 3-19 (2006) - [j50]Gianni Codato, Matteo Fischetti:
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Oper. Res. 54(4): 756-766 (2006) - [j49]Ivana Ljubic
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) - [j48]Roberto De Franceschi, Matteo Fischetti, Paolo Toth:
A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. 105(2-3): 471-499 (2006) - 2005
- [j47]Erwin J. W. Abbink, Matteo Fischetti, Leo G. Kroon, Gerrit Timmer, Michiel J. C. M. Vromans:
Reinventing Crew Scheduling at Netherlands Railways. Interfaces 35(5): 393-401 (2005) - [j46]Matteo Fischetti, Fred W. Glover
The feasibility pump. Math. Program. 104(1): 91-104 (2005) - [c11]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 - [c10]Matteo Fischetti, Cristiano Saturni:
Mixed-Integer Cuts from Cyclic Groups. IPCO 2005: 1-11 - [c9]Matteo Fischetti, Andrea Lodi:
Optimizing over the First Chvàtal Closure. IPCO 2005: 12-22 - 2004
- [j45]Matteo Fischetti, Carlo Polo, Massimo Scantamburlo:
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2): 61-72 (2004) - [c8]Gianni Codato, Matteo Fischetti:
Combinatorial Benders' Cuts. IPCO 2004: 178-195 - 2003
- [j44]Matteo Fischetti, Giorgio Romanin-Jacur, Juan José Salazar González
Optimisation of the interconnecting network of a UMTS radio mobile telephone system. Eur. J. Oper. Res. 144(1): 56-67 (2003) - [j43]Matteo Fischetti, Andrea Lodi:
Local branching. Math. Program. 98(1-3): 23-47 (2003) - [j42]Matteo Fischetti, Juan José Salazar González
Partial cell suppression: A new methodology for statistical disclosure control. Stat. Comput. 13(1): 13-21 (2003) - 2002
- [j41]Alberto Caprara, Matteo Fischetti, Paolo Toth:
Modeling and Solving the Train Timetabling Problem. Oper. Res. 50(5): 851-861 (2002) - [j40]Matteo Fischetti, Giuseppe Lancia
Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002) - 2001
- [j39]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) - [j38]Matteo Fischetti, Juan José Salazar
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. Manag. Sci. 47(7): 1008-1027 (2001) - [j37]Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. Math. Program. 90(3): 475-506 (2001) - [c7]Matteo Fischetti, Andrea Lodi, Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77 - [c6]Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci
Solution of Real-World Train Timetabling Problems. HICSS 2001 - 2000
- [j36]Alberto Caprara, Paolo Toth, Matteo Fischetti:
Algorithms for the Set Covering Problem. Ann. Oper. Res. 98(1-4): 353-371 (2000) - [j35]Lorenzo Brunetta, Michele Conforti, Matteo Fischetti:
A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. 101(1-3): 13-36 (2000) - [j34]Matteo Fischetti, Chiara Lepschy, Giuseppe Minerva, Giorgio Romanin-Jacur, Ema Toto:
Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. 123(2): 241-255 (2000) - [j33]Alberto Caprara, Matteo Fischetti, Adam N. Letchford
On the separation of maximally violated mod- k cuts. Math. Program. 87(1): 37-56 (2000) - [j32]Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2): 69-79 (2000) - [c5]Leo G. Kroon, Matteo Fischetti:
Scheduling Train Drivers and Guards: The Dutch "Noord-Oost" Case. HICSS 2000
1990 – 1999
- 1999
- [j31]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Method for the Set Covering Problem. Oper. Res. 47(5): 730-743 (1999) - [j30]Egon Balas, Matteo Fischetti:
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 24(2): 273-292 (1999) - [j29]Matteo Fischetti, Juan José Salazar
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Program. 84(2): 283-312 (1999) - [c4]Alberto Caprara, Matteo Fischetti, Adam N. Letchford
On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98 - 1998
- [j28]Matteo Fischetti, Juan José Salazar González
Solving the Orienteering Problem through Branch-and-Cut. INFORMS J. Comput. 10(2): 133-148 (1998) - [j27]Alberto Caprara, Paolo Toth, Daniele Vigo, Matteo Fischetti:
Modeling and Solving the Crew Rostering Problem. Oper. Res. 46(6): 820-830 (1998) - 1997
- [j26]Matteo Fischetti, Juan José Salazar González
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Oper. Res. 45(3): 378-394 (1997) - [j25]Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. Math. Program. 77: 59-84 (1997) - [j24]Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo
Algorithms for railway crew management. Math. Program. 79: 125-141 (1997) - [j23]Matteo Fischetti, Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Networks 29(1): 55-67 (1997) - 1996
- [j22]Alberto Caprara, Matteo Fischetti:
{0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74: 221-235 (1996) - [c3]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84 - 1995
- [j21]Matteo Fischetti:
Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. Discret. Appl. Math. 56(1): 9-18 (1995) - [j20]Egon Balas, Matteo Fischetti, William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995) - [j19]Matteo Fischetti, Juan José Salazar González
The symmetric generalized traveling salesman polytope. Networks 26(2): 113-123 (1995) - [j18]Alberto Caprara, Matteo Fischetti, Dario Maio:
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. IEEE Trans. Knowl. Data Eng. 7(6): 955-967 (1995) - 1994
- [j17]Matteo Fischetti, Paolo Toth, Daniele Vigo:
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Oper. Res. 42(5): 846-859 (1994) - [j16]Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli:
Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24(1): 11-21 (1994) - 1993
- [j15]Matteo Fischetti, Paolo Toth:
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. INFORMS J. Comput. 5(4): 426-434 (1993) - [j14]Matteo Fischetti, Gilbert Laporte, Silvano Martello:
The Delivery Man Problem and Cumulative Matroids. Oper. Res. 41(6): 1055-1064 (1993) - [j13]Egon Balas, Matteo Fischetti:
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Program. 58: 325-352 (1993) - [c2]Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. IPCO 1993: 23-38 - 1992
- [j12]Matteo Fischetti, Silvano Martello, Paolo Toth:
Approximation Algorithms for Fixed Job Schedule Problems. Oper. Res. 40(Supplement-1): S96-S108 (1992) - [j11]Egon Balas, Matteo Fischetti:
The Fixed-Outdegree 1-Arborescence Polytope. Math. Oper. Res. 17(4): 1001-1018 (1992) - [j10]Matteo Fischetti, Paolo Toth:
An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. 53: 173-197 (1992) - [c1]Matteo Fischetti:
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. IPCO 1992: 260-273 - 1991
- [j9]Matteo Fischetti:
Facets of the Asymmetric Traveling Salesman Polytope. Math. Oper. Res. 16(1): 42-56 (1991) - [j8]Matteo Fischetti:
Facts of two Steiner arborescence polyhedra. Math. Program. 51: 401-419 (1991) - 1990
- [j7]Matteo Fischetti:
A new linear storage, polynomial-time approximation scheme for the subset-sum problem. Discret. Appl. Math. 26(1): 61-77 (1990)
1980 – 1989
- 1989
- [j6]Matteo Fischetti, Paolo Toth:
An Additive Bounding Procedure for Combinatorial Optimization Problems. Oper. Res. 37(2): 319-328 (1989) - [j5]Matteo Fischetti, Silvano Martello, Paolo Toth:
The Fixed Job Schedule Problem with Working-Time Constraints. Oper. Res. 37(3): 395-403 (1989) - [j4]Giorgio Carpaneto, Matteo Fischetti, Paolo Toth:
New lower bounds for the Symmetric Travelling Salesman Problem. Math. Program. 45(1-3): 233-254 (1989) - [j3]Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth:
A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5): 531-548 (1989) - 1987
- [j2]Matteo Fischetti, Silvano Martello, Paolo Toth:
The Fixed Job Schedule Problem with Spread-Time Constraints. Oper. Res. 35(6): 849-858 (1987) - [j1]Matteo Fischetti, Silvano Martello:
Worst-case analysis of the differencing method for the partition problem. Math. Program. 37(1): 117-120 (1987)
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-08-22 19:44 CEST 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: