GENERALIZED EQUIVALENT INTEGER PROGRAMS AND CANONICAL PROBLEMS.FAALAND B.1974; MANAG. SCI.; U.S.A.; DA. 1974; VOL. 20; NO 12; PP. 1554-1560; BIBL. 6 REF.Article

MARKOVIAN DECISION PROCESSES WITH PROBABILISTIC OBSERVATION OF STATES.SATIA JK; LAVE RE.1973; MANAG. SCI.; U.S.A.; DA. 1973; VOL. 20; NO 1; PP. 1-13; BIBL. 18 REF.Article

AN ALGORITHM FOR THE BOUNDED VARIABLE INTEGER PROGRAMMING PROBLEM.TROTTER LE JR; SHETTY CM.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 505-513; BIBL. 14 REF.Article

USING DECOMPOSITION IN INTEGER PROGRAMMING.SCHRAGE L.1973; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1973; VOL. 20; NO 3; PP. 469-476; BIBL. 10 REF.Article

EXACT IMPLICIT ENUMERATION METHOD FOR SOLVING THE SET PARTITIONING PROBLEM = METHODE D'ENUMERATION IMPLICITE EXACTE POUR LA RESOLUTION DU PROBLEME DE PARTITION D'UN ENSEMBLEMICHAUD P.1972; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1972; VOL. 16; NO 6; PP. 573-578; BIBL. 16 REF.Serial Issue

MAXIMAL FLOW PROBLEM IN A NETWORK WITH A VARIABLE STRUCTUREGRABOWSKI J; SKUBALSKA E.1982; ZASTOS. MAT.; ISSN 0044-1899; POL; DA. 1982; VOL. 17; NO 2; PP. 293-307; ABS. POL; BIBL. 7 REF.Article

POSTOPTIMALITY ANALYSIS IN INTEGER PROGRAMMING BY IMPLICIT ENUMERATION: THE MIXED INTEGER CASE.ROODMAN GM.1974; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 595-607; BIBL. 15 REF.Article

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

ESTIMATES AND BOUNDS ON COMPUTATIONAL EFFORT IN THE ACCELERATED BOUND- AND -SCAN ALGORITHM.FAALAND BH.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 3; PP. 426-433; BIBL. 8 REF.Article

SOLUTION OF CAPITAL BUDGETING PROBLEMS HAVING CHANCE CONSTRAINTS; HEURISTIC AND EXACT METHODS.PETERSEN CC.1975; A.I.I.E. TRANS.; U.S.A.; DA. 1975; VOL. 7; NO 2; PP. 153-158; BIBL. 5 REF.Article

THE APPLICATION OF AN IMPLICIT ENUMERATION ALGORITHM TO THE SCHOOL DESEGREGATION PROBLEM.LIGGETT RS.1973; MANAG. SCI.; U.S.A.; DA. 1973; VOL. 20; NO 2; PP. 159-168; BIBL. 6 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

MODELLING TECHNIQUES AND HEURISTICS FOR COMBINATORIAL PROBLEMS.MULLER MERBACH H.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 3-27; BIBL. 2 P.Conference Paper

THE ACCELERATED BOUND- AND -SCAN ALGORITHM FOR INTEGER PROGRAMMING.FAALAND BH; HILLIER FS.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 3; PP. 406-425; BIBL. 16 REF.Article

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 LEAST TOTAL DISTANCE FACILITY CONFIGURATION PROBLEM INVOLVING LATTICE POINTS.CHAN AW; FRANCIS RL.1976; MANAG. SCI.; U.S.A.; DA. 1976; VOL. 22; NO 7; PP. 778-787; BIBL. 15 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

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