Frieda Granot - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2021

Consistent Allocation of Emission Responsibility in Fossil Fuel Supply ChainsSanjith Gopalakrishnan, Daniel Granot, Frieda Granot. mansci, 67(12):7637-7668, 2021. [doi]

Incentives and Emission Responsibility Allocation in Supply ChainsSanjith Gopalakrishnan, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui. mansci, 67(7):4172-4190, 2021. [doi]

2019

Monotonicity and conformality in multicommodity network-flow problemsIara Ciurria-Infosino, Daniel Granot, Frieda Granot. networks, 74(3):302-319, 2019. [doi]

2015

Multicommodity Production Planning: Qualitative Analysis and ApplicationsIara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.. msom, 17(4):589-607, 2015. [doi]

2014

Substitutes, complements, and ripples in multicommodity flows on suspension graphsIara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.. networks, 64(2):65-75, 2014. [doi]

The k-centrum Chinese Postman delivery problem and a related cost allocation gameDaniel Granot, Frieda Granot, Harshavardhan Ravichandran. DAM, 179:100-108, 2014. [doi]

2012

Structural and algorithmic properties for parametric minimum cutsFrieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella. mp, 135(1-2):337-367, 2012. [doi]

On graphs which can or cannot induce Chinese Postman games with a non-empty coreDaniel Granot, Frieda Granot. DAM, 160(13-14):2054-2059, 2012. [doi]

2010

On competitive sequential location in a network with a decreasing demand intensityDaniel Granot, Frieda Granot, Tal Raviv. eor, 205(2):301-312, 2010. [doi]

2002

The vehicle routing problem with pickups and deliveries on some special graphsTali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic. DAM, 116(3):193-229, 2002.

2000

Naturally submodular digraphs and forbidden digraph configurationsDaniel Granot, Frieda Granot, W. R. Zhu. DAM, 100(1-2):67-84, 2000.

1998

Qualitative Sensitivity Analysis in Monotropic ProgrammingAntoine Gautier, Frieda Granot, Harry Zheng. mor, 23(3):695-707, 1998. [doi]

Characterization sets for the nucleolusDaniel Granot, Frieda Granot, Weiping R. Zhu. ijgt, 27(3):359-374, 1998. [doi]

1997

Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel MachinesFrieda Granot, Jadranka Skorin-Kapov, Amir Tamir. algorithmica, 17(2):100-110, 1997.

The reactive bargaining set of some flow games and of superadditive simple gamesDaniel Granot, Frieda Granot, Weiping R. Zhu. ijgt, 26(2):207-214, 1997. [doi]

1996

Disconnecting sets in single and two-terminal-pair networksFrieda Granot, Michal Penn, Maurice Queyranne. networks, 27(2):117-123, 1996. [doi]

Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar GraphsFrieda Granot, Michal Penn. DAM, 70(3):267-283, 1996. [doi]

1995

On the integral 4-packing of T-cutsFrieda Granot, Michal Penn. DM, 142(1-3):65-75, 1995. [doi]

1994

on the Equivalence of Constrained and Unconstrained FlowsAntoine Gautier, Frieda Granot. DAM, 55(2):113-132, 1994. [doi]

Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problemsAntoine Gautier, Frieda Granot. networks, 24(5):285-296, 1994. [doi]

1993

On the (integral) maximum tw flow in vertex and edge capacitated planar graphsFrieda Granot, Michal Penn. ipco 1993: 235-249

On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness ProblemFrieda Granot, Jadranka Skorin-Kapov. DAM, 41(2):139-146, 1993. [doi]

1992

A parametric analysis of a nonlinear asset allocation management modelAntoine Gautier 0002, Frieda Granot. orl, 11(5):273-279, 1992. [doi]

Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest ProblemDaniel Granot, Frieda Granot. mor, 17(4):765-780, 1992. [doi]

On Some Network Flow GamesDaniel Granot, Frieda Granot. mor, 17(4):792-841, 1992. [doi]

On the integral plane two-commodity flow problemFrieda Granot, Michal Penn. orl, 11(3):135-139, 1992. [doi]

1990

Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos AlgorithmFrieda Granot, Jadranka Skorin-Kapov. mp, 46:225-236, 1990.

Some Proximity and Sensitivity Results in Quadratic Integer ProgrammingFrieda Granot, Jadranka Skorin-Kapov. mp, 47:259-268, 1990.

1986

Multi-terminal maximum flows in node-capacitated networksFrieda Granot, Refael Hassin. DAM, 13(2-3):157-163, 1986. [doi]

1985

Substitutes, Complements and Ripples in Network FlowsFrieda Granot, Arthur F. Veinott Jr.. mor, 10(3):471-497, 1985. [doi]

1984

Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytopeDaniel Granot, Frieda Granot. DAM, 9(2):171-185, 1984. [doi]

1982

An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programsDaniel Granot, Frieda Granot, Willem Vaessen. mp, 22(1):350-357, 1982. [doi]

Duality and Pricing in Multiple Right-Hand Choice Linear Programming ProblemsDaniel Granot, Frieda Granot, Ellis L. Johnson. mor, 7(4):545-556, 1982. [doi]

1980

Technical Note - Generalized Covering Relaxation for 0-1 ProgramsDaniel Granot, Frieda Granot. ior, 28(6):1442-1450, 1980. [doi]

1977

An Algorithm for Solving Interval Linear Programming ProblemsAbraham Charnes, Frieda Granot, F. Phillips. ior, 25(4):688-695, 1977. [doi]

Technical Note - On Intersection Cuts in Interval Integer Linear ProgrammingAbraham Charnes, Daniel Granot, Frieda Granot. ior, 25(2):352-355, 1977. [doi]

1975

Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalitiesAbraham Charnes, Frieda Granot. DM, 11(3):233-248, 1975. [doi]

Technical Note - Approximations for a Service System with Nonindependent Interarrival TimesDaniel Granot, Frieda Granot, Austin J. Lemoine. ior, 23(1):162-166, 1975. [doi]

Sign in or sign up to see more results.

runs on WebDSL