FISCHETTI, MATTEO

FISCHETTI, MATTEO  

Dipartimento di Ingegneria dell'Informazione - DEI  

Mostra records
Risultati 1 - 20 di 172 (tempo di esecuzione: 0.024 secondi).
Titolo Data di pubblicazione Autori Rivista Serie Titolo libro
Worst-case analysis of an approximation scheme for the subset-sum problem 1986 FISCHETTI, MATTEO OPERATIONS RESEARCH LETTERS - -
FIXED JOB SCHEDULE PROBLEM WITH SPREAD-TIME CONSTRAINTS 1987 Fischetti Matteo + OPERATIONS RESEARCH - -
The fixed job schedule problem with spread-time constraints 1987 FISCHETTI, MATTEO + OPERATIONS RESEARCH - -
Worst-case analysis of the differencing method for the partition problem 1987 FISCHETTI, MATTEO + MATHEMATICAL PROGRAMMING - -
A new dominance procedure for combinatorial optimization problems 1988 FISCHETTI, MATTEO + OPERATIONS RESEARCH LETTERS - -
A hybrid algorithm for finding the kth smallest ofn elements in O (n) time 1988 FISCHETTI, MATTEO + ANNALS OF OPERATIONS RESEARCH - -
Fixed job schedule problem with working-time constraints 1989 Fischetti Matteo + OPERATIONS RESEARCH - -
Additive bounding procedure for combinatorial optimization problems 1989 Fischetti Matteo + OPERATIONS RESEARCH - -
An additive bounding procedure for combinatorial optimization problems 1989 FISCHETTI, MATTEO + OPERATIONS RESEARCH - -
The fixed job schedule problem with working-time constraints 1989 FISCHETTI, MATTEO + OPERATIONS RESEARCH - -
A branch and bound algorithm for the multiple depot vehicle scheduling problem 1989 FISCHETTI, MATTEO + NETWORKS - -
New lower bounds for the symmetric travelling salesman problem 1989 FISCHETTI, MATTEO + MATHEMATICAL PROGRAMMING - -
A new linear storage, polynomial-time approximation scheme for the subset-sum problem 1990 FISCHETTI, MATTEO DISCRETE APPLIED MATHEMATICS - -
Facets of the asymmetric traveling salesman polytope 1991 FISCHETTI, MATTEO MATHEMATICS OF OPERATIONS RESEARCH - -
Facets of two Steiner arborescence polyhedra 1991 FISCHETTI, MATTEO MATHEMATICAL PROGRAMMING - -
An additive bounding procedure for the asymmetric travelling salesman problem 1992 FISCHETTI, MATTEO + MATHEMATICAL PROGRAMMING - -
Approximation algorithms for fixed job schedule problems 1992 FISCHETTI, MATTEO + OPERATIONS RESEARCH - -
The fixed-outdegree 1-arborescence polytope 1992 FISCHETTI, MATTEO + MATHEMATICS OF OPERATIONS RESEARCH - -
Heuristic algorithms for the multiple depot vehicle scheduling problem 1993 FISCHETTI, MATTEO + MANAGEMENT SCIENCE - -
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets 1993 FISCHETTI, MATTEO + MATHEMATICAL PROGRAMMING - -