default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrieda Granot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]Sanjith Gopalakrishnan
, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui:
Incentives and Emission Responsibility Allocation in Supply Chains. Manag. Sci. 67(7): 4172-4190 (2021)- [j36]Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot:
Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains. Manag. Sci. 67(12): 7637-7668 (2021)
2010 – 2019
- 2019
- [j35]Iara Ciurria-Infosino, Daniel Granot, Frieda Granot:
Monotonicity and conformality in multicommodity network-flow problems. Networks 74(3): 302-319 (2019) - 2015
- [j34]Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.:
Multicommodity Production Planning: Qualitative Analysis and Applications. Manuf. Serv. Oper. Manag. 17(4): 589-607 (2015) - 2014
- [j33]Daniel Granot, Frieda Granot, Harshavardhan Ravichandran:
The k-centrum Chinese Postman delivery problem and a related cost allocation game. Discret. Appl. Math. 179: 100-108 (2014) - [j32]Iara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, complements, and ripples in multicommodity flows on suspension graphs. Networks 64(2): 65-75 (2014) - 2012
- [j31]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): 2054-2059 (2012) - [j30]Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella:
Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012) - 2010
- [j29]Daniel Granot, Frieda Granot, Tal Raviv:
On competitive sequential location in a network with a decreasing demand intensity. Eur. J. Oper. Res. 205(2): 301-312 (2010)
2000 – 2009
- 2002
- [j28]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): 193-229 (2002) - 2000
- [j27]Daniel Granot, Frieda Granot, Weiping R. Zhu:
Naturally submodular digraphs and forbidden digraph configurations. Discret. Appl. Math. 100(1-2): 67-84 (2000)
1990 – 1999
- 1998
- [j26]Daniel Granot, Frieda Granot, Weiping R. Zhu:
Characterization sets for the nucleolus. Int. J. Game Theory 27(3): 359-374 (1998) - [j25]Antoine Gautier, Frieda Granot, Harry Zheng:
Qualitative Sensitivity Analysis in Monotropic Programming. Math. Oper. Res. 23(3): 695-707 (1998) - 1997
- [j24]Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir:
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. Algorithmica 17(2): 100-110 (1997) - [j23]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): 207-214 (1997) - 1996
- [j22]Frieda Granot, Michal Penn:
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs. Discret. Appl. Math. 70(3): 267-283 (1996) - [j21]Frieda Granot, Michal Penn, Maurice Queyranne:
Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996) - 1995
- [j20]Frieda Granot, Michal Penn:
On the integral 4-packing of T-cuts. Discret. Math. 142(1-3): 65-75 (1995) - 1994
- [j19]Antoine Gautier, Frieda Granot:
on the Equivalence of Constrained and Unconstrained Flows. Discret. Appl. Math. 55(2): 113-132 (1994) - [j18]Antoine Gautier, Frieda Granot:
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems. Networks 24(5): 285-296 (1994) - 1993
- [j17]Frieda Granot, Jadranka Skorin-Kapov:
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Discret. Appl. Math. 41(2): 139-146 (1993) - [c1]Frieda Granot, Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 - 1992
- [j16]Daniel Granot, Frieda Granot:
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. Math. Oper. Res. 17(4): 765-780 (1992) - [j15]Daniel Granot, Frieda Granot:
On Some Network Flow Games. Math. Oper. Res. 17(4): 792-841 (1992) - [j14]Frieda Granot, Michal Penn:
On the integral plane two-commodity flow problem. Oper. Res. Lett. 11(3): 135-139 (1992) - [j13]Antoine Gautier, Frieda Granot:
A parametric analysis of a nonlinear asset allocation management model. Oper. Res. Lett. 11(5): 273-279 (1992) - 1990
- [j12]Frieda Granot, Jadranka Skorin-Kapov:
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm. Math. Program. 46: 225-236 (1990) - [j11]Frieda Granot, Jadranka Skorin-Kapov:
Some Proximity and Sensitivity Results in Quadratic Integer Programming. Math. Program. 47: 259-268 (1990)
1980 – 1989
- 1986
- [j10]Frieda Granot, Refael Hassin:
Multi-terminal maximum flows in node-capacitated networks. Discret. Appl. Math. 13(2-3): 157-163 (1986) - 1985
- [j9]Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, Complements and Ripples in Network Flows. Math. Oper. Res. 10(3): 471-497 (1985) - 1984
- [j8]Daniel Granot, Frieda Granot:
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope. Discret. Appl. Math. 9(2): 171-185 (1984) - 1982
- [j7]Daniel Granot, Frieda Granot, Ellis L. Johnson:
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. Math. Oper. Res. 7(4): 545-556 (1982) - [j6]Daniel Granot, Frieda Granot, Willem Vaessen:
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs. Math. Program. 22(1): 350-357 (1982) - 1980
- [j5]Daniel Granot, Frieda Granot:
Technical Note - Generalized Covering Relaxation for 0-1 Programs. Oper. Res. 28(6): 1442-1450 (1980)
1970 – 1979
- 1977
- [j4]Abraham Charnes, Daniel Granot, Frieda Granot:
Technical Note - On Intersection Cuts in Interval Integer Linear Programming. Oper. Res. 25(2): 352-355 (1977) - [j3]Abraham Charnes, Frieda Granot, F. Phillips:
An Algorithm for Solving Interval Linear Programming Problems. Oper. Res. 25(4): 688-695 (1977) - 1975
- [j2]Abraham Charnes, Frieda Granot:
Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalities. Discret. Math. 11(3): 233-248 (1975) - [j1]Daniel Granot, Frieda Granot, Austin J. Lemoine:
Technical Note - Approximations for a Service System with Nonindependent Interarrival Times. Oper. Res. 23(1): 162-166 (1975)
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:46 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:
