Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Programación lineal")

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

Origin

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

Results 1 to 25 of 6016

  • Page / 241
Export

Selection :

  • and

A natural notion of morphism for linear programming problemsCHAVEZ, J. D.Journal of combinatorial theory. Series A. 1989, Vol 52, Num 2, pp 206-227, issn 0097-3165, 22 p.Article

Data envelopment analysis on a relaxed set of assumptionsPETERSEN, N. C.Management science. 1990, Vol 36, Num 3, pp 305-314, issn 0025-1909, 10 p.Article

A study of the relative efficiency of bank branches: an application of data envelopment analysisVASSILOGLOU, M; GIOKAS, D.The Journal of the Operational Research Society. 1990, Vol 41, Num 7, pp 591-597, issn 0160-5682, 7 p.Article

Possibilitic linear regreesion analysis for fuzzy dataTANAKA, H; HAYASHI, I; WATADA, J et al.European journal of operational research. 1989, Vol 40, Num 3, pp 389-396, issn 0377-2217, 8 p.Article

Benchmarking of linear programmingHARTMANN, J. C. M.Petroleum technology quarterly. 2006, Vol 11, Num 5, issn 1362-363X, 57-67 [8 p.]Article

On maximal codes in polynomial metric spacesBOYVALENKOV, P; DANEV, D.Lecture notes in computer science. 1997, pp 29-38, issn 0302-9743, isbn 3-540-63163-1Conference Paper

A direct constructive proof of a known result on total unimodularity, and a characterisation of related partitionsWHITE, D. J.Journal of mathematical analysis and applications. 1995, Vol 190, Num 1, pp 50-57, issn 0022-247XArticle

Applied data envelopment analysisBOUSSOFIANE, A; DYSON, R. G; THANASSOULIS, E et al.European journal of operational research. 1991, Vol 52, Num 1, pp 1-15, issn 0377-2217Article

A general model for fuzzy linear programmingDELGADO, M; VERDEGAY, J. L; VILA, M. A et al.Fuzzy sets and systems. 1989, Vol 29, Num 1, pp 21-29, issn 0165-0114Article

Possibilistic linear programming with triangular tuzzy numbersBUCKLEY, J. J.Fuzzy sets and systems. 1988, Vol 26, Num 1, pp 135-138, issn 0165-0114Article

A more efficient formulation of the single machine, static demand, lot scheduling problemFAYEZ FOUAD BOCTOR.Engineering costs and production economics. 1988, Vol 14, Num 1, pp 3-10, issn 0167-188XConference Paper

An efficient algorithm for solving a special class of LP'sKERN, W.Computing (Wien. Print). 1986, Vol 37, Num 3, pp 219-226, issn 0010-485XArticle

Sur le problème de programmation linéaire paramètrique générale = About the general parametric linear programmingBUI MINH TRI; HO TU BAO.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 495. 1984, 13 p.Report

Allocation of CO2 Emissions in Joint Product Industries via Linear Programming : A Refinery ExampleTEHRANI, A; NEJAD, M.Oil & gas science and technology. 2007, Vol 62, Num 5, pp 653-662, issn 1294-4475, 10 p.Article

Programmation linéaire et applications. Eléments de cours et exercices résolusMellouli, Khaled; El Kamel, Abdelkader; Borne, Pierre et al.Sciences et technologies. 2004, issn 1243-0226, isbn 2-7108-0844-7, 112 p., isbn 2-7108-0844-7Book

Integrated nonlinear optimization of bioprocesses via linear programmingVERA, Julio; TORRES, Néstor V; MOLES, Carmen G et al.AIChE journal. 2003, Vol 49, Num 12, pp 3173-3187, issn 0001-1541, 15 p.Article

Tighter relaxations for the cutting stock problemNITSCHE, C; SCHEITHAUER, G; TERNO, J et al.European journal of operational research. 1999, Vol 112, Num 3, pp 654-663, issn 0377-2217Article

Sensible rules for remembering duals: the S-O-B methodBENJAMIN, A. T.SIAM review (Print). 1995, Vol 37, Num 1, pp 85-87, issn 0036-1445Article

An inequality sorting algorithm for a class of linear programming problemsLAKSHMIKANTHAM, V; SEN, S. K; SIVASUNDARAM, S et al.Journal of mathematical analysis and applications. 1993, Vol 174, Num 2, pp 450-460, issn 0022-247XArticle

Intelligent analysis support for linear programsGREENBERG, H. J.Computers & chemical engineering. 1992, Vol 16, Num 7, pp 659-673, issn 0098-1354Article

A new dynamic basis algorithm for solving linear programming problems for engineering designWANG, Y; SANDGREN, E.Journal of mechanisms, transmissions, and automation in design. 1990, Vol 112, Num 2, pp 208-214, issn 0738-0666, 7 p.Article

A steepest edge active set algorithm for solving sparse linear programming problemsSLOAN, S. W.International journal for numerical methods in engineering. 1988, Vol 26, Num 12, pp 2671-2685, issn 0029-5981Article

On the performance of Karmarkar's algorithmFERRIS, M. C; PHILPOTT, A. B.The Journal of the Operational Research Society. 1988, Vol 39, Num 3, pp 257-270, issn 0160-5682Article

Computational experience with a dual affine variant of Karmarkar's method for linear programmingMONMA, C. L; MORTON, A. J.Operations research letters. 1987, Vol 6, Num 6, pp 261-267, issn 0167-6377Article

Solving discretized contact problems using linear programmingFISCHER, U; MELOSH, R. J.Computers & structures. 1987, Vol 25, Num 5, pp 661-664, issn 0045-7949Article

  • Page / 241