Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("OPTIMISATION COMBINATOIRE")

Filter

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

Document Type [dt]

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

Publication Year[py]

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

Discipline (document) [di]

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

Language

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 5685

  • Page / 228
Export

Selection :

  • and

ON THE BICYCLE PROBLEMCHVATAL V.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 2; PP. 165-173; BIBL. 1 REF.Article

GOSSIPING OLD LADIESSERESS A.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 46; NO 1; PP. 75-81; BIBL. 5 REF.Article

POLYHEDRA FOR COMPOSED INDEPENDENCE SYSTEMSCUNNINGHAM WH.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 57-67; BIBL. 7 REF.Conference Paper

PROBABILISTIC ANALYSIS OF COMBINATORIAL ALGORITHMS: A BIBLIOGRAPHY WITH SELECTED ANNOTATIONSSLOMINSKI L.1982; COMPUTING; ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 3; PP. 257-267; ABS. GER; BIBL. 70 REF.Article

WORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEMAVIS D.1981; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1981; VOL. 7; NO 3; PP. 251-257; BIBL. 9 REF.Article

THE NETWORK FLOWS APPROACH FOR MATRICES WITH GIVEN ROW AND COLUMN SUMSANSTEE RP.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 2; PP. 125-138; BIBL. 10 REF.Article

APPROXIMATION ALGORITHMS FOR MAXIMIZING THE NUMBER OF SQUARES PACKED INTO A RECTANGLEBAKER BS; CALDERBANK AR; COFFMAN EG JR et al.1983; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1983; VOL. 4; NO 3; PP. 383-397; BIBL. 12 REF.Article

TWO LINES LEAST SQUARESLENSTRA AK; LENSTRA JK; RINNOOY KAN AHG et al.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 201-211; BIBL. 14 REF.Conference Paper

ALGORITHMIC EXTREMAL PROBLEMS IN COMBINATORIAL OPTIMIZATIONLIEBERHERR KJ.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 225-244; BIBL. 14 REF.Article

RANDOMISED ALGORITHMSWELSH DJA.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 133-145; BIBL. 35 REF.Conference Paper

MINIMIZING A COMBINATORIAL FUNCTIONDING ZHU DU; HWANG FK.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 523-528; BIBL. 1 REF.Conference Paper

SIGNATURES DES POINTS EXTREMES DU POLYEDRE DUAL DU PROBLEME DE TRANSPORTBALINSKI ML.1983; COMPTES RENDUS DES SEANCES DE L'ACADEMIE DES SCIENCES. SERIE 1: MATHEMATIQUE; ISSN 0249-6291; FRA; DA. 1983; VOL. 296; NO 11; PP. 457-459; ABS. ENG; BIBL. 3 REF.Article

A MINIMAX VERSION OF PTAK'S COMBINATORIAL LEMMAKINDLER J.1983; JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS; ISSN 0022-247X; USA; DA. 1983; VOL. 94; NO 2; PP. 454-459; BIBL. 7 REF.Article

OPTIMAL SUBTREES AND EXTENSIONSGROEFLIN H; LIEBLING TM; PRODON A et al.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 121-127; BIBL. 3 REF.Conference Paper

AN ALGORITHM FOR SUBMODULAR FUNCTIONS ON GRAPHSFRANK A.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 97-120; BIBL. 20 REF.Conference Paper

MINIMIZATION OF SOME NONLINEAR FUNCTIONS OVER POLYMATROIDAL NETWORK FLOWSZIMMERMANN U.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 287-309; BIBL. 18 REF.Conference Paper

BONN WORKSHOP ON COMBINATORIAL OPTIMIZATION, BASED ON LECTURES PRESENTED AT THE IV. BONN WORKSHOP ON COMBINATORIAL OPTIMIZATION, AUGUST 28-30, 1980ACHIM BACHEM ED; GROETSCHEL M ED; KORTE B ED et al.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; IX-309 P.; BIBL. DISSEM.Conference Paper

FLOW NETWORK FORMULATIONS OF POLYMATROID OPTIMIZATION PROBLEMSLAWLER EL; MARTEL CU.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 189-200; BIBL. 15 REF.Conference Paper

PAPERS PRESENTED AT THE STIRLING CONFERENCE ON COMBINATORIAL OPTIMIZATION, 24-28 AUGUST 1981WILSON LB ED; EDWARDS CS ED; RAYWARD SMITH VJ ED et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; 158 P.; BIBL. DISSEM.Conference Paper

AN EFFICIENT PRIMAL SIMPLEX ALGORITHM FOR MAXIMUM WEIGHTED VERTEX PACKING ON BIPARTITE GRAPHSIKURA Y; NEMHAUSER GL.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 149-168; BIBL. 15 REF.Conference Paper

DEGREE-TWO INEQUALITIES, CLIQUE FACETS, AND BIPERFECT GRAPHSJOHNSON EL; PADBERG MW.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 169-187; BIBL. 13 REF.Conference Paper

Corrigendum to our paper «the ellipsoid method and its consequences in combinatorial optimization»GRÖTSCHEL, M; LOVASZ, L; SCHRIJVER, A et al.Combinatorica (Print). 1984, Vol 4, Num 4, pp 291-295, issn 0209-9683Article

Extensions of functions of 0-1 variables and applications to combinatorial optimizationSINGER, I.Numerical functional analysis and optimization. 1984, Vol 7, Num 1, pp 23-62, issn 0163-0563Article

A note on cake cuttingEVEN, S; PAZ, A.Discrete applied mathematics. 1984, Vol 7, Num 3, pp 285-296, issn 0166-218XArticle

Frontiers of AlgorithmicsWU, Xiaodong.Journal of combinatorial optimization. 2012, Vol 23, Num 3, issn 1382-6905, 87 p.Serial Issue

  • Page / 228