AN ALGORITHM (GIPC2) FOR SOLVING INTEGER PROGRAMMING PROBLEMS WITH SEPARABLE NONLINEAR OBJECTIVE FUNCTIONSPEGDEN CD; PETERSEN CC.1979; NAV. RES. LOGIST. QUART.; USA; DA. 1979; VOL. 26; NO 4; PP. 595-609; BIBL. 13 REF.Article

A BOUNDING TECHNIQUE FOR INTEGER LINEAR PROGRAMMING WITH BINARY VARIABLESHILLIER FS; JACQMIN NE.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 167-176; BIBL. 13 REF.Conference Paper

THE METHOD OF ENUMERATION ACCORDING TO THE INCREASING VALUE OF THE OBJECTIVE FUNCTION IN THE OPTIMIZATION OF BAR STRUCTURESIWANOW Z; GUTKOWSKI W.1981; BULL. ACAD. POL. SCI. SER. SCI. TECH.; ISSN 0001-4125; POL; DA. 1981 PUBL. 1982; VOL. 29; NO 9-10; PP. 9-14; ABS. RUS; BIBL. 5 REF.Article

AN IMPLICIT ENUMERATION SCHEME FOR THE FLOWSHOP PROBLEM WITH NO INTERMEDIATE STORAGESUHAMI I; MAH RSH.1981; COMPUT. CHEM. ENG.; ISSN 0098-1354; USA; DA. 1981; VOL. 5; NO 2; PP. 83-91; BIBL. 13 REF.Article

ON THE GENERAL FEASIBILITY TEST OF SCHEDULING LOT SIZES FOR SEVERAL PRODUCTS ON ONE MACHINEWEN LIAN HSU.1983; MANAGEMENT SCIENCE; ISSN 0025-1909; USA; DA. 1983; VOL. 29; NO 1; PP. 93-105; BIBL. 10 REF.Article

ALGORITHME D'ENUMERATION IMPLICITE POUR UN PROBLEME DE REPARTITION ET DE STANDARDISATIONBERESNEV VL.1974; UPRAVL. SISTEMY; S.S.S.R.; DA. 1974; NO 12; PP. 24-34; BIBL. 8 REF.Article

SOLVING A CAPITAL/TECHNOLOGY CONSTRAINT PROBLEM BY IMPLICIT ENUMERATIONLAU HT.1981; APPLIED SYSTEMS AND CYBERNETICS. INTERNATIONAL CONGRESS ON APPLIED SYSTEMS RESEARCH AND CYBERNETICS/1980/ACAPULCO; USA/GBR/FRA; NEW YORK; OXFORD; PARIS: PERGAMON PRESS; DA. 1981; PP. 2608-2612; BIBL. 15 REF.Conference Paper

SELECTION OF VARIABLES IN LINEAR REGRESSION USING THE MINIMUM SUM OF WEIGHTED ABSOLUTE ERRORS CRITERIONNARVLA SC; WELLINGTON JF.1979; TECHNOMETRICS; USA; DA. 1979; VOL. 21; NO 3; PP. 299-306; BIBL. 8 REF.Article

GLOBAL SOLUTIONS OF MATHEMATICAL PROGRAMS WITH INTRINSICALLY CONCAVE FUNCTIONSPASSY U.1978; J. OPTIMIZ. THEORY APPL.; USA; DA. 1978; VOL. 26; NO 1; PP. 97-115; BIBL. 8 REF.Article

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

A IMPLICIT ENUMERATION ALGORITHM FOR QUADRATIC INTEGER PROGRAMMINGMCBRIDE RD; YORMARK JS.1980; MANAGE. SCI.; ISSN 0025-1909; USA; DA. 1980; VOL. 26; NO 3; PP. 282-296; BIBL. 33 REF.Article

LINEAR 0-1 PROGRAMMING: A COMPARISON OF IMPLICIT ENUMERATION ALGORITHMSSUBHASH C; NARULA; KINDORF JR et al.1979; COMPUTERS OPER. RES.; GBR; DA. 1979; VOL. 6; NO 1; PP. 47-51; BIBL. 14 REF.Article

EIN KASKADENBAUMVERFAHREN ZUR LOSUENG DES "KNAPSACKPROBLEMS" = UNE TECHNIQUE DE RECHERCHE ARBORESCENTE EN CASCADE POUR LE PROBLEME DU SAC A DOSMULLER MERBACH H.1978; ANGEW. INFORMAT.; DEU; DA. 1978; VOL. 20; NO 11; PP. 494-505; ABS. ENG; BIBL. 16 REF.Article

ZERO-ONE PROGRAMMING WITH MANY VARIABLES AND FEW CONSTRAINTS.SOYSTER AL; LEV B; SLIVKA W et al.1978; EUROP. J. OPERAT. RES.; NLD; DA. 1978; VOL. 2; NO 3; PP. 195-201; BIBL. 11 REF.Article

A PREFERENCE ORDER DYNAMIC PROGRAM FOR A STOCHASTIC TRAVELING SALISMAN PROBLEMKAO EPC.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 6; PP. 1033-1045; BIBL. 13 REF.Article

JOB-SHOP SCHEDULING BY IMPLICIT ENUMERATIONLAGEWEG BJ; LENSTRA JK; RINNOOY KAN AHG et al.1977; MANAG. SCI.; USA; DA. 1977; VOL. 24; NO 4; PP. 441-450; ABS. 41 REF.Article

CONTRIBUTION A LA RESOLUTION DES PROGRAMMES MATHEMATIQUES EN NOMBRES ENTIERSFAYARD DIDIER; PLATEAU G.1979; ; FRA; DA. 1979; 464; (30)-309-(31) P.; 30 CM; BIBL. 55 REF.; TH.: SCI. MATH./LILLE 1/1979Thesis

INTERACTIVE INTEGER GOAL PROGRAMMING: METHODS AND APPLICATION.LEE SM.1978; LECTURE NOTES ECON. MATH. SYST.; GERM.; DA. 1978; VOL. 155; PP. 362-383; BIBL. 2 P.; (MULTIPLE CRITERIA PROBL. SOLVING. CONF. PROC.; BUFFALO, N.Y.; 1977)Conference Paper

The optimal design of flexible manufacturing systemsVINOD, B; SOLBERG, J. J.International journal of production research. 1985, Vol 23, Num 6, pp 1141-1151, issn 0020-7543Article

A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraintsHARNETT, R. M.Computers & operations research. 1984, Vol 11, Num 3, pp 321-331, issn 0305-0548Article

Selection of variables in linear regression: a pragmatic approachNARULA, S. C; WELLINGTON, J. F.Journal of statistical computation and simulation (Print). 1983, Vol 17, Num 3, pp 159-172, issn 0094-9655Article

Tabaris : an exact algorithm based on tabu search for finding a maximum independent set in a graphFRIDEN, C; HERTZ, A; DE WERRA, D et al.Computers & operations research. 1990, Vol 17, Num 5, pp 437-445, issn 0305-0548Article

An efficient algorithm for the 3-satisfiability problemBILLIONNET, A; SUTTER, A.Operations research letters. 1992, Vol 12, Num 1, pp 29-36, issn 0167-6377Article

Comment on some computational results on real 0-1 knapsack problemsBALAS, E; NAUSS, R; ZEMEL, E et al.Operations research letters. 1987, Vol 6, Num 3, pp 139-140, issn 0167-6377Article

A two-process implicit enumeration algorithm for the simple assembly line balancing problemSALTZMAN, M. J; BAYBARS, I.European journal of operational research. 1987, Vol 32, Num 1, pp 118-129, issn 0377-2217Article