Giorgio Gallo

Orcid: 0000-0003-4818-7508

Affiliations:
  • University of Pisa, Italy


According to our database1, Giorgio Gallo authored at least 24 papers between 1977 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Operations research/management science contributions to peace studies.
Int. Trans. Oper. Res., 2010

2008
Foreword.
Networks, 2008

2004
A Multicommodity Flow Approach to the Crew Rostering Problem.
Oper. Res., 2004

Operations research and ethics: Responsibility, sharing and cooperation.
Eur. J. Oper. Res., 2004

Ethics in OR/MS: Past, present and future.
4OR, 2004

2003
Discrete facility location and routing of obnoxious activities.
Discret. Appl. Math., 2003

2002
A note on minimum makespan assembly plans.
Eur. J. Oper. Res., 2002

2001
Dispatching Buses in Parking Depots.
Transp. Sci., 2001

1999
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.
INFORMS J. Comput., 1999

1998
Max Horn SAT and the minimum cut problem in directed hypergraphs.
Math. Program., 1998

1997
Flows on hypergraphs.
Math. Program., 1997

b9000A 1/4 Approximate Algorithm for P2/tree/Cmax.
Discret. Appl. Math., 1997

1995
A New Algorithm for the Propositional Satisfiability Problem.
Discret. Appl. Math., 1995

1993
Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations.
INFORMS J. Comput., 1993

Directed Hypergraphs and Applications.
Discret. Appl. Math., 1993

A Hypergraph model for Constraint Logic Programming and Applications to Bus Drivers' Scheduling.
Ann. Math. Artif. Intell., 1993

1989
A Fast Parametric Maximum Flow Algorithm and Applications.
SIAM J. Comput., 1989

On the supermodular knapsack problem.
Math. Program., 1989

Algorithms for Testing the Satisfiability of Propositional Formulae.
J. Log. Program., 1989

1988
Polynomially Solvable Satisfiability Problems.
Inf. Process. Lett., 1988

1987
On some matching problems arising in vehicle scheduling models.
Networks, 1987

1986
Preface.
Discret. Appl. Math., 1986

1982
A new algorithm to find the shortest paths between all pairs of nodes.
Discret. Appl. Math., 1982

1977
Bilinear programming: An exact algorithm.
Math. Program., 1977


  Loading...