Frieda Granot

Publication Activity (10 Years)

Years Active: 1975-2021
Publications (10 Years): 3

Top Topics

Anatomical Landmarks

Qualitative Analysis

Planning Horizon

Bullwhip Effect

Top Venues

Discret. Appl. Math.

Manuf. Serv. Oper. Manag.

Publications

Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui
Incentives and Emission Responsibility Allocation in Supply Chains. Manag. Sci. 67 (7) (2021)
Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot
Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains. Manag. Sci. 67 (12) (2021)
Iara Ciurria-Infosino, Daniel Granot, Frieda Granot
Monotonicity and conformality in multicommodity network-flow problems. Networks 74 (3) (2019)
Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.
Multicommodity Production Planning: Qualitative Analysis and Applications. Manuf. Serv. Oper. Manag. 17 (4) (2015)
Iara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.
Substitutes, complements, and ripples in multicommodity flows on suspension graphs. Networks 64 (2) (2014)
Daniel Granot, Frieda Granot, Harshavardhan Ravichandran
The k-centrum Chinese Postman delivery problem and a related cost allocation game. Discret. Appl. Math. 179 (2014)
Daniel Granot, Frieda Granot
On graphs which can or cannot induce Chinese Postman games with a non-empty core. Discret. Appl. Math. 160 (13-14) (2012)
Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella
Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135 (1-2) (2012)
Daniel Granot, Frieda Granot, Tal Raviv
On competitive sequential location in a network with a decreasing demand intensity. Eur. J. Oper. Res. 205 (2) (2010)
Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic
The vehicle routing problem with pickups and deliveries on some special graphs. Discret. Appl. Math. 116 (3) (2002)
Daniel Granot, Frieda Granot, Weiping R. Zhu
Naturally submodular digraphs and forbidden digraph configurations. Discret. Appl. Math. 100 (1-2) (2000)
Daniel Granot, Frieda Granot, Weiping R. Zhu
Characterization sets for the nucleolus. Int. J. Game Theory 27 (3) (1998)
Antoine Gautier, Frieda Granot, Harry Zheng
Qualitative Sensitivity Analysis in Monotropic Programming. Math. Oper. Res. 23 (3) (1998)
Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. Algorithmica 17 (2) (1997)
Daniel Granot, Frieda Granot, Weiping R. Zhu
The reactive bargaining set of some flow games and of superadditive simple games. Int. J. Game Theory 26 (2) (1997)
Frieda Granot, Michal Penn, Maurice Queyranne
Disconnecting sets in single and two-terminal-pair networks. Networks 27 (2) (1996)
Frieda Granot, Michal Penn
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs. Discret. Appl. Math. 70 (3) (1996)
Frieda Granot, Michal Penn
On the integral 4-packing of T-cuts. Discret. Math. 142 (1-3) (1995)
Antoine Gautier, Frieda Granot
on the Equivalence of Constrained and Unconstrained Flows. Discret. Appl. Math. 55 (2) (1994)
Antoine Gautier, Frieda Granot
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems. Networks 24 (5) (1994)
Frieda Granot, Michal Penn
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO (1993)
Frieda Granot, Jadranka Skorin-Kapov
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Discret. Appl. Math. 41 (2) (1993)
Antoine Gautier, Frieda Granot
A parametric analysis of a nonlinear asset allocation management model. Oper. Res. Lett. 11 (5) (1992)
Daniel Granot, Frieda Granot
On Some Network Flow Games. Math. Oper. Res. 17 (4) (1992)
Daniel Granot, Frieda Granot
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. Math. Oper. Res. 17 (4) (1992)
Frieda Granot, Michal Penn
On the integral plane two-commodity flow problem. Oper. Res. Lett. 11 (3) (1992)
Frieda Granot, Jadranka Skorin-Kapov
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm. Math. Program. 46 (1990)
Frieda Granot, Jadranka Skorin-Kapov
Some Proximity and Sensitivity Results in Quadratic Integer Programming. Math. Program. 47 (1990)
Frieda Granot, Refael Hassin
Multi-terminal maximum flows in node-capacitated networks. Discret. Appl. Math. 13 (2-3) (1986)
Frieda Granot, Arthur F. Veinott Jr.
Substitutes, Complements and Ripples in Network Flows. Math. Oper. Res. 10 (3) (1985)
Daniel Granot, Frieda Granot
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope. Discret. Appl. Math. 9 (2) (1984)
Daniel Granot, Frieda Granot, Ellis L. Johnson
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. Math. Oper. Res. 7 (4) (1982)
Daniel Granot, Frieda Granot, Willem Vaessen
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs. Math. Program. 22 (1) (1982)
Daniel Granot, Frieda Granot
Technical Note - Generalized Covering Relaxation for 0-1 Programs. Oper. Res. 28 (6) (1980)
Abraham Charnes, Frieda Granot, F. Phillips
An Algorithm for Solving Interval Linear Programming Problems. Oper. Res. 25 (4) (1977)
Abraham Charnes, Daniel Granot, Frieda Granot
Technical Note - On Intersection Cuts in Interval Integer Linear Programming. Oper. Res. 25 (2) (1977)
Abraham Charnes, Frieda Granot
Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalities. Discret. Math. 11 (3) (1975)
Daniel Granot, Frieda Granot, Austin J. Lemoine
Technical Note - Approximations for a Service System with Nonindependent Interarrival Times. Oper. Res. 23 (1) (1975)