Igor S. Litvinchev

Author Info

Name	Affiliation	Papers
IGOR S. LITVINCHEV	Computing Center, Russian Academy of Sciences, Vavilov 40, 117967 Moscow, Russia	29
Collaborators	Citations	PageRank
65	33	10.71
Referers	Referees	References
79	274	177

Search Limit

100274

Publications (29 rows)

Collaborators (65 rows)

Referers (79 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Balanced Circular Packing Problems with Distance Constraints	0	0.34	2022
Optimal Layout Of Ellipses And Its Application For Additive Manufacturing	0	0.34	2021
Sparsest balanced packing of irregular 3D objects in a cylindrical container	0	0.34	2021
Sparsest Packing Of Two-Dimensional Objects	0	0.34	2021
Nature-inspired meta-heuristics approaches for charging plug-in hybrid electric vehicle	0	0.34	2020
Packing ellipses in an optimized rectangular container	0	0.34	2020
Random Matrix Generators for Optimizing a Fuzzy Biofuel Supply Chain System.	2	0.37	2020
Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect	0	0.34	2020
A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container	0	0.34	2020
Lagrangian Approach To Modeling Placement Conditions In Optimized Packing Problems	0	0.34	2020
Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach	0	0.34	2020
Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container	0	0.34	2020
Enhancing iris template matching with the optimal path method	0	0.34	2020
Packing ellipses in an optimized convex polygon	0	0.34	2019
Influence of degrading factors on the optimal spatial and spectral features of biometric templates.	0	0.34	2018
Research and development project portfolio selection under uncertainty.	1	0.37	2018
The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods.	6	0.59	2018
Using Valid Inequalities And Different Grids In Lp-Based Heuristic For Packing Circular Objects	0	0.34	2016
Using Different Norms in Packing Circular Objects.	0	0.34	2015
Solving the two-stage capacitated facility location problem by the lagrangian heuristic	2	0.36	2012
Lagrangian Bounds And A Heuristic For The Two-Stage Capacitated Facility Location Problem	2	0.39	2012
Large-scale public R&D portfolio selection by maximizing a biobjective impact measure	5	0.46	2010
Lagrangian heuristic for a class of the generalized assignment problems	2	0.36	2010
A Lagrangian bound for many-to-many assignment problems	5	0.50	2010
An integrated mathematical-computer approach for R&D project selection in large public organisations	3	0.42	2009
Using Milp Tools To Study R&D Portfolio Selection Model For Large Instances In Public And Social Sector	0	0.34	2008
Using error bounds to compare aggregated generalized transportation models	2	0.39	2006
On improved Choi-Goldfarb solution-containing ellipsoids in linear programming	0	0.34	2000
Localization of the optimal solution and a posteriori bounds for aggregation	3	0.43	1999