Result 1 to 20 of 679 total
The measure of totally positive algebraic integers. (English)
J. Number Theory 133, No. 1, 12-19 (2013).
1
The $L_1$-norm best-fit hyperplane problem. (English)
Appl. Math. Lett. 26, No. 1, 51-55 (2013).
2
A constructive proof of fundamental theory for fuzzy variable linear programming problems. (English)
Appl. Appl. Math. 7, No. 2, 691-707, electronic only (2012).
3
A new linear programming approach and genetic algorithm for solving airline boarding problem. (English)
Appl. Math. Modelling 36, No. 9, 4060-4072 (2012).
4
Dispersion in disks. (English)
Theory Comput. Syst. 51, No. 2, 125-142 (2012).
5
Fast Fourier optimization. (English)
Math. Program. Comput. 4, No. 1, 53-69 (2012).
6
Pebble games and linear equations. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 289-304, electronic only (2012).
7
Models and algorithms for the train unit assignment problem. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 24-35 (2012).
8
On linear and semidefinite programming relaxations for hypergraph matching. (English)
Math. Program. 135, No. 1-2 (A), 123-148 (2012).
9
Software implementation of modifications of iterative algorithms for solving linear systems of equations. (English)
Int. J. Pure Appl. Math. 76, No. 4, 489-500 (2012).
10
On the complexity of a Mehrotra-type predictor-corrector algorithm. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2012. 12th international conference, Salvador de Bahia, Brazil, June 18‒21, 2012. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-31136-9/pbk). Lecture Notes in Computer Science 7335, 17-29 (2012).
11
A combinatorial model and algorithm for globally searching community structure in complex networks. (English)
J. Comb. Optim. 23, No. 4, 425-442 (2012).
12
Linear bilevel programming with interval coefficients. (English)
J. Comput. Appl. Math. 236, No. 15, 3751-3762 (2012).
13
Minimum-perimeter intersecting polygons. (English)
Algorithmica 63, No. 3, 602-615 (2012).
14
Quantitatively fair scheduling. (English)
Theor. Comput. Sci. 413, No. 1, 160-175 (2012).
15
Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods. (English)
Linear Algebra Appl. 436, No. 5, 1267-1284 (2012).
16
A proposed approach for solving rough bi-level programming problems by genetic algorithm. (English)
Int. J. Contemp. Math. Sci. 6, No. 29-32, 1453-1465 (2011).
17
An efficient optimization method for uncertain problems based on non-probabilistic interval model. (English)
Int. J. Comput. Methods 8, No. 4, 837-850 (2011).
18
An improved primal simplex algorithm for degenerate linear programs. (English)
INFORMS J. Comput. 23, No. 4, 569-577 (2011).
19
Geometric rounding: A dependent randomized rounding scheme. (English)
J. Comb. Optim. 22, No. 4, 699-725 (2011).
20
Result 1 to 20 of 679 total
Start
Contact
Print
General Help
