Igor S. Litvinchev

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 31

Top Topics

Valid Inequalities

Packing Problem

Top Venues

Wirel. Networks

Int. J. Prod. Res.

J. Glob. Optim.

Publications

Yuriy Stoyan, Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta
Packing Spheres into a Minimum-Height Parabolic Container. Axioms 13 (6) (2024)
Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Vladimir Dubinskyi, Luis Infante
Sparse layout of irregular 3D clusters. J. Oper. Res. Soc. 74 (1) (2023)
Josef Kallrath, Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Luis Infante
Packing convex polygons in minimum-perimeter convex hulls. J. Glob. Optim. 85 (1) (2023)
Zoia Duriagina, Alexander V. Pankratov, Tetyana Romanova, Igor S. Litvinchev, Julia A. Bennell, Igor Lemishka, Sergiy Maximov
Optimized Packing Titanium Alloy Powder Particles. Comput. 11 (2) (2023)
Igor S. Litvinchev, Tatiana E. Romanova
Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems. Mob. Networks Appl. 27 (5) (2022)
Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev, Petro Stetsyuk, Oleksii Lykhovyd, Jose Antonio Marmolejo Saucedo, Pandian Vasant
Balanced Circular Packing Problems with Distance Constraints. Comput. 10 (7) (2022)
Tatiana E. Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul
Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur. J. Oper. Res. 291 (1) (2021)
Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Konstantin Avramov, Marina Chernobryvko, Igor Yanchevskyi, Iryna Mozgova, Julia A. Bennell
Optimal layout of ellipses and its application for additive manufacturing. Int. J. Prod. Res. 59 (2) (2021)
Tatiana E. Romanova, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul
Sparsest packing of two-dimensional objects. Int. J. Prod. Res. 59 (13) (2021)
Timothy Ganesan, Pandian Vasant, Pratik Sanghvi, J. Joshua Thomas, Igor S. Litvinchev
Random Matrix Generators for Optimizing a Fuzzy Biofuel Supply Chain System. J. Adv. Eng. Comput. 4 (1) (2020)
Tatiana E. Romanova, Igor S. Litvinchev, Alexander V. Pankratov
Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. 285 (2) (2020)
Pandian Vasant, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar
Nature-inspired meta-heuristics approaches for charging plug-in hybrid electric vehicle. Wirel. Networks 26 (7) (2020)
Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev
Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Networks 26 (7) (2020)
Pandian Vasant, Fahad Parvez Mahdi, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar, Junzo Watada
Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect. Int. J. Appl. Metaheuristic Comput. 11 (3) (2020)
Igor S. Litvinchev, Tatiana E. Romanova, Rogelio Corrales-Diaz, Aned Esquerra-Arguelles, Alberto Martinez-Noa
Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems. Mob. Networks Appl. 25 (6) (2020)
Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
Packing ellipses in an optimized rectangular container. Wirel. Networks 26 (7) (2020)
Vladimir P. Novik, Ivan A. Matveev, Igor S. Litvinchev
Enhancing iris template matching with the optimal path method. Wirel. Networks 26 (7) (2020)
Rémy Dupas, Igor Grebennik, Igor S. Litvinchev, Tatiana E. Romanova, O. Chorna
Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach. EAI Endorsed Trans. Energy Web 7 (27) (2020)
Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov, Tatiana E. Romanova, Igor S. Litvinchev
Circular packing for support-free structures. EAI Endorsed Trans. Energy Web 7 (30) (2020)
Rafael Torres-Escobar, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev
A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container. Int. J. Appl. Metaheuristic Comput. 11 (3) (2020)
Pandian Vasant, Gerhard-Wilhelm Weber, Igor S. Litvinchev
Editorial. Comput. Intell. 36 (1) (2020)
Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, Sergey Shekhovtsov
Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem. ICO (2019)
Tetyana Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Jose Antonio Marmolejo Saucedo
Decomposition Algorithm for Irregular Placement Problems. ICO (2019)
Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
Packing ellipses in an optimized convex polygon. J. Glob. Optim. 75 (2) (2019)
Tatiana E. Romanova, Igor S. Litvinchev, Igor Grebennik, A. Kovalenko, Inna Urniaieva, Sergey Shekhovtsov
Packing Convex 3D Objects with Special Geometric and Balancing Conditions. ICO (2019)
Paulina Avila-Torres, Rafael Caballero, Igor S. Litvinchev, Fernando López Irarragorri, Pandian Vasant
The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods. J. Ambient Intell. Humaniz. Comput. 9 (3) (2018)
Ivan A. Matveev, Vladimir P. Novik, Igor S. Litvinchev
Influence of degrading factors on the optimal spatial and spectral features of biometric templates. J. Comput. Sci. 25 (2018)
Nancy M. Arratia Martínez, Rafael Caballero-Fernandez, Igor S. Litvinchev, Fernando López Irarragorri
Research and development project portfolio selection under uncertainty. J. Ambient Intell. Humaniz. Comput. 9 (3) (2018)
Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Pandian Vasant
Monkey Algorithm for Packing Circles with Binary Variables. ICO (2018)
Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects. ACIIDS (2) (2016)
Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
Using Different Norms in Packing Circular Objects. ACIIDS (2) (2015)
Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities. ICCL (2014)
Igor S. Litvinchev, Edith Lucero Ozuna Espinosa
Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem. Int. J. Energy Optim. Eng. 1 (1) (2012)
Igor S. Litvinchev, Edith Lucero Ozuna Espinosa
Solving the Two-Stage Capacitated Facility Location Problem by the Lagrangian Heuristic. ICCL (2012)
Igor S. Litvinchev, Fernando López Irarragorri, Ada M. Alvarez, Eduardo Fernández
Large-Scale Public R&D Portfolio Selection by Maximizing a Biobjective Impact Measure. IEEE Trans. Syst. Man Cybern. Part A 40 (3) (2010)
Igor S. Litvinchev, Socorro Rangel, Jania Saucedo
A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19 (3) (2010)
Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo
Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. 60 (4) (2010)
Eduardo Fernández, Fernando López Irarragorri, Jorge Navarro, Ines Vega, Igor S. Litvinchev
An integrated mathematical-computer approach for R&D project selection in large public organisations. Int. J. Math. Oper. Res. 1 (3) (2009)
Igor S. Litvinchev, Fernando López Irarragorri, Miguel Mata Pérez, Satu Elisa Schaeffer
Using MILP Tools to Study R&D Portfolio Selection Model for Large Instances in Public and Social Sector. Computación y Sistemas 12 (2) (2008)
Igor S. Litvinchev, Socorro Rangel
Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. 146 (1) (2006)
Igor S. Litvinchev
On improved Choi-Goldfarb solution-containing ellipsoids in linear programming. Oper. Res. Lett. 27 (1) (2000)
Igor S. Litvinchev, Socorro Rangel
Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26 (10-11) (1999)