Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("OPTIMISATION DISCRETE")

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 34

  • Page / 2
Export

Selection :

  • and

CONSTRAINED OPTIMIZATION PROBLEMS USING MULTIPLIER METHODSTRIPATHI SS; NARENDRA KS.1972; J. OPTIMIZ. THEORY APPL.; U.S.A.; DA. 1972; VOL. 9; NO 1; PP. 59-70; BIBL. 11 REF.Serial Issue

Classification by discrete optimizationPELEG, S.Computer vision, graphics, and image processing. 1984, Vol 25, Num 1, pp 122-130, issn 0734-189XArticle

On computing the optimal bridge between two convex polygonsBHATTACHARYA, Binay; BENKOCZI, Robert.Information processing letters. 2001, Vol 79, Num 5, pp 215-221, issn 0020-0190Article

A general approach to investigating the stability of solutions of problems of discrete optimizationGORDEYEV, E. N; LEONT'YEV, V. K.Computational mathematics and mathematical physics. 1996, Vol 36, Num 1, pp 53-58, issn 0965-5425Article

A faster scaling algorithm for minimizing submodular functionsIWATA, Satoru.SIAM journal on computing (Print). 2003, Vol 32, Num 4, pp 833-840, issn 0097-5397, 8 p.Article

Minima locaux, fonctions marginales et hyperplans séparants dans l'optimisation discrèteKISELMAN, Christer O.Comptes rendus. Mathématique. 2008, Vol 346, Num 1-2, pp 49-52, issn 1631-073X, 4 p.Article

High-order consistency in valued constraint satisfactionCOOPER, Martin C.Constraints (Dordrecht). 2005, Vol 10, Num 3, pp 283-305, issn 1383-7133, 23 p.Article

An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygonsWANG, D. P.Information processing letters. 2001, Vol 79, Num 5, pp 229-236, issn 0020-0190Article

A simulated annealing algorithm with constant temperature for discrete stochastic optimizationALREFAEI, M. H; ANDRADOTTIR, S.Management science. 1999, Vol 45, Num 5, pp 748-764, issn 0025-1909Article

Discrete optimization problems with interval data: Pareto set of solutions or set of weak solutions?KOZINA, Galina.Reliable computing. 2004, Vol 10, Num 6, pp 469-487, issn 1385-3139, 19 p.Article

Some aperture-angle optimization problemsBOSE, P; HURTADO-DIAZ, F; OMANA-PULIDO, E et al.Algorithmica. 2002, Vol 33, Num 4, pp 411-435, issn 0178-4617Article

Gammes bien réparties et transformée de fourier discrète = Maximally even sets and discrete fourier transformAMIOT, Emmanuel.Mathématiques et sciences humaines (2000). 2007, Num 178, pp 95-117, issn 0987-6936, 23 p.Article

An efficient algorithm for computing optimal discrete voltage schedulesMINMING LI; YAO, Frances F.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 658-671, issn 0097-5397, 14 p.Article

Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special casesFATHALI, J; TAGHIZADEH KAKHKI, H.European journal of operational research. 2006, Vol 170, Num 2, pp 440-462, issn 0377-2217, 23 p.Article

A generic approach to proving NP-hardness of partition type problemsKOVALYOV, Mikhail Y; PESCH, Erwin.Discrete applied mathematics. 2010, Vol 158, Num 17, pp 1908-1912, issn 0166-218X, 5 p.Article

Quadratic M-convex and L-convex functionsMUROTA, Kazuo; SHIOURA, Akiyoshi.Advances in applied mathematics (Print). 2004, Vol 33, Num 2, pp 318-341, issn 0196-8858, 24 p.Article

An algorithm for mixed integer optimizationKÖPPE, Matthias; WEISMANTEL, Robert.Mathematical programming. 2003, Vol 98, Num 1-3, pp 281-307, issn 0025-5610, 27 p.Conference Paper

A solution method for a discrete optimization problem with tabular polynomial functionsDIVEEV, A. I.Computational mathematics and mathematical physics. 2001, Vol 41, Num 3, pp 469-475, issn 0965-5425Article

A note on the depth function of combinatorial optimization problemsWOEGINGER, Gerhard J.Discrete applied mathematics. 2001, Vol 108, Num 3, pp 325-328, issn 0166-218XArticle

Semidefinite programming and combinatorial optimizationRENDL, F.Applied numerical mathematics. 1999, Vol 29, Num 3, pp 255-281, issn 0168-9274Conference Paper

Fairness measures for resource allocationKUMAR, Amit; KLEINBERG, Jon.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 657-680, issn 0097-5397, 24 p.Article

Prospects of quantum-classical optimization for digital designGASTALDO, Paolo; RIDELLA, Sandro; ZUNINO, Rodolfo et al.Applied mathematics and computation. 2006, Vol 179, Num 2, pp 581-595, issn 0096-3003, 15 p.Article

Typical properties of winners and losers in discrete optimizationBEIER, Rene; VÖCKING, Berthold.SIAM journal on computing (Print). 2006, Vol 35, Num 4, pp 855-881, issn 0097-5397, 27 p.Conference Paper

Bichromatic separability with two boxes: A general approachCORTES, C; DIAZ-BANEZ, J. M; PEREZ-LANTERO, P et al.Journal of algorithms (Print). 2009, Vol 64, Num 2-3, pp 79-88, issn 0196-6774, 10 p.Article

Reference point approach for multiple decision makersLAHDELMA, Risto; MIETTINEN, Kaisa; SALMINEN, Pekka et al.European journal of operational research. 2005, Vol 164, Num 3, pp 785-791, issn 0377-2217, 7 p.Conference Paper

  • Page / 2