Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Browse by Current Cardiff authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 31.

Aliev, Iskander, Celaya, Marcel, Henk, Martin and Williams, Aled 2021. Distance-sparsity transference for vertices of corner polyhedra. SIAM Journal on Optimization 31 (1) 10.1137/20M1353228

Aliev, Iskander, Henk, Martin and Oertel, Timm 2020. Distances to lattice points in knapsack polyhedra. Mathematical Programming 182 10.1007/s10107-019-01392-1

Aliev, Iskander 2020. On the volume of hyperplane sections of a d-CUBE. Acta Mathematica Hungarica 10.1007/s10474-020-01057-y
Item availability restricted.

Aliev, Iskander, Averkov, Gennadiy, De Lora, Jesus A. and Oertel, Timm 2020. Optimizing sparsity over lattices and semigroups. Lecture Notes in Computer Science

Aliev, Iskander 2019. On polynomial-time solvable linear Diophantine problems. Moscow Journal of Combinatorics and Number Theory 8 (4) , pp. 357-365.

Aliev, I., De Loera, J. A., Eisenbrand, F., Oertel, T. and Weismantel, R. 2018. The support of integer optimal solutions. SIAM Journal on Optimization 28 (3) , pp. 2152-2157. 10.1137/17M1162792

Aliev, Iskander, Bassett, Robert, De Loera, Jesus A. and Louveaux, Quentin 2017. A quantitative Doignon-Bell-Scarf theorem. Combinatorica 37 , pp. 313-332. 10.1007/s00493-015-3266-9

Aliev, Iskander, Loera, Jesus De, Oertel, Timm and O'Neill, Christopher 2017. Sparse solutions of linear diophantine equations. SIAM Journal on Applied Algebra and Geometry 1 (1) , pp. 239-253. 10.1137/16M1083876

Aliev, Iskander, Henk, Martin and Oertel, Timm 2017. Integrality gaps of integer knapsack problems. Lecture Notes in Computer Science 10328 , pp. 25-38. 10.1007/978-3-319-59250-3_3

Aliev, Iskander 2016. A sharp upper bound for the Lattice Programming Gap. Moscow Journal of Combinatorics and Number Theory 6 (2-3) , pp. 121-129.

Aliev, Iskander, De Loera, Jesus and Louveaux, Quentin 2016. Parametric polyhedra with at least k lattice points: their semigroup structure and the k-Frobenius problem. In: Beveridge, A., Griggs, J. R., Hogben, L., Musiker, G. and Tetali, P. eds. Recent Trends in Combinatorics, The IMA Volumes in Mathematics and its Applications, Springer, pp. 753-778. (10.1007/978-3-319-24298-9_29)

Aliev, Iskander 2015. On the lattice programming gap of the group problems. Operations Research Letters 43 (2) , pp. 199-202. 10.1016/j.orl.2015.01.008

Aliev, Iskander and Mohammed, Dilbak 2015. On the distance between Frobenius numbers. Moscow Journal of Combinatorics and Number Theory 5 (4) , pp. 205-214.

Aliev, Iskander and Letchford, Adam 2014. Iterated Chvátal--Gomory cuts and the geometry of numbers. SIAM Journal on Optimization 24 (3) , pp. 1294-1312. 10.1137/130926389

Aliev, Iskander, Henk, Martin and Linke, Eva 2013. Integer points in knapsack polytopes and s-covering radius. Electronic Journal of Combinatorics 20 (2) , P42.

Aliev, Iskander and Henk, Martin 2012. LLL-reduction for integer knapsacks. Journal of Combinatorial Optimization 24 (4) , pp. 613-626. 10.1007/s10878-011-9411-5

Aliev, Iskander and Smyth, Chris 2012. Solving algebraic equations in roots of unity. Forum Mathematicum 24 (3) , pp. 641-665. 10.1515/form.2011.087

Aliev, Iskander, Fukshansky, Lenny and Henk, Martin 2012. Generalized Frobenius numbers: bounds and average behavior. Acta Arithmetica 155 , pp. 53-62.

Aliev, Iskander, Henk, Martin and Hinrichs, Aicke 2011. Expected Frobenius numbers. Journal of Combinatorial Theory, Series A 118 (2) , pp. 525-531. 10.1016/j.jcta.2009.12.012

Aliev, Iskander and Henk, Martin 2010. Feasibility of integer knapsacks. Siam Journal of Optimization 20 (6) , pp. 2978-2993. 10.1137/090778043

Aliev, Iskander and Henk, Martin 2009. Integer knapsacks: average behavior of the Frobenius numbers. Mathematics of Operations Research 34 (3) , pp. 698-705. 10.1287/moor.1090.0393

Aliev, Iskander 2008. Siegel's lemma and sum-distinct sets. Discrete & Computational Geometry 39 (1-3) , pp. 59-66. 10.1007/s00454-008-9059-9

Aliev, Iskander and Gruber, Peter M. 2007. An optimal lower bound for the Frobenius problem. Journal of Number Theory 123 (1) , pp. 71-79. 10.1016/j.jnt.2006.05.020

Aliev, Iskander and Gruber, Peter M. 2006. Lattice points in large Borel sets and successive minima. Discrete & Computational Geometry 35 (3) , pp. 429-435. 10.1007/s00454-005-1228-5

Aliev, Iskander and Henk, Martin 2006. Successive minima and best simultaneous Diophantine approximations. Monatshefte für Mathematik 147 (2) , pp. 95-101. 10.1007/s00605-005-0344-x

Aliev, Iskander and Gruber, Peter M. 2006. Best simultaneous diophantine approximations under a constraint on the denominator. Contributions to Discrete Mathematics 1 (1) , pp. 29-46.

Aliev, Iskander, Schinzel, A. and Schmidt, W. M. 2005. On vectors whose span contains a given linear subspace. Monatshefte für Mathematik 144 (3) , pp. 177-191. 10.1007/s00605-004-0267-y

Aliev, Iskander 2002. On a decomposition of integer vectors, II. Acta Arithmetica 57 (2) , pp. 159-164.

Aliev, Iskander 2001. On a decomposition of integer vectors, I. Bulletin of the Polish Academy of Sciences Mathematics 49 , pp. 141-146.

Aliev, Iskander and Zhigljavsky, Anatoly 1999. Weyl sequences: asymptotic distributions of the partition lengths. Acta Arithmetica 88 (4) , pp. 351-361.

Aliev, Iskander, Kanemitsu, Shigeru and Schinzel, Andrzej 1998. On the metric theory of continued fractions. Colloquium Mathematicum 77 , pp. 141-145.

This list was generated on Mon Mar 1 04:14:54 2021 GMT.