Frieda Granot

According to our database, Frieda Granot authored at least 38 papers between 1975 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains.

Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot

Manag. Sci., 2021

Incentives and Emission Responsibility Allocation in Supply Chains.

Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui

Manag. Sci., 2021

2019

Monotonicity and conformality in multicommodity network-flow problems.

Iara Ciurria-Infosino, Daniel Granot, Frieda Granot

Networks, 2019

2015

Multicommodity Production Planning: Qualitative Analysis and Applications.

Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.

Manuf. Serv. Oper. Manag., 2015

2014

Substitutes, complements, and ripples in multicommodity flows on suspension graphs.

Iara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.

Networks, 2014

The k-centrum Chinese Postman delivery problem and a related cost allocation game.

Daniel Granot, Frieda Granot, Harshavardhan Ravichandran

Discret. Appl. Math., 2014

2012

Structural and algorithmic properties for parametric minimum cuts.

Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella

Math. Program., 2012

On graphs which can or cannot induce Chinese Postman games with a non-empty core.

Daniel Granot, Frieda Granot

Discret. Appl. Math., 2012

2010

On competitive sequential location in a network with a decreasing demand intensity.

Daniel Granot, Frieda Granot, Tal Raviv

Eur. J. Oper. Res., 2010

2002

The vehicle routing problem with pickups and deliveries on some special graphs.

Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic

Discret. Appl. Math., 2002

2000

Naturally submodular digraphs and forbidden digraph configurations.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Discret. Appl. Math., 2000

1998

Qualitative Sensitivity Analysis in Monotropic Programming.

Antoine Gautier, Frieda Granot, Harry Zheng

Math. Oper. Res., 1998

Characterization sets for the nucleolus.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Int. J. Game Theory, 1998

1997

The reactive bargaining set of some flow games and of superadditive simple games.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Int. J. Game Theory, 1997

Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines.

Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir

Algorithmica, 1997

1996

Disconnecting sets in single and two-terminal-pair networks.

Frieda Granot, Michal Penn, Maurice Queyranne

Networks, 1996

Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.

Frieda Granot, Michal Penn

Discret. Appl. Math., 1996

1995

On the integral 4-packing of T-cuts.

Frieda Granot, Michal Penn

Discret. Math., 1995

1994

Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems.

Antoine Gautier, Frieda Granot

Networks, 1994

on the Equivalence of Constrained and Unconstrained Flows.

Antoine Gautier, Frieda Granot

Discret. Appl. Math., 1994

1993

On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem.

Frieda Granot, Jadranka Skorin-Kapov

Discret. Appl. Math., 1993

On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.

Frieda Granot, Michal Penn

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

On the integral plane two-commodity flow problem.

Frieda Granot, Michal Penn

Oper. Res. Lett., 1992

A parametric analysis of a nonlinear asset allocation management model.

Antoine Gautier, Frieda Granot

Oper. Res. Lett., 1992

On Some Network Flow Games.

Daniel Granot, Frieda Granot

Math. Oper. Res., 1992

Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem.

Daniel Granot, Frieda Granot

Math. Oper. Res., 1992

1990

Some Proximity and Sensitivity Results in Quadratic Integer Programming.

Frieda Granot, Jadranka Skorin-Kapov

Math. Program., 1990

Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm.

Frieda Granot, Jadranka Skorin-Kapov

Math. Program., 1990

1986

Multi-terminal maximum flows in node-capacitated networks.

Frieda Granot, Refael Hassin

Discret. Appl. Math., 1986

1985

Substitutes, Complements and Ripples in Network Flows.

Frieda Granot, Arthur F. Veinott Jr.

Math. Oper. Res., 1985

1984

Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope.

Daniel Granot, Frieda Granot

Discret. Appl. Math., 1984

1982

An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs.

Daniel Granot, Frieda Granot, Willem Vaessen

Math. Program., 1982

Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems.

Daniel Granot, Frieda Granot, Ellis L. Johnson

Math. Oper. Res., 1982

1980

Technical Note - Generalized Covering Relaxation for 0-1 Programs.

Daniel Granot, Frieda Granot

Oper. Res., 1980

1977

An Algorithm for Solving Interval Linear Programming Problems.

Abraham Charnes, Frieda Granot, F. Phillips

Oper. Res., 1977

Technical Note - On Intersection Cuts in Interval Integer Linear Programming.

Abraham Charnes, Daniel Granot, Frieda Granot

Oper. Res., 1977

1975

Technical Note - Approximations for a Service System with Nonindependent Interarrival Times.

Daniel Granot, Frieda Granot, Austin J. Lemoine

Oper. Res., 1975

Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalities.

Abraham Charnes, Frieda Granot

Discret. Math., 1975