default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgio Gallo
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j25]Valentina Bartolucci, Giorgio Gallo:
Operations research/management science contributions to peace studies. Int. Trans. Oper. Res. 17(4): 475-483 (2010)
2000 – 2009
- 2008
- [j24]Giorgio Gallo
, Maria Grazia Scutellà:
Foreword. Networks 51(1): 1-3 (2008) - 2007
- [j23]Jean-Pierre Brans, Giorgio Gallo:
Ethics in OR/MS: past, present and future. Ann. Oper. Res. 153(1): 165-178 (2007) - 2004
- [j22]Jean-Pierre Brans, Giorgio Gallo:
Ethics in OR/MS: Past, present and future. 4OR 2(2): 95-110 (2004) - [j21]Giorgio Gallo:
Operations research and ethics: Responsibility, sharing and cooperation. Eur. J. Oper. Res. 153(2): 468-476 (2004) - [j20]Paola Cappanera, Giorgio Gallo:
A Multicommodity Flow Approach to the Crew Rostering Problem. Oper. Res. 52(4): 583-596 (2004) - 2003
- [j19]Paola Cappanera, Giorgio Gallo, Francesco Maffioli:
Discrete facility location and routing of obnoxious activities. Discret. Appl. Math. 133(1-3): 3-28 (2003) - 2002
- [j18]Giorgio Gallo, Maria Grazia Scutellà:
A note on minimum makespan assembly plans. Eur. J. Oper. Res. 142(2): 309-320 (2002) - 2001
- [j17]Giorgio Gallo, Federico Di Miele:
Dispatching Buses in Parking Depots. Transp. Sci. 35(3): 322-330 (2001)
1990 – 1999
- 1999
- [j16]Antonio Frangioni, Giorgio Gallo:
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems. INFORMS J. Comput. 11(4): 370-393 (1999) - 1998
- [j15]Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago:
Max Horn SAT and the minimum cut problem in directed hypergraphs. Math. Program. 80: 213-237 (1998) - 1997
- [j14]Giorgio Gallo, Fulvio Piccinonno:
b9000A 1/4 Approximate Algorithm for P2/tree/Cmax. Discret. Appl. Math. 72(1-2): 85-98 (1997) - [j13]Riccardo Cambini, Giorgio Gallo, Maria Grazia Scutellà:
Flows on hypergraphs. Math. Program. 77: 195-217 (1997) - 1995
- [j12]Giorgio Gallo, Daniele Pretolani:
A New Algorithm for the Propositional Satisfiability Problem. Discret. Appl. Math. 60(1-3): 159-179 (1995) - 1993
- [j11]Paolo Carraresi, Giorgio Gallo, Gabriella Rago:
A Hypergraph model for Constraint Logic Programming and Applications to Bus Drivers' Scheduling. Ann. Math. Artif. Intell. 8(3-4): 247-270 (1993) - [j10]Giorgio Gallo, Giustino Longo, Stefano Pallottino:
Directed Hypergraphs and Applications. Discret. Appl. Math. 42(2): 177-201 (1993) - [j9]Giorgio Gallo, Maria Grazia Scutellà:
Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations. INFORMS J. Comput. 5(2): 120-133 (1993)
1980 – 1989
- 1989
- [j8]Giorgio Gallo, Giampaolo Urbani:
Algorithms for Testing the Satisfiability of Propositional Formulae. J. Log. Program. 7(1): 45-61 (1989) - [j7]Giorgio Gallo, Bruno Simeone:
On the supermodular knapsack problem. Math. Program. 45(1-3): 295-309 (1989) - [j6]Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan:
A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18(1): 30-55 (1989) - 1988
- [j5]Giorgio Gallo, Maria Grazia Scutellà:
Polynomially Solvable Satisfiability Problems. Inf. Process. Lett. 29(5): 221-227 (1988) - 1987
- [j4]Alan A. Bertossi, Paolo Carraresi, Giorgio Gallo:
On some matching problems arising in vehicle scheduling models. Networks 17(3): 271-281 (1987) - 1986
- [j3]Giorgio Gallo, Francesco Maffioli:
Preface. Discret. Appl. Math. 14(2): 109-110 (1986) - 1982
- [j2]Giorgio Gallo, Stefano Pallottino:
A new algorithm to find the shortest paths between all pairs of nodes. Discret. Appl. Math. 4(1): 23-35 (1982)
1970 – 1979
- 1977
- [j1]Giorgio Gallo, Aydin Ülkücü:
Bilinear programming: An exact algorithm. Math. Program. 12(1): 173-194 (1977)
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-04-25 05:58 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:
