Giorgio Gallo

From MaRDI portal
(Redirected from Person:242826)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A Multicommodity Flow Approach to the Crew Rostering Problem
Operations Research
2009-07-14Paper
Ethics in OR/MS: Past, present and future
Annals of Operations Research
2008-03-31Paper
Ethics in OR/MS: past, present and future
4OR
2004-10-28Paper
Operations research and ethics: responsibility, sharing and cooperation.
European Journal of Operational Research
2004-01-05Paper
Discrete facility location and routing of obnoxious activities.
Discrete Applied Mathematics
2004-01-05Paper
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
INFORMS Journal on Computing
2003-11-06Paper
A note on minimum makespan assembly plans
European Journal of Operational Research
2002-11-20Paper
Dispatching Buses in Parking Depots
Transportation Science
2001-01-01Paper
A combined transportation and scheduling problem
European Journal of Operational Research
1999-10-28Paper
Max Horn SAT and the minimum cut problem in directed hypergraphs
Mathematical Programming. Series A. Series B
1998-03-11Paper
Flows on hypergraphs
Mathematical Programming. Series A. Series B
1997-11-25Paper
A hypergraph model for constraint logic programming and applications to bus drivers' scheduling
Annals of Mathematics and Artificial Intelligence
1997-05-12Paper
b9000A 1/4 approximate algorithm for P2/tree/Cmax
Discrete Applied Mathematics
1997-02-25Paper
scientific article; zbMATH DE number 915569 (Why is no real title available?)1996-08-11Paper
A new algorithm for the propositional satisfiability problem
Discrete Applied Mathematics
1995-09-06Paper
Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations
ORSA Journal on Computing
1994-12-11Paper
Directed hypergraphs and applications
Discrete Applied Mathematics
1993-06-29Paper
On the supermodular knapsack problem
Mathematical Programming. Series A. Series B
1989-01-01Paper
A Fast Parametric Maximum Flow Algorithm and Applications
SIAM Journal on Computing
1989-01-01Paper
Algorithms for testing the satisfiability of propositional formulae
The Journal of Logic Programming
1989-01-01Paper
Polynomially solvable satisfiability problems
Information Processing Letters
1988-01-01Paper
On some matching problems arising in vehicle scheduling models
Networks
1987-01-01Paper
Shortest path methods: A unifying approach
Mathematical Programming Studies
1986-01-01Paper
A multi-level bottleneck assignment approach to the bus drivers' rostering problem
European Journal of Operational Research
1984-01-01Paper
Network models for vehicle and crew scheduling
European Journal of Operational Research
1984-01-01Paper
scientific article; zbMATH DE number 3952519 (Why is no real title available?)1984-01-01Paper
Optimal location of files and programs in computer networks
Mathematical Programming Studies
1982-01-01Paper
A new algorithm to find the shortest paths between all pairs of nodes
Discrete Applied Mathematics
1982-01-01Paper
Quadratic knapsack problems
Mathematical Programming Studies
1980-01-01Paper
An algorithm for the min concave cost flow problem
European Journal of Operational Research
1980-01-01Paper
Adjacent extreme flows and application to min concave cost flow problems
Networks
1979-01-01Paper
Concave cost minimization on networks
European Journal of Operational Research
1979-01-01Paper
scientific article; zbMATH DE number 3652063 (Why is no real title available?)1978-01-01Paper
Extreme points and adjacency relationship in the flow polytope
Calcolo
1978-01-01Paper
Bilinear programming: An exact algorithm
Mathematical Programming
1977-01-01Paper
scientific article; zbMATH DE number 3666536 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3661104 (Why is no real title available?)1975-01-01Paper


Research outcomes over time


This page was built for person: Giorgio Gallo