Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GRANOT D")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 47

  • Page / 2

Export

Selection :

  • and

COOPERATIVE GAMES IN STOCHASTIC CHARACTERISTIC FUNCTION FORM.GRANOT D.1977; MANAG. SCI.; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 621-630; BIBL. 11 REF.Article

The role of cost allocation in locational modelsGRANOT, D.Operations research. 1987, Vol 35, Num 2, pp 234-248, issn 0030-364XArticle

MINIMUM COST SPANNING TREE GAMESGRANOT D; HUBERMAN G.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 1; PP. 1-18; BIBL. 10 REF.Article

A generalized linear production model: a unifying modelGRANOT, D.Mathematical programming. 1986, Vol 34, Num 2, pp 212-222, issn 0025-5610Article

ON SOLVING FRACTIONAL (0,1) PROGRAMS BY IMPLICIT ENUMERATION.GRANOT D; GRANOT F.1976; INFOR; CANADA; DA. 1976; VOL. 14; NO 3; PP. 241-249; ABS. FR.; BIBL. 17 REF.Article

THE RELATIONSHIP BETWEEN CONVEX GAMES AND MINIMUM COST SPANNING TREE GAMES: A CASE FOR PERMUTATIONALLY CONVEX GAMESGRANOT D; HUBERMAN G.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 288-292; BIBL. 13 REF.Article

COALITIONAL AND CHANCE-CONSTRAINED SOLUTIONS TO N-PERSON GAMES. II. TWO-STAGE SOLUTIONS.CHARNES A; GRANOT D.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 6; PP. 1013-1019; BIBL. 8 REF.Article

GENERALIZED COVERING RELAXATION FOR 0-1 PROGRAMSGRANOT D; GRANOT F.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980 PUBL. 1981; VOL. 28; NO 6; PP. 1442-1450; BIBL. 17 REF.Article

COALITIONAL AND CHANCE-CONSTRAINED SOLUTIONS TO N-PERSON GAMES. I. THE PRIOR SATISFICING NUCLEOLUS.CHARNES A; GRANOT D.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 31; NO 2; PP. 358-367; BIBL. 7 REF.Article

COVERING RELAXATION FOR POSITIVE 0-1 POLYNOMIAL PROGRAMSGRANOT D; GRANOT F; KALLBERG et al.1979; MANAG. SCI.; USA; DA. 1979; VOL. 25; NO 3; PP. 264-273; BIBL. 15 REF.Article

ON IMPROVING BOUNDS FOR VARIABLES IN LINEAR INTEGER PROGRAMS BY SURROGATE CONSTRAINTS.CHARNES A; GRANOT D; GRANOT F et al.1975; INFOR; CANADA; DA. 1975; VOL. 13; NO 3; PP. 260-269; ABS. FR.; BIBL. 9 REF.Article

ON SOLVING LINEAR FRACTIONAL INTERVAL PROGRAMMING PROBLEMSCHARNES A; GRANOT D; GRANOT F et al.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 1; PP. 45-57; BIBL. 15 REF.Article

A PRIMAL ALGORITHM FOR INTERVAL LINEAR-PROGRAMMING PROBLEMS.CHARNES A; GRANOT D; GRANOT F et al.1977; LINEAR ALGEBRA APPL.; U.S.A.; DA. 1977; VOL. 17; NO 1; PP. 65-78; BIBL. 18 REF.Article

DUALITY AND PRICING IN MULTIPLE RIGHT-HAND CHOICE LINEAR PROGRAMMING PROBLEMSGRANOT D; GRANOT F; JOHNSON EL et al.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 4; PP. 545-556; BIBL. 7 REF.Article

AN ALGORITHM FOR SOLVING GENERAL FRACTIONAL INTERVAL PROGRAMMING PROBLEMS.CHARNES A; GRANOT D; GRANOT F et al.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 53-65; BIBL. 19 REF.Article

AN ACCELERATED COVERING RELAXATION ALGORITHM FOR SOLVING 0-1 POSITIVE POLYNORMAL PROGRAMSGRANOT D; GRANOT F; VAESSEN W et al.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 22; NO 3; PP. 350-357; BIBL. 6 REF.Article

APPROXIMATIONS FOR A SERVICE SYSTEM WITH NONINDEPENDENT INTERARRIVAL TIMES.GRANOT D; GRANOT F; LEMOINE A et al.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 1; PP. 162-166; BIBL. 8 REF.Article

ON INTERSECTION CUTS IN INTERVAL INTEGER LINEAR PROGRAMMING.CHARNES A; GRANOT D; GRANOT F et al.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 2; PP. 352-355; BIBL. 15 REF.Article

A NOTE ON EXPLICIT SOLUTION IN LINEAR FRACTIONAL PROGRAMMING.CHARNES A; GRANOT D; GRANOT F et al.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 161-167; BIBL. 6 REF.Article

The 5' untranslated region of Arabidopsis thaliana calmodulin cDNA is an independent cDNA containing an open reading frameGRANOT, D; NIR DAI.Planta. 1996, Vol 198, Num 1, pp 162-163, issn 0032-0935Article

NC algorithms for recognizing partial 2-trees and 3-treesGRANOT, D; SKORIN-KAPOV, D.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 3, pp 342-354, issn 0895-4801Article

The repair kit problem revisitedBRUMELLE, S; GRANOT, D.Operations research. 1993, Vol 41, Num 5, pp 994-1006, issn 0030-364XArticle

Training and job search in the labor marketGRANOT, D; ZUCKERMAN, D.Operations research letters. 1992, Vol 11, Num 2, pp 87-92, issn 0167-6377Article

On cost allocation in communication networksGRANOT, D; HOJATI, M.Networks (New York, NY). 1990, Vol 20, Num 2, pp 209-229, issn 0028-3045, 21 p.Article

On some optimization problems on k-trees and partial k-treesGRANOT, D; SKORIN-KAPOV, D.Discrete applied mathematics. 1994, Vol 48, Num 2, pp 129-145, issn 0166-218XArticle

  • Page / 2